Or Zamir

According to our database, Or Zamir authored at least 29 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Optimality of Frequency Moment Estimation.

Mark Braverman, Or Zamir

Electron. Colloquium Comput. Complex., 2024

Unbounded Error Correcting Codes.

Klim Efremenko, Or Zamir

CoRR, 2024

Sumsets in the Hypercube.

Noga Alon, Or Zamir

CoRR, 2024

Excuse me, sir? Your language model is leaking (information).

Or Zamir

CoRR, 2024

Testing Sumsets is Hard.

Xi Chen, Shivam Nadimpalli, Tim Randolph, Rocco A. Servedio, Or Zamir

CoRR, 2024

Optimal Non-Adaptive Cell Probe Dictionaries and Hashing.

Kasper Green Larsen, Rasmus Pagh, Giuseppe Persiano, Toniann Pitassi, Kevin Yeo, Or Zamir

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Undetectable Watermarks for Language Models.

Miranda Christ, Sam Gunn, Or Zamir

IACR Cryptol. ePrint Arch., 2023

Optimal Non-Adaptive Cell Probe Dictionaries and Hashing.

Kasper Green Larsen, Rasmus Pagh, Toniann Pitassi, Or Zamir

CoRR, 2023

Algorithmic Applications of Hypergraph and Partition Containers.

Or Zamir

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

The Wrong Direction of Jensen's Inequality Is Algorithmically Right.

Or Zamir

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Planting Undetectable Backdoors in Machine Learning Models.

Shafi Goldwasser, Michael P. Kim, Vinod Vaikuntanathan, Or Zamir

CoRR, 2022

Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond.

Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Simulating a stack using queues.

Haim Kaplan, Robert E. Tarjan, Or Zamir, Uri Zwick

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

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

Shafi Goldwasser, Michael P. Kim, Vinod Vaikuntanathan, Or Zamir

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Faster Algorithm for Unique (k, 2)-CSP.

Or Zamir

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Tight Space Complexity of the Coin Problem.

Mark Braverman, Sumegha Garg, Or Zamir

Electron. Colloquium Comput. Complex., 2021

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

Shyam Narayanan, Sandeep Silwal, Piotr Indyk, Or Zamir

Proceedings of the 38th International Conference on Machine Learning, 2021

Breaking the 2ⁿ Barrier for 5-Coloring and 6-Coloring.

Or Zamir

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Breaking Barriers for the Satisfiability and Coloring Problems

Or Zamir

PhD thesis, 2020

Breaking the 2ⁿ barrier for 5-coloring and 6-coloring.

Or Zamir

CoRR, 2020

2019

Faster <i>k</i>-SAT algorithms using biased-PPSZ.

Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

A sort of an adversary.

Haim Kaplan, Or Zamir, Uri Zwick

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps.

Haim Kaplan, László Kozma, Or Zamir, Uri Zwick

Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps.

Mikkel Thorup, Or Zamir, Uri Zwick

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges.

Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Subtree Isomorphism Revisited.

Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir

ACM Trans. Algorithms, 2018

2016

Bottleneck Paths and Trees and Deterministic Graphical Games.

Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015

The amortized cost of finding the minimum.

Haim Kaplan, Or Zamir, Uri Zwick

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Motion Planning for Unlabeled Discs with Optimality Guarantees.

Kiril Solovey, Jingjin Yu, Or Zamir, Dan Halperin

Proceedings of the Robotics: Science and Systems XI, Sapienza University of Rome, 2015