| Undetectable watermarks for language models M Christ, S Gunn, O Zamir The Thirty Seventh Annual Conference on Learning Theory, 1125-1139, 2024 | 173 | 2024 |
| Motion planning for unlabeled discs with optimality guarantees K Solovey, J Yu, O Zamir, D Halperin Robotics: Science and Systems Conference, RSS 2015, 2015 | 90 | 2015 |
| Planting undetectable backdoors in machine learning models S Goldwasser, MP Kim, V Vaikuntanathan, O Zamir 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 88 | 2022 |
| Subtree isomorphism revisited A Abboud, A Backurs, TD Hansen, V Vassilevska Williams, O Zamir ACM Transactions on Algorithms (TALG) 14 (3), 1-23, 2018 | 61 | 2018 |
| Faster k-SAT algorithms using biased-PPSZ TD Hansen, H Kaplan, O Zamir, U Zwick Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 52 | 2019 |
| Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond A Abboud, K Bringmann, S Khoury, O Zamir Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 39 | 2022 |
| Selection from heaps, row-sorted matrices and X+Y using soft heaps H Kaplan, L Kozma, O Zamir, U Zwick 2nd Symposium on Simplicity in Algorithms (SOSA 2019), 2019 | 27 | 2019 |
| Tight space complexity of the coin problem M Braverman, S Garg, O Zamir 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 15 | 2022 |
| Breaking the barrier for 5-coloring and 6-coloring O Zamir 48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021 | 15 | 2021 |
| Bottleneck paths and trees and deterministic graphical games S Chechik, H Kaplan, M Thorup, O Zamir, U Zwick 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), 27 …, 2016 | 12 | 2016 |
| Randomized dimensionality reduction for facility location and single-linkage clustering S Narayanan, S Silwal, P Indyk, O Zamir International Conference on Machine Learning, 7948-7957, 2021 | 11 | 2021 |
| Essentially tight bounds for rainbow cycles in proper edge-colourings N Alon, M Bucić, L Sauermann, D Zakharov, O Zamir arXiv preprint arXiv:2309.04460, 2023 | 10 | 2023 |
| Random k-out subgraph leaves only o (n/k) inter-component edges J Holm, V King, M Thorup, O Zamir, U Zwick 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 9 | 2019 |
| Undetectable Steganography for Language Models O Zamir Transactions on Machine Learning Research, 2024 | 7* | 2024 |
| Algorithmic applications of hypergraph and partition containers O Zamir Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 985-998, 2023 | 7 | 2023 |
| Optimal non-adaptive cell probe dictionaries and hashing KG Larsen, R Pagh, G Persiano, T Pitassi, K Yeo, O Zamir 51st International Colloquium on Automata, Languages, and Programming (ICALP …, 2024 | 4 | 2024 |
| The amortized cost of finding the minimum H Kaplan, O Zamir, U Zwick Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014 | 4 | 2014 |
| Testing sumsets is hard X Chen, S Nadimpalli, T Randolph, RA Servedio, O Zamir arXiv preprint arXiv:2401.07242, 2024 | 2 | 2024 |
| Faster algorithm for Unique -CSP O Zamir 30th Annual European Symposium on Algorithms (ESA 2022), 2022 | 2 | 2022 |
| Dynamic ordered sets with approximate queries, approximate heaps and soft heaps M Thorup, O Zamir, U Zwick 46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019 | 2 | 2019 |
