Or Zamir
Or Zamir
Verified email at mail.tau.ac.il - Homepage
Cited by
Cited by
Motion planning for unlabeled discs with optimality guarantees
K Solovey, J Yu, O Zamir, D Halperin
arXiv preprint arXiv:1504.05218, 2015
Subtree isomorphism revisited
A Abboud, A Backurs, TD Hansen, V Vassilevska Williams, O Zamir
ACM Transactions on Algorithms (TALG) 14 (3), 1-23, 2018
Selection from heaps, row-sorted matrices and using soft heaps
H Kaplan, L Kozma, O Zamir, U Zwick
arXiv preprint arXiv:1802.07041, 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
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
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
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
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
A sort of an adversary
H Kaplan, O Zamir, U Zwick
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
The system can't perform the operation now. Try again later.
Articles 1–9