( en | de | ru )

 

Disambiguation of "Yogev, Eylon"

Author of the publication

copydeleteadd this publication to your clipboard
Bloom Filters in Adversarial Environments.

, and . CRYPTO (2), volume 9216 of Lecture Notes in Computer Science, page 565-584. Springer, (2015)

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.

Nir Yogev

 

Other publications of authors with the same name

The Power of Distributed Verifiers in Interactive Proofs., , and . Electron. Colloquium Comput. Complex., (2018)Transparent Error Correcting in a Computationally Bounded World., , and . TCC (3), volume 12552 of Lecture Notes in Computer Science, page 530-549. Springer, (2020)The Adversarial Robustness of Sampling., and . PODS, page 49-62. ACM, (2020)On Distributional Collision Resistant Hashing., and . CRYPTO (2), volume 10992 of Lecture Notes in Computer Science, page 303-327. Springer, (2018)Interactive Proofs for Social Graphs., , and . CRYPTO (3), volume 12172 of Lecture Notes in Computer Science, page 574-601. Springer, (2020)IOPs with Inverse Polynomial Soundness Error., , and . FOCS, page 752-761. IEEE, (2023)Sliding Bloom Filters., and . ISAAC, volume 8283 of Lecture Notes in Computer Science, page 513-523. Springer, (2013)Congested Clique Algorithms for Graph Spanners., and . DISC, volume 121 of LIPIcs, page 40:1-40:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds., and . Electron. Colloquium Comput. Complex., (2016)Parallel Balanced Allocations: The Heavily Loaded Case., , and . SPAA, page 313-322. ACM, (2019)