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
225 2009 An optimal decomposition algorithm for tree edit distance ED Demaine, S Mozes, B Rossman, O Weimann
ICALP 7, 146-157, 2007
151 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
147 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
126 2009 Shortest Paths in Planar Graphs with Real Lengths in O (n log2 n /loglogn ) Time S Mozes, C Wulff-Nilsen
Algorithms–ESA 2010: 18th Annual European Symposium, Liverpool, UK …, 2010
85 2010 Deterministic dense coding with partially entangled states S Mozes, J Oppenheim, B Reznik
Physical Review A—Atomic, Molecular, and Optical Physics 71 (1), 012311, 2005
85 2005 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
84 2013 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
82 2020 Exact distance oracles for planar graphs S Mozes, C Sommer
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
81 2012 Effect of unitary noise on Grover’s quantum search algorithm D Shapira, S Mozes, O Biham
Physical Review A 67 (4), 042301, 2003
66 2003 Finding an optimal tree searching strategy in linear time. S Mozes, K Onak, O Weimann
SODA 8, 1096-1105, 2008
60 2008 Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic P Gawrychowski, H Kaplan, S Mozes, M Sharir, O Weimann
SIAM Journal on Computing 50 (2), 509-554, 2021
59 2021 Minimum Cut in P Gawrychowski, S Mozes, O Weimann
arXiv preprint arXiv:1911.01145, 2019
56 2019 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
56 2018 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
50 2012 New construction for a QMA complete three-local Hamiltonian D Nagaj, S Mozes
Journal of mathematical physics 48 (7), 2007
43 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
39 2009 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
34 2019 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
32 2017 Dynamic string alignment P Charalampopoulos, T Kociumaka, S Mozes
31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), 9: 1-9: 13, 2020
24 2020 
Oren WeimannUniversity of HaifaE-mail megerősítve itt: cs.haifa.ac.il