Motion planning for unlabeled discs with optimality guarantees K Solovey, J Yu, O Zamir, D Halperin
arXiv preprint arXiv:1504.05218, 2015
85 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
59 2022 Undetectable watermarks for language models M Christ, S Gunn, O Zamir
arXiv preprint arXiv:2306.09194, 2023
56 2023 Subtree isomorphism revisited A Abboud, A Backurs, TD Hansen, V Vassilevska Williams, O Zamir
ACM Transactions on Algorithms (TALG) 14 (3), 1-23, 2018
56 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
47 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
26 2022 Selection from heaps, row-sorted matrices and using soft heaps H Kaplan, L Kozma, O Zamir, U Zwick
arXiv preprint arXiv:1802.07041, 2018
24 2018 Breaking the barrier for 5-coloring and 6-coloring O Zamir
arXiv preprint arXiv:2007.10790, 2020
11 2020 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
10 2022 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 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), 2016
9 2016 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
6 2023 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
5 2021 Undetectable Watermarks for Language Models, 2023b M Christ, S Gunn, O Zamir
URL https://eprint. iacr. org/2023/763, 0
5 Algorithmic applications of hypergraph and partition containers O Zamir
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 985-998, 2023
4 2023 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
3 2014 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 Excuse me, sir? Your language model is leaking (information) O Zamir
arXiv preprint arXiv:2401.10360, 2024
1 2024 Testing Sumsets is Hard X Chen, S Nadimpalli, T Randolph, RA Servedio, O Zamir
arXiv preprint arXiv:2401.07242, 2024
1 2024 Optimal Non-Adaptive Cell Probe Dictionaries and Hashing KG Larsen, R Pagh, T Pitassi, O Zamir
arXiv preprint arXiv:2308.16042, 2023
1 2023