( en | de | ru )

 

Disambiguation of "Naor, Moni"

Author of the publication

copydeleteadd this publication to your clipboard
Novel architectures for P2P applications

, and . ACM Transactions on Algorithms, 3 (3): 34 (August 2007)
DOI: 10.1145/1273340.1273350

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.

Moni Wekesa

Kaustuv moni Basu

Erich Moning

Wilhelm Mönikes

Roman Mönig

 

Other publications of authors with the same name

On fairness in the carpool problem.. J. Algorithms, 55 (1): 93-98 (2005)Tight Bounds for Sliding Bloom Filters., and . Algorithmica, 73 (4): 652-672 (2015)White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing., , and . J. ACM, 66 (5): 34:1-34:28 (2019)Primary-Secondary-Resolver Membership Proof Systems., and . TCC (2), volume 9015 of Lecture Notes in Computer Science, page 199-228. Springer, (2015)Bloom Filters in Adversarial Environments., and . CRYPTO (2), volume 9216 of Lecture Notes in Computer Science, page 565-584. Springer, (2015)Bloom Filters in Adversarial Environments., and . ACM Trans. Algorithms, 15 (3): 35:1-35:30 (2019)Access Control and Signatures via Quorum Secret Sharing., and . ACM Conference on Computer and Communications Security, page 157-168. ACM, (1996)The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets., , , , and . SPAA, page 367-375. ACM, (2016)The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets., , , , and . CoRR, (2014)Nonoblivious Hashing., , , and . J. ACM, 39 (4): 764-782 (1992)