( en | de | ru )

 

Disambiguation of "Reingold, Omer"

Author of the publication

copydeleteadd this publication to your clipboard
Fault tolerance in large games.

, and . EC, page 274-283. ACM, (2008)

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.

Emin Sinan Ömeroglu

Lutful Mannan Osama Omer

Osman Hussein Omer

Abrehet Mohammed Omer

Lutful Mannan Osama Omer

 

Other publications of authors with the same name

Completeness in two-party secure computation: a computational view., , , and . STOC, page 252-261. ACM, (2004)Only valuable experts can be valued., , , and . EC, page 221-222. ACM, (2011)On the Power of the Randomized Iterate, , and . Electron. Colloquium Comput. Complex., (2005)Balls and Bins: Smaller Hash Families and Faster Evaluation., , , and . SIAM J. Comput., 42 (3): 1030-1050 (2013)Immunizing Encryption Schemes from Decryption Errors., , and . EUROCRYPT, volume 3027 of Lecture Notes in Computer Science, page 342-360. Springer, (2004)Number-theoretic Constructions of Efficient Pseudo-random Functions, and . J. ACM, 51 (2): 231--262 (March 2004)On the Communication Complexity of Key-Agreement Protocols., , , , and . ITCS, volume 124 of LIPIcs, page 40:1-40:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Deterministic Approximation of Random Walks in Small Space., , , and . APPROX-RANDOM, volume 145 of LIPIcs, page 42:1-42:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Pseudorandom Bit Generators That Fool Modular Sums., , , and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 615-630. Springer, (2009)Efficient Batch Verification for UP., , and . CCC, volume 102 of LIPIcs, page 22:1-22:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)