Motion planning for unlabeled discs with optimality guarantees K Solovey, J Yu, O Zamir, D Halperin arXiv preprint arXiv:1504.05218, 2015 | 79 | 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 | 48 | 2018 |

Faster *k*-SAT algorithms using biased-PPSZTD Hansen, H Kaplan, O Zamir, U Zwick Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 41 | 2019 |

Selection from heaps, row-sorted matrices and using soft heaps H Kaplan, L Kozma, O Zamir, U Zwick arXiv preprint arXiv:1802.07041, 2018 | 23 | 2018 |

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 | 18 | 2022 |

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 | 12 | 2022 |

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 | 9 | 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 | 7 | 2019 |

Breaking the barrier for 5-coloring and 6-coloring O Zamir arXiv preprint arXiv:2007.10790, 2020 | 6 | 2020 |

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 | 6 | 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 | 3 | 2021 |

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 |

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 | 1 | 2022 |

Faster algorithm for Unique -CSP O Zamir arXiv preprint arXiv:2110.03122, 2021 | 1 | 2021 |

Algorithmic Applications of Hypergraph and Partition Containers O Zamir arXiv preprint arXiv:2211.11737, 2022 | | 2022 |

The wrong direction of Jensen's inequality is algorithmically right O Zamir arXiv preprint arXiv:2211.08563, 2022 | | 2022 |

A sort of an adversary H Kaplan, O Zamir, U Zwick Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | | 2019 |