| 2026 | ICALP | Tight Bounds for Low-Error Frequency Moment Estimation and the Power of Multiple Passes. | Naomi Green-Maimon, Or Zamir |
| 2026 | SODA | Unbounded Error Correcting Codes. | Klim Efremenko, Or Zamir |
| 2026 | SODA | Improving Algorithmic Efficiency using Cryptography: Trapdoored Matrices and Applications. | Vinod Vaikuntanathan, Or Zamir |
| 2025 | ESA | Testing Sumsets Is Hard. | Xi Chen, Shivam Nadimpalli, Tim Randolph, Rocco A. Servedio, Or Zamir |
| 2025 | STOC | Optimality of Frequency Moment Estimation. | Mark Braverman, Or Zamir |
| 2024 | COLT | Undetectable Watermarks for Language Models. | Miranda Christ, Sam Gunn, Or Zamir |
| 2024 | ICALP | Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. | Kasper Green Larsen, Rasmus Pagh, Giuseppe Persiano, Toniann Pitassi, Kevin Yeo, Or Zamir |
| 2023 | ICALP | The Wrong Direction of Jensen's Inequality Is Algorithmically Right. | Or Zamir |
| 2023 | STOC | Algorithmic Applications of Hypergraph and Partition Containers. | Or Zamir |
| 2022 | ESA | Faster Algorithm for Unique (k, 2)-CSP. | Or Zamir |
| 2022 | FOCS | Planting Undetectable Backdoors in Machine Learning Models : [Extended Abstract]. | Shafi Goldwasser, Michael P. Kim, Vinod Vaikuntanathan, Or Zamir |
| 2022 | SODA | Simulating a stack using queues. | Haim Kaplan, Robert E. Tarjan, Or Zamir, Uri Zwick |
| 2022 | STOC | Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond. | Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir |
| 2021 | FOCS | Tight Space Complexity of the Coin Problem. | Mark Braverman, Sumegha Garg, Or Zamir |
| 2021 | ICALP | Breaking the 2ⁿ Barrier for 5-Coloring and 6-Coloring. | Or Zamir |
| 2021 | ICML | Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering. | Shyam Narayanan, Sandeep Silwal, Piotr Indyk, Or Zamir |
| 2019 | FOCS | Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. | Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick |
| 2019 | ICALP | Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps. | Mikkel Thorup, Or Zamir, Uri Zwick |
| 2019 | SODA | Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. | Haim Kaplan, Lszl Kozma, Or Zamir, Uri Zwick |
| 2019 | SODA | A sort of an adversary. | Haim Kaplan, Or Zamir, Uri Zwick |
| 2019 | STOC | Faster | Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick |
| 2016 | SODA | Subtree Isomorphism Revisited. | Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir |
| 2016 | STACS | Bottleneck Paths and Trees and Deterministic Graphical Games. | Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick |
| 2015 | SODA | The amortized cost of finding the minimum. | Haim Kaplan, Or Zamir, Uri Zwick |