( en | de | ru )

 

Disambiguation of "Fiat, Amos"

Author of the publication

copydeleteadd this publication to your clipboard
Secure Exchange of Modifiable Data and Queries.

, , , , and . BDA, (2005)

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.

Gernot Amoser

Amos Winkler

Amos Weissmann

Amos Schmidt

Dirk Amos

 

Other publications of authors with the same name

A case for associative peer to peer overlays., , and . Comput. Commun. Rev., 33 (1): 95-100 (2003)Provable Unlinkability Against Traffic Analysis with Low Message Overhead., , , , , , and . J. Cryptol., 28 (3): 623-640 (2015)Minimal Indices for Successor Search., , , and . CoRR, (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)Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs., and . ESA, volume 2832 of Lecture Notes in Computer Science, page 208-220. Springer, (2003)Provable Unlinkability against Traffic Analysis., , and . Financial Cryptography, volume 3110 of Lecture Notes in Computer Science, page 266-280. Springer, (2004)A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle., , , and . Algorithmica, 11 (6): 572-578 (1994)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)