| An optimal decomposition algorithm for tree edit distance ED Demaine, S Mozes, B Rossman, O Weimann ACM Transactions on Algorithms (TALG) 6 (1), 2, 2009 | 204 | 2009 |
| An optimal decomposition algorithm for tree edit distance ED Demaine, S Mozes, B Rossman, O Weimann ICALP 7, 146-157, 2007 | 142 | 2007 |
| Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time G Borradaile, PN Klein, S Mozes, Y Nussbaum, C Wulff-Nilsen SIAM Journal on Computing 46 (4), 1280-1303, 2017 | 120 | 2017 |
| Shortest paths in directed planar graphs with negative lengths: a linear-space O(n log2 n)-time algorithm P Klein, S Mozes, O Weimann twentieth annual ACM-SIAM symposium on Discrete algorithms (SODA 2009), 236-245, 2009 | 116 | 2009 |
| Deterministic dense coding with partially entangled states S Mozes, J Oppenheim, B Reznik Physical Review A 71 (1), 012311, 2005 | 84 | 2005 |
| Shortest Paths in Planar Graphs with Real Lengths in O(nlog2n/loglogn) Time S Mozes, C Wulff-Nilsen European Symposium on Algorithms, 206-217, 2010 | 74 | 2010 |
| Exact distance oracles for planar graphs S Mozes, C Sommer Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 72 | 2012 |
| Structured recursive separator decompositions for planar graphs in linear time PN Klein, S Mozes, C Sommer Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 62 | 2013 |
| Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications H Kaplan, S Mozes, Y Nussbaum, M Sharir Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 47 | 2012 |
| Finding an optimal tree searching strategy in linear time. S Mozes, K Onak, O Weimann SODA 8, 1096-1105, 2008 | 46 | 2008 |
| Effect of unitary noise on Grover’s quantum search algorithm D Shapira, S Mozes, O Biham Physical Review A 67 (4), 042301, 2003 | 46 | 2003 |
| Better tradeoffs for exact distance oracles in planar graphs P Gawrychowski, S Mozes, O Weimann, C Wulff-Nilsen Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 44 | 2018 |
| Tree edit distance cannot be computed in strongly subcubic time (unless APSP can) K Bringmann, P Gawrychowski, S Mozes, O Weimann ACM Transactions on Algorithms (TALG) 16 (4), 1-22, 2020 | 43 | 2020 |
| New construction for a QMA complete three-local Hamiltonian D Nagaj, S Mozes Journal of mathematical physics 48 (7), 072104, 2007 | 38 | 2007 |
| Speeding up HMM decoding and training by exploiting sequence repetitions Y Lifshits, S Mozes, O Weimann, M Ziv-Ukelson Algorithmica 54 (3), 379-399, 2009 | 34 | 2009 |
| Minimum Cut in Time P Gawrychowski, S Mozes, O Weimann arXiv preprint arXiv:1911.01145, 2019 | 33 | 2019 |
| Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Time P Gawrychowski, H Kaplan, S Mozes, M Sharir, O Weimann SIAM Journal on Computing 50 (2), 509-554, 2021 | 31 | 2021 |
| Optimization algorithms for planar graphs PN Klein, S Mozes preparation, manuscript at http://planarity. org, 2014 | 31 | 2014 |
| Submatrix maximum queries in monge matrices and partial monge matrices, and their applications H Kaplan, S Mozes, Y Nussbaum, M Sharir ACM Transactions on Algorithms (TALG) 13 (2), 1-42, 2017 | 30 | 2017 |
| Almost optimal distance oracles for planar graphs P Charalampopoulos, P Gawrychowski, S Mozes, O Weimann Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 22 | 2019 |
Oren WeimannUniversity of HaifaVerified email at cs.haifa.ac.il
