No photo of Or Zamir

View Scopus Profile

Zamir Or

Doctor

Tel Aviv University

20152024

Research activity per year

  • 17 Conference contribution
  • 1 Article
  • 1 Conference article
Filter
Conference contribution

Search results

  • 2024

    Optimal Non-Adaptive Cell Probe Dictionaries and Hashing

    Larsen, K. G., Pagh, R., Persiano, G., Pitassi, T., Yeo, K. & Zamir, O., Jul 2024, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024. Bringmann, K., Grohe, M., Puppis, G. & Svensson, O. (eds.). 104. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 297).

    Tel Aviv University

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

  • 2023

    Algorithmic Applications of Hypergraph and Partition Containers

    Zamir, O., 2 Jun 2023, STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Saha, B. & Servedio, R. A. (eds.). p. 985-998 14 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

  • The Wrong Direction of Jensen’s Inequality Is Algorithmically Right

    Zamir, O., Jul 2023, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023. Etessami, K., Feige, U. & Puppis, G. (eds.). 107. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 261).

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

  • 2022

    Faster Algorithm for Unique (k, 2)-CSP

    Zamir, O., 1 Sep 2022, 30th Annual European Symposium on Algorithms, ESA 2022. Chechik, S., Navarro, G., Rotenberg, E. & Herman, G. (eds.). (Leibniz International Proceedings in Informatics, LIPIcs; vol. 244).

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

  • Planting Undetectable Backdoors in Machine Learning Models: [Extended Abstract]

    Goldwasser, S., Kim, M. P., Vaikuntanathan, V. & Zamir, O., 2022, Proceedings - 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science, FOCS 2022. IEEE Computer Society, p. 931-942 12 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2022-October).

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

  • Simulating a stack using queues

    Kaplan, H., Tarjan, R. E., Zamir, O. & Zwick, U., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. p. 1901-1924 24 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).

    Tel Aviv University

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

  • Tight Space Complexity of the Coin Problem

    Braverman, M., Garg, S. & Zamir, O., 2022, Proceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021. IEEE Computer Society, p. 1068-1079 12 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2022-February).

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

  • 2021

    Breaking the 2nBarrier for 5-Coloring and 6-Coloring

    Zamir, O., 1 Jul 2021, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021. Bansal, N., Merelli, E. & Worrell, J. (eds.). 113. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 198).

    Tel Aviv University

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

  • Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering

    Narayanan, S., Silwal, S., Indyk, P. & Zamir, O., 2021, Proceedings of the 38th International Conference on Machine Learning, ICML 2021. p. 7948-7957 10 p. (Proceedings of Machine Learning Research; vol. 139).

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

  • 2019

    A sort of an adversary

    Kaplan, H., Zamir, O. & Zwick, U., 2019, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. p. 1291-1310 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Tel Aviv University

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

    Open Access

  • Dynamic ordered sets with approximate queries, approximate heaps and soft heaps

    Thorup, M., Zamir, O. & Zwick, U., 1 Jul 2019, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Baier, C., Chatzigiannakis, I., Flocchini, P. & Leonardi, S. (eds.). 95. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 132).

    Tel Aviv University

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

  • Faster k-SAT algorithms using Biased-PPSZ

    Hansen, T. D., Kaplan, H., Zamir, O. & Zwick, U., 23 Jun 2019, STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Charikar, M. & Cohen, E. (eds.). p. 578-589 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Tel Aviv University

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

  • Random k-out subgraph leaves only O(n/k) inter-component edges

    Holm, J., King, V., Thorup, M., Zamir, O. & Zwick, U., Nov 2019, Proceedings - 2019 IEEE 60th Annual Symposium on Foundations of Computer Science, FOCS 2019. IEEE Computer Society, p. 896-909 14 p. 8948658. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2019-November).

    Tel Aviv University

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

    Open Access

  • Selection from heaps, row-sorted matrices, and X + Y using soft heaps

    Kaplan, H., Kozma, L., Zamir, O. & Zwick, U., Jan 2019, 2nd Symposium on Simplicity in Algorithms, SOSA 2019 - Co-located with the 30th ACM-SIAM Symposium on Discrete Algorithms, SODA 2019. Fineman, J. T. & Mitzenmacher, M. (eds.). 5. (OpenAccess Series in Informatics; vol. 69).

    Tel Aviv University

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

  • 2016

    Bottleneck paths and trees and deterministic Graphical games

    Chechik, S., Kaplan, H., Thorup, M., Zamir, O. & Zwick, U., 1 Feb 2016, 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016. Vollmer, H. & Ollinger, N. (eds.). 27. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 47).

    Tel Aviv University

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

  • 2015

    Motion planning for unlabeled discs with optimality guarantees

    Solovey, K., Yu, J., Zamir, O. & Halperin, D., 2015, Robotics: Science and Systems XI, RSS 2015. Buchli, J., Hsu, D. & Kavraki, L. E. (eds.). MIT Press Journals, (Robotics: Science and Systems; vol. 11).

    Tel Aviv University

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

    Open Access

  • The amortized cost of finding the minimum

    Kaplan, H., Zamir, O. & Zwick, U., 2015, Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015. January ed. p. 757-768 12 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2015-January, no. January).

    Tel Aviv University

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

    Open Access