Or Zamir - RankMe

53 papers A* 19A 3Journal 28Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Note on Non-Composability of Layerwise Approximate Verification for Neural Inference. CoRR Or Zamir
2026	A*	`conf`	Improving Algorithmic Efficiency using Cryptography: Trapdoored Matrices and Applications. SODA Vinod Vaikuntanathan, Or Zamir
2026	A*	`conf`	Unbounded Error Correcting Codes. SODA Klim Efremenko, Or Zamir
2025	J	`jnl`	Consensus Sampling for Safer Generative AI. CoRR Adam Tauman Kalai, Yael Tauman Kalai, Or Zamir
2025	J	`jnl`	Improving Algorithmic Efficiency using Cryptography. CoRR Vinod Vaikuntanathan, Or Zamir
2025	A*	`conf`	Optimality of Frequency Moment Estimation. STOC Mark Braverman, Or Zamir
2025	J	`jnl`	Sumsets in the Hypercube. SIAM J. Discret. Math. Noga Alon, Or Zamir
2025	A	`conf`	Testing Sumsets Is Hard. ESA Xi Chen, Shivam Nadimpalli, Tim Randolph, Rocco A. Servedio, Or Zamir
2025	J	`jnl`	Tight Bounds for Low-Error Frequency Moment Estimation and the Power of Multiple Passes. CoRR Naomi Green-Maimon, Or Zamir
2024	J	`jnl`	Excuse me, sir? Your language model is leaking (information). CoRR Or Zamir
2024	A*	`conf`	Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. ICALP Kasper Green Larsen, Rasmus Pagh, Giuseppe Persiano, Toniann Pitassi, Kevin Yeo, Or Zamir
2024	J	`jnl`	Optimality of Frequency Moment Estimation. CoRR Mark Braverman, Or Zamir
2024	J	`jnl`	Optimality of Frequency Moment Estimation. Electron. Colloquium Comput. Complex. Mark Braverman, Or Zamir
2024	J	`jnl`	Sumsets in the Hypercube. CoRR Noga Alon, Or Zamir
2024	J	`jnl`	Testing Sumsets is Hard. CoRR Xi Chen, Shivam Nadimpalli, Tim Randolph, Rocco A. Servedio, Or Zamir
2024	J	`jnl`	Unbounded Error Correcting Codes. CoRR Klim Efremenko, Or Zamir
2024	J	`jnl`	Undetectable Steganography for Language Models. Trans. Mach. Learn. Res. Or Zamir
2024	A*	`conf`	Undetectable Watermarks for Language Models. COLT Miranda Christ, Sam Gunn, Or Zamir
2023	A*	`conf`	Algorithmic Applications of Hypergraph and Partition Containers. STOC Or Zamir
2023	J	`jnl`	Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. CoRR Kasper Green Larsen, Rasmus Pagh, Toniann Pitassi, Or Zamir
2023	A*	`conf`	The Wrong Direction of Jensen's Inequality Is Algorithmically Right. ICALP Or Zamir
2023	J	`jnl`	Undetectable Watermarks for Language Models. CoRR Miranda Christ, Sam Gunn, Or Zamir
2023	J	`jnl`	Undetectable Watermarks for Language Models. IACR Cryptol. ePrint Arch. Miranda Christ, Sam Gunn, Or Zamir
2022	J	`jnl`	Algorithmic Applications of Hypergraph and Partition Containers. CoRR Or Zamir
2022	A	`conf`	Faster Algorithm for Unique (k, 2)-CSP. ESA Or Zamir
2022	J	`jnl`	Hardness of Approximation in P via Short Cycle Removal: Cycle Detection, Distance Oracles, and Beyond. CoRR Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir
2022	A*	`conf`	Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond. STOC Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir
2022	A*	`conf`	Planting Undetectable Backdoors in Machine Learning Models : [Extended Abstract]. FOCS Shafi Goldwasser, Michael P. Kim, Vinod Vaikuntanathan, Or Zamir
2022	J	`jnl`	Planting Undetectable Backdoors in Machine Learning Models. CoRR Shafi Goldwasser, Michael P. Kim, Vinod Vaikuntanathan, Or Zamir
2022	A*	`conf`	Simulating a stack using queues. SODA Haim Kaplan, Robert E. Tarjan, Or Zamir, Uri Zwick
2022	J	`jnl`	The wrong direction of Jensen's inequality is algorithmically right. CoRR Or Zamir
2021	A*	`conf`	Breaking the 2ⁿ Barrier for 5-Coloring and 6-Coloring. ICALP Or Zamir
2021	J	`jnl`	Faster algorithm for Unique (k, 2)-CSP. CoRR Or Zamir
2021	A*	`conf`	Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering. ICML Shyam Narayanan, Sandeep Silwal, Piotr Indyk, Or Zamir
2021	J	`jnl`	Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering. CoRR Shyam Narayanan, Sandeep Silwal, Piotr Indyk, Or Zamir
2021	A*	`conf`	Tight Space Complexity of the Coin Problem. FOCS Mark Braverman, Sumegha Garg, Or Zamir
2021	J	`jnl`	Tight Space Complexity of the Coin Problem. Electron. Colloquium Comput. Complex. Mark Braverman, Sumegha Garg, Or Zamir
2020	—	`—`	Breaking Barriers for the Satisfiability and Coloring Problems Or Zamir
2020	J	`jnl`	Breaking the 2 CoRR Or Zamir
2019	A*	`conf`	A sort of an adversary. SODA Haim Kaplan, Or Zamir, Uri Zwick
2019	A*	`conf`	Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps. ICALP Mikkel Thorup, Or Zamir, Uri Zwick
2019	A*	`conf`	Faster STOC Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick
2019	A*	`conf`	Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. FOCS Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick
2019	J	`jnl`	Random k-out subgraph leaves only O(n/k) inter-component edges. CoRR Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick
2019	—	`conf`	Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. SOSA Haim Kaplan, László Kozma, Or Zamir, Uri Zwick
2018	J	`jnl`	Selection from heaps, row-sorted matrices and X+Y using soft heaps. CoRR Haim Kaplan, László Kozma, Or Zamir, Uri Zwick
2018	J	`jnl`	Subtree Isomorphism Revisited. ACM Trans. Algorithms Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir
2016	A	`conf`	Bottleneck Paths and Trees and Deterministic Graphical Games. STACS Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick
2016	A*	`conf`	Subtree Isomorphism Revisited. SODA Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir
2015	—	`conf`	Motion Planning for Unlabeled Discs with Optimality Guarantees. Robotics: Science and Systems Kiril Solovey, Jingjin Yu, Or Zamir, Dan Halperin
2015	J	`jnl`	Motion Planning for Unlabeled Discs with Optimality Guarantees. CoRR Kiril Solovey, Jingjin Yu, Or Zamir, Dan Halperin
2015	J	`jnl`	Subtree Isomorphism Revisited. CoRR Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir
2015	A*	`conf`	The amortized cost of finding the minimum. SODA Haim Kaplan, Or Zamir, Uri Zwick