Eylon Yogev

View Scopus Profile

Eylon Yogev

 https://orcid.org/0000-0001-8599-2472
20132024

Research activity per year

Search results

  • 2024

    STIR: Reed-Solomon Proximity Testing with Fewer Queries

    Arnon, G., Chiesa, A., Fenzi, G. & Yogev, E., 2024, Advances in Cryptology – CRYPTO 2024 - 44th Annual International Cryptology Conference, Proceedings. Reyzin, L. & Stebila, D. (eds.). Springer Science and Business Media Deutschland GmbH, p. 380-413 34 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14929 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2023

    IOPs with Inverse Polynomial Soundness Error

    Arnon, G., Chiesa, A. & Yogev, E., 2023, Proceedings - 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, FOCS 2023. IEEE Computer Society, p. 752-761 10 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations

  • On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds

    Chen, L., Rothblum, R. D., Tell, R. & Yogev, E., 12 Aug 2023, In: Journal of the ACM. 70, 4, 3593581.

    Research output: Contribution to journal › Article › peer-review

    Open Access

  • Rogue-Instance Security for Batch Knowledge Proofs

    Segev, G., Sharabi, A. & Yogev, E., 2023, Theory of Cryptography - 21st International Conference, TCC 2023, Proceedings. Rothblum, G. & Wee, H. (eds.). Springer Science and Business Media Deutschland GmbH, p. 121-157 37 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14369 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations

  • Secure Distributed Network Optimization Against Eavesdroppers

    Hitron, Y., Parter, M. & Yogev, E., 1 Jan 2023, 14th Innovations in Theoretical Computer Science Conference, ITCS 2023. Kalai, Y. T. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 71. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 251).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    3 Scopus citations

  • SPHINCS+C: Compressing SPHINCS+ with (Almost) No Cost

    Hülsing, A., Kudinov, M., Ronen, E. & Yogev, E., 2023, Proceedings - 44th IEEE Symposium on Security and Privacy, SP 2023. Institute of Electrical and Electronics Engineers Inc., p. 1435-1453 19 p. (Proceedings - IEEE Symposium on Security and Privacy; vol. 2023-May).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations
  • 2022

    A Framework for Adversarially Robust Streaming Algorithms

    Ben-Eliezer, O., Jayaram, R., Woodruff, D. P. & Yogev, E., Apr 2022, In: Journal of the ACM. 69, 2, 17.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    16 Scopus citations

  • A PCP Theorem for Interactive Proofs and Applications

    Arnon, G., Chiesa, A. & Yogev, E., 2022, Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings. Dunkelman, O. & Dziembowski, S. (eds.). Springer Science and Business Media Deutschland GmbH, p. 64-94 31 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13276 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    3 Scopus citations

  • A Toolbox for Barriers on Interactive Oracle Proofs

    Arnon, G., Bhangale, A., Chiesa, A. & Yogev, E., 2022, Theory of Cryptography - 20th International Conference, TCC 2022, Proceedings. Kiltz, E. & Vaikuntanathan, V. (eds.). Springer Science and Business Media Deutschland GmbH, p. 447-466 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13747 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations

  • Broadcast CONGEST Algorithms Against Eavesdroppers

    Hitron, Y., Parter, M. & Yogev, E., 1 Oct 2022, 36th International Symposium on Distributed Computing, DISC 2022. Scheideler, C. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 27. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 246).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    4 Scopus citations

  • Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs

    Arnon, G., Chiesa, A. & Yogev, E., 1 Jul 2022, 37th Computational Complexity Conference, CCC 2022. Lovett, S. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 24. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 234).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    3 Scopus citations

  • Lower Bound on SNARGs in the Random Oracle Model

    Haitner, I., Nukrai, D. & Yogev, E., 2022, Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings. Dodis, Y. & Shrimpton, T. (eds.). Springer Science and Business Media Deutschland GmbH, p. 97-127 31 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13509 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • ONE-WAY FUNCTIONS AND (IM)PERFECT OBFUSCATION

    Komargodski, I., Moran, T., Naor, M., Pass, R., Rosen, A. & Yogev, E., 2022, In: SIAM Journal on Computing. 51, 6, p. 1769-1795 27 p.

    Research output: Contribution to journal › Article › peer-review

    1 Scopus citations
  • 2021

    Adversarial laws of large numbers and optimal regret in online classification

    Alon, N., Ben-Eliezer, O., Dagan, Y., Moran, S., Naor, M. & Yogev, E., 15 Jun 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). Association for Computing Machinery, p. 447-455 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    30 Scopus citations

  • A Framework for Adversarially Robust Streaming Algorithms

    Ben-Eliezer, O., Jayaram, R., Woodruff, D. P. & Yogev, E., Mar 2021, In: SIGMOD Record. 50, 1, p. 6-13 8 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    10 Scopus citations

  • Subquadratic SNARGs in the Random Oracle Model

    Chiesa, A. & Yogev, E., 2021, Advances in Cryptology – CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Proceedings. Malkin, T. & Peikert, C. (eds.). Springer Science and Business Media Deutschland GmbH, p. 711-741 31 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12825 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    3 Scopus citations

  • Tight Security Bounds for Micali’s SNARGs

    Chiesa, A. & Yogev, E., 2021, Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings. Nissim, K., Waters, B. & Waters, B. (eds.). Springer Science and Business Media Deutschland GmbH, p. 401-434 34 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13042 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    3 Scopus citations
  • 2020

    A Framework for Adversarially Robust Streaming Algorithms

    Ben-Eliezer, O., Jayaram, R., Woodruff, D. P. & Yogev, E., 14 Jun 2020, PODS 2020 - Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. Association for Computing Machinery, p. 63-80 18 p. (Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    38 Scopus citations

  • Barriers for succinct arguments in the random oracle model

    Chiesa, A. & Yogev, E., 2020, Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings. Pass, R. & Pietrzak, K. (eds.). Springer Science and Business Media Deutschland GmbH, p. 47-76 30 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12551 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    3 Scopus citations

  • Hardness of continuous local search: Query complexity and cryptographic lower bounds

    HUBÁČEK, P. & YOGEV, E., 2020, In: SIAM Journal on Computing. 49, 6, p. 1128-1172 45 p.

    Research output: Contribution to journal › Article › peer-review

    13 Scopus citations

  • Interactive proofs for social graphs

    Katzir, L., Shikhelman, C. & Yogev, E., 2020, Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, Proceedings. Micciancio, D. & Ristenpart, T. (eds.). Springer, p. 574-601 28 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12172 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations

  • On exponential-time hypotheses, derandomization, and circuit lower bounds: Extended abstract

    Chen, L., Rothblum, R. D., Tell, R. & Yogev, E., Nov 2020, Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020. IEEE Computer Society, p. 13-23 11 p. 9317898. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2020-November).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    11 Scopus citations

  • The Adversarial Robustness of Sampling

    Ben-Eliezer, O. & Yogev, E., 14 Jun 2020, PODS 2020 - Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. Association for Computing Machinery, p. 49-62 14 p. (Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    30 Scopus citations

  • The power of distributed verifiers in interactive proofs

    Naor, M., Parter, M. & Yogev, E., 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 1096-1115 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2020-January).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    39 Scopus citations

  • Transparent error correcting in a computationally bounded world

    Grossman, O., Holmgren, J. & Yogev, E., 2020, Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings. Pass, R. & Pietrzak, K. (eds.). Springer Science and Business Media Deutschland GmbH, p. 530-549 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12552 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2019

    Bloom filters in adversarial environments

    Naor, M. & Eylon, Y., May 2019, In: ACM Transactions on Algorithms. 15, 3, 0080.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    22 Scopus citations

  • CB2CF: A neural multiview content-to-collaborative filtering model for completely cold item recommendations

    Barkan, O., Koenigstein, N., Yogev, E. & Katz, O., 10 Sep 2019, RecSys 2019 - 13th ACM Conference on Recommender Systems. Association for Computing Machinery, Inc, p. 228-236 9 p. (RecSys 2019 - 13th ACM Conference on Recommender Systems).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    61 Scopus citations

  • Distributed algorithms made secure: A graph theoretic approach

    Parter, M. & Yogev, E., 2019, p. 1693-1710. 18 p.

    Research output: Contribution to conference › Paper › peer-review

    Open Access
    11 Scopus citations

  • Distributional collision resistance beyond one-way functions

    Bitansky, N., Haitner, I., Komargodski, I. & Yogev, E., 2019, Advances in Cryptology – EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Ishai, Y. & Rijmen, V. (eds.). Springer Verlag, p. 667-695 29 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11478 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    6 Scopus citations

  • Low congestion cycle covers and their applications

    Parter, M. & Yogev, E., 2019, p. 1673-1692. 20 p.

    Research output: Contribution to conference › Paper › peer-review

    Open Access
    15 Scopus citations

  • Optimal short cycle decomposition in almost linear time

    Parter, M. & Yogev, E., 1 Jul 2019, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Baier, C., Chatzigiannakis, I., Flocchini, P. & Leonardi, S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 89. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 132).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    14 Scopus citations

  • Parallel balanced allocations: The heavily loaded case

    Lenzen, C., Parter, M. & Yogev, E., 17 Jun 2019, SPAA 2019 - Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 313-322 10 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    8 Scopus citations

  • Secure distributed computing made (nearly) optimal

    Parter, M. & Yogev, E., 16 Jul 2019, PODC 2019 - Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 107-116 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    16 Scopus citations

  • White-box vs. Black-box complexity of search problems: Ramsey and graph property testing

    Komargodski, I., Naor, M. & Yogev, E., Jul 2019, In: Journal of the ACM. 66, 5, 34.

    Research output: Contribution to journal › Article › peer-review

    10 Scopus citations
  • 2018

    Another step towards realizing random oracles: Non-malleable point obfuscation

    Komargodski, I. & Yogev, E., 2018, Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2018 Proceedings. Nielsen, J. B. & Rijmen, V. (eds.). Springer Verlag, p. 259-279 21 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10820 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    6 Scopus citations

  • Collision resistant hashing for paranoids: dealing with multiple collisions

    Komargodski, I., Naor, M. & Yogev, E., 2018, Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2018 Proceedings. Nielsen, J. B. & Rijmen, V. (eds.). Springer Verlag, p. 162-194 33 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10821 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    30 Scopus citations

  • Congested clique algorithms for graph spanners

    Parter, M. & Yogev, E., 1 Oct 2018, 32nd International Symposium on Distributed Computing, DISC 2018. Schmid, U. & Widder, J. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 40. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 121).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    20 Scopus citations

  • Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions

    Komargodski, I., Segev, G. & Yogev, E., 1 Jan 2018, In: Journal of Cryptology. 31, 1, p. 60-100 41 p.

    Research output: Contribution to journal › Article › peer-review

    7 Scopus citations

  • How to Share a Secret, Infinitely

    Komargodski, I., Naor, M. & Yogev, E., Jun 2018, In: IEEE Transactions on Information Theory. 64, 6, p. 4179-4190 12 p.

    Research output: Contribution to journal › Article › peer-review

    13 Scopus citations

  • On distributional collision resistant hashing

    Komargodski, I. & Yogev, E., 2018, Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings. Boldyreva, A. & Shacham, H. (eds.). Springer Verlag, p. 303-327 25 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10992 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    13 Scopus citations
  • 2017

    Hardness of continuous local search: Query complexity and cryptographic lower bounds

    Hubáček, P. & Yogev, E., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 1352-1371 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    30 Scopus citations

  • Non-interactive multiparty computation without correlated randomness

    Halevi, S., Ishai, Y., Jain, A., Komargodski, I., Sahai, A. & Yogev, E., 2017, Advances in Cryptology – ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings. Takagi, T. & Peyrin, T. (eds.). Springer Verlag, p. 181-211 31 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10626 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    26 Scopus citations

  • Secret-Sharing for NP

    Komargodski, I., Naor, M. & Yogev, E., 1 Apr 2017, In: Journal of Cryptology. 30, 2, p. 444-469 26 p.

    Research output: Contribution to journal › Article › peer-review

    27 Scopus citations

  • The Journey from NP to TFNP Hardness

    Hubácek, P., Naor, M. & Yogev, E., 1 Nov 2017, 8th Innovations in Theoretical Computer Science Conference, ITCS 2017. Papadimitriou, C. H. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 67).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    20 Scopus citations

  • White-box vs. black-box complexity of search problems: Ramsey and graph property testing

    Komargodski, I., Naor, M. & Yogev, E., 10 Nov 2017, Proceedings - 58th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2017. IEEE Computer Society, p. 622-632 11 p. 8104095. (Annual Symposium on Foundations of Computer Science - Proceedings; vol. 2017-October).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    21 Scopus citations
  • 2016

    How to share a secret, infinitely

    Komargodski, I., Naor, M. & Yogev, E., 2016, Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings. Smith, A. & Hirt, M. (eds.). Springer Verlag, p. 485-514 30 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9986 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    24 Scopus citations

  • Universal constructions and robust combiners for indistinguishability obfuscation and witness encryption

    Ananth, P., Jain, A., Naor, M., Sahai, A. & Yogev, E., 2016, Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings. Robshaw, M. & Katz, J. (eds.). Springer Verlag, p. 491-520 30 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9815).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    22 Scopus citations
  • 2015

    Bloom filters in adversarial environments

    Naor, M. & Yogev, E., 2015, Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Proceedings. Gennaro, R. & Robshaw, M. (eds.). Springer Verlag, p. 565-584 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9216).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    27 Scopus citations

  • Functional encryption for randomized functionalities in the private-key setting from minimal assumptions

    Komargodski, I., Segev, G. & Yogev, E., 2015, Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings. Dodis, Y. & Nielsen, J. B. (eds.). Springer Verlag, p. 352-377 26 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9015).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    14 Scopus citations

  • Tight Bounds for Sliding Bloom Filters

    Naor, M. & Yogev, E., 1 Dec 2015, In: Algorithmica. 73, 4, p. 652-672 21 p.

    Research output: Contribution to journal › Article › peer-review

    12 Scopus citations
Your message has successfully been sent.
Your message was not sent due to an error.