Motion Planning for Unlabeled Discs with Optimality Guarantees. - Kiril Solovey; Jingjin Yu; Or Zamir; Dan Halperin (Robotics: Science and Systems, 2015)

The amortized cost of finding the minimum. - Haim Kaplan; Or Zamir; Uri Zwick (SODA, 2015)

Bottleneck Paths and Trees and Deterministic Graphical Games. - Shiri Chechik; Haim Kaplan; Mikkel Thorup; Or Zamir; Uri Zwick (STACS, 2016)

Subtree Isomorphism Revisited. - Amir Abboud; Arturs Backurs; Thomas Dueholm Hansen; Virginia Vassilevska Williams; Or Zamir (ACM Trans. Algorithms, 2018)

Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. - Jacob Holm; Valerie King; Mikkel Thorup; Or Zamir; Uri Zwick (FOCS, 2019)

Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps. - Mikkel Thorup; Or Zamir; Uri Zwick (ICALP, 2019)

Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. - Haim Kaplan; László Kozma 002; Or Zamir; Uri Zwick (SOSA, 2019)

A sort of an adversary. - Haim Kaplan; Or Zamir; Uri Zwick (SODA, 2019)

Faster k-SAT algorithms using biased-PPSZ. - Thomas Dueholm Hansen; Haim Kaplan; Or Zamir; Uri Zwick (STOC, 2019)

Breaking the 2n barrier for 5-coloring and 6-coloring. - Or Zamir (CoRR, 2020)

Breaking Barriers for the Satisfiability and Coloring Problems - Or Zamir (2020)

Breaking the 2ⁿ Barrier for 5-Coloring and 6-Coloring. - Or Zamir (ICALP, 2021)

Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering. - Shyam Narayanan; Sandeep Silwal; Piotr Indyk; Or Zamir (ICML, 2021)

Tight Space Complexity of the Coin Problem. - Mark Braverman; Sumegha Garg; Or Zamir (Electron. Colloquium Comput. Complex., 2021)

Faster Algorithm for Unique (k, 2)-CSP. - Or Zamir (ESA, 2022)

Planting Undetectable Backdoors in Machine Learning Models : [Extended Abstract]. - Shafi Goldwasser; Michael P. Kim; Vinod Vaikuntanathan; Or Zamir (FOCS, 2022)

Simulating a stack using queues. - Haim Kaplan; Robert E. Tarjan; Or Zamir; Uri Zwick (SODA, 2022)

Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond. - Amir Abboud; Karl Bringmann; Seri Khoury; Or Zamir (STOC, 2022)

Planting Undetectable Backdoors in Machine Learning Models. - Shafi Goldwasser; Michael P. Kim; Vinod Vaikuntanathan; Or Zamir (CoRR, 2022)

The Wrong Direction of Jensen's Inequality Is Algorithmically Right. - Or Zamir (ICALP, 2023)

Algorithmic Applications of Hypergraph and Partition Containers. - Or Zamir (STOC, 2023)

Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. - Kasper Green Larsen; Rasmus Pagh; Toniann Pitassi; Or Zamir (CoRR, 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; Giuseppe Persiano; Toniann Pitassi; Kevin Yeo; Or Zamir (ICALP, 2024)

Testing Sumsets is Hard. - Xi Chen 001; Shivam Nadimpalli; Tim Randolph 001; Rocco A. Servedio; Or Zamir (CoRR, 2024)

Excuse me, sir? Your language model is leaking (information). - Or Zamir (CoRR, 2024)

Unbounded Error Correcting Codes. - Klim Efremenko; Or Zamir (CoRR, 2024)

Optimality of Frequency Moment Estimation. - Mark Braverman; Or Zamir (Electron. Colloquium Comput. Complex., 2024)

Undetectable Steganography for Language Models. - Or Zamir (Trans. Mach. Learn. Res., 2024)

Sumsets in the Hypercube. - Noga Alon; Or Zamir (SIAM J. Discret. Math., 2025)

Improving Algorithmic Efficiency using Cryptography. - Vinod Vaikuntanathan; Or Zamir (CoRR, 2025)