Author of the publication

Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract).

, , , and . STOC, page 519-530. ACM, (1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

How to Prove Yourself: Practical Solutions to Identification and Signature Problems, and . Advances in cryptology -- CRYPTO '86, volume 263 of Lecture Notes in Computer Science, page 186--194. Springer, (1987)Competitive Algorithms for Layered Graph Traversal., , , , , and . SIAM J. Comput., 28 (2): 447-462 (1998)A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle., , , and . Algorithmica, 11 (6): 572-578 (1994)Minimal Indices for Successor Search., , , and . CoRR, (2013)Storing and Searching a Multikey Table (Extended Abstract), , , , and . STOC, page 344-353. ACM, (1988)Approaching utopia: strong truthfulness and externality-resistant mechanisms., , , and . ITCS, page 221-230. ACM, (2013)Why study the price of anarchy?: technical perspective.. Commun. ACM, 55 (7): 115 (2012)Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract)., , , and . STOC, page 519-530. ACM, (1996)A case for associative peer to peer overlays., , and . Comput. Commun. Rev., 33 (1): 95-100 (2003)Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs., and . ESA, volume 2832 of Lecture Notes in Computer Science, page 208-220. Springer, (2003)