Folgen
Or Zamir
Or Zamir
Bestätigte E-Mail-Adresse bei tauex.tau.ac.il - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Motion planning for unlabeled discs with optimality guarantees
K Solovey, J Yu, O Zamir, D Halperin
arXiv preprint arXiv:1504.05218, 2015
852015
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
562022
Subtree isomorphism revisited
A Abboud, A Backurs, TD Hansen, V Vassilevska Williams, O Zamir
ACM Transactions on Algorithms (TALG) 14 (3), 1-23, 2018
552018
Undetectable watermarks for language models
M Christ, S Gunn, O Zamir
arXiv preprint arXiv:2306.09194, 2023
542023
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
462019
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
262022
Selection from heaps, row-sorted matrices and using soft heaps
H Kaplan, L Kozma, O Zamir, U Zwick
arXiv preprint arXiv:1802.07041, 2018
242018
Breaking the barrier for 5-coloring and 6-coloring
O Zamir
arXiv preprint arXiv:2007.10790, 2020
112020
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
102022
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
92019
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
82016
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
52023
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
52021
Algorithmic applications of hypergraph and partition containers
O Zamir
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 985-998, 2023
42023
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
32014
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
22019
Excuse me, sir? Your language model is leaking (information)
O Zamir
arXiv preprint arXiv:2401.10360, 2024
12024
Testing Sumsets is Hard
X Chen, S Nadimpalli, T Randolph, RA Servedio, O Zamir
arXiv preprint arXiv:2401.07242, 2024
12024
Optimal Non-Adaptive Cell Probe Dictionaries and Hashing
KG Larsen, R Pagh, T Pitassi, O Zamir
arXiv preprint arXiv:2308.16042, 2023
12023
Simulating a stack using queues
H Kaplan, RE Tarjan, O Zamir, U Zwick
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
12022
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20