Oren Weimann

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 61

Top Venues

Massachusetts Institute of Technology, Cambridge, MA, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, MA, USA

PHD

Publications

Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann
Õptimal Dynamic Time Warping on Run-Length Encoded Strings. ICALP (2024)
Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann
Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings. CoRR (2023)
Amir Abboud, Shay Mozes, Oren Weimann
What Else Can Voronoi Diagrams Do For Diameter In Planar Graphs? CoRR (2023)
Amir Abboud, Shay Mozes, Oren Weimann
What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs? ESA (2023)
Shiri Chechik, Shay Mozes, Oren Weimann
Õptimal Fault-Tolerant Reachability Labeling in Planar Graphs. CoRR (2023)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Yaowei Long, Shay Mozes, Seth Pettie, Oren Weimann, Christian Wulff-Nilsen
Almost Optimal Exact Distance Oracles for Planar Graphs. J. ACM 70 (2) (2023)
Shay Mozes, Nathan Wallheimer, Oren Weimann
Improved Compression of the Okamura-Seymour Metric. CoRR (2022)
Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann
The Fine-Grained Complexity of Episode Matching. CPM (2022)
Shay Mozes, Nathan Wallheimer, Oren Weimann
Improved Compression of the Okamura-Seymour Metric. ISAAC (2022)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
On the Hardness of Computing the Edit Distance of Shallow Trees. SPIRE (2022)
Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Fault-tolerant distance labeling for planar graphs. Theor. Comput. Sci. 918 (2022)
Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Fault-Tolerant Distance Labeling for Planar Graphs. CoRR (2021)
Pawel Gawrychowski, Shay Mozes, Oren Weimann
A Note on a Recent Algorithm for Minimum Cut. SOSA (2021)
Pawel Gawrychowski, Shay Mozes, Oren Weimann
-Cycle. SODA (2021)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
An Almost Optimal Edit Distance Oracle. CoRR (2021)
Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann
A Conditional Lower Bound for Episode Matching. CoRR (2021)
Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Fault-Tolerant Distance Labeling for Planar Graphs. SIROCCO (2021)
Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Top Tree Compression of Tries. Algorithmica 83 (12) (2021)
Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann
) Time. SIAM J. Comput. 50 (2) (2021)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
An Almost Optimal Edit Distance Oracle. ICALP (2021)
Pawel Gawrychowski, Shay Mozes, Oren Weimann
A Note on a Recent Algorithm for Minimum Cut. CoRR (2020)
Amir Abboud, Shon Feller, Oren Weimann
On the Fine-Grained Complexity of Parity Problems. CoRR (2020)
Pawel Gawrychowski, Seungbum Jo, Shay Mozes, Oren Weimann
Compressed range minimum queries. Theor. Comput. Sci. 812 (2020)
Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can). ACM Trans. Algorithms 16 (4) (2020)
Oren Weimann, Raphael Yuster
Incremental distance products via faulty shortest paths. Inf. Process. Lett. 161 (2020)
Pawel Gawrychowski, Shay Mozes, Oren Weimann
Minimum Cut in O(m log² n) Time. ICALP (2020)
Pawel Gawrychowski, Shay Mozes, Oren Weimann
Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search. ACM Trans. Algorithms 16 (2) (2020)
Amir Abboud, Shon Feller, Oren Weimann
On the Fine-Grained Complexity of Parity Problems. ICALP (2020)
Pawel Gawrychowski, Shay Mozes, Oren Weimann
n) Time. CoRR (2019)
Philip Bille, Inge Li Gørtz, Pawel Gawrychowski, Gad M. Landau, Oren Weimann
Top Tree Compression of Tries. CoRR (2019)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Almost optimal distance oracles for planar graphs. STOC (2019)
Pawel Gawrychowski, Seungbum Jo, Shay Mozes, Oren Weimann
Compressed Range Minimum Queries. CoRR (2019)
Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Top Tree Compression of Tries. ISAAC (2019)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Almost Optimal Distance Oracles for Planar Graphs. CoRR (2018)
Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann
) Time. SODA (2018)
Pawel Gawrychowski, Liran Markin, Oren Weimann
A Faster FPTAS for #Knapsack. ICALP (2018)
Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Near-Optimal Distance Emulator for Planar Graphs. ESA (2018)
Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen
Better Tradeoffs for Exact Distance Oracles in Planar Graphs. SODA (2018)
Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann
The nearest colored node in a tree. Theor. Comput. Sci. 710 (2018)
Shay Mozes, Yahav Nussbaum, Oren Weimann
Faster shortest paths in dense distance graphs, with applications. Theor. Comput. Sci. 711 (2018)
Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Near-Optimal Compression for the Planar Graph Metric. SODA (2018)
Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). SODA (2018)
Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann
A Faster Construction of Greedy Consensus Trees. ICALP (2018)
Shay Mozes, Kirill Nikolaev, Yahav Nussbaum, Oren Weimann
) Time. SODA (2018)
Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Near-Optimal Distance Emulator for Planar Graphs. CoRR (2018)
Seungbum Jo, Shay Mozes, Oren Weimann
Compressed Range Minimum Queries. SPIRE (2018)
Pawel Gawrychowski, Liran Markin, Oren Weimann
A Faster FPTAS for #Knapsack. CoRR (2018)
Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
Improved bounds for randomized preemptive online matching. Inf. Comput. 259 (1) (2018)
Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Near-Optimal Compression for the Planar Graph Metric. CoRR (2017)
Pawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes, Oren Weimann
Dispersion on Trees. CoRR (2017)
Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann
) time. CoRR (2017)
Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen
Better Tradeoffs for Exact Distance Oracles in Planar Graphs. CoRR (2017)
Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann
A Faster Construction of Phylogenetic Consensus Trees. CoRR (2017)
Pawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes, Oren Weimann
Dispersion on Trees. ESA (2017)
Ofer Freedman, Pawel Gawrychowski, Patrick K. Nicholson, Oren Weimann
Optimal Distance Labeling Schemes for Trees. PODC (2017)
Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). CoRR (2017)
Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Longest common extensions in trees. Theor. Comput. Sci. 638 (2016)
Ofer Freedman, Pawel Gawrychowski, Patrick K. Nicholson, Oren Weimann
Optimal Distance Labeling Schemes for Trees. CoRR (2016)
Patrick Hagge Cording, Pawel Gawrychowski, Oren Weimann
Bookmarks in Grammar-Compressed Strings. SPIRE (2016)
Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann
The Nearest Colored Node in a Tree. CPM (2016)
Oren Weimann, Raphael Yuster
Approximating the Diameter of Planar Graphs in Near Linear Time. ACM Trans. Algorithms 12 (1) (2016)
Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Tree compression with top trees. Inf. Comput. 243 (2015)
Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
Random Access to Grammar-Compressed Strings and Trees. SIAM J. Comput. 44 (3) (2015)
Pawel Gawrychowski, Shay Mozes, Oren Weimann
Submatrix Maximum Queries in Monge Matrices are Equivalent to Predecessor Search. CoRR (2015)
Shay Mozes, Cyril Nikolaev, Yahav Nussbaum, Oren Weimann
Minimum Cut of Directed Planar Graphs in O(nloglogn) Time. CoRR (2015)
Pawel Gawrychowski, Shay Mozes, Oren Weimann
Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search. ICALP (1) (2015)
Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Longest Common Extensions in Trees. CPM (2015)
Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. Algorithmica 73 (3) (2015)
Danny Hermelin, Gad M. Landau, Yuri Rabinovich, Oren Weimann
Binary Jumbled Pattern Matching via All-Pairs Shortest Paths. CoRR (2014)
Erik D. Demaine, Gad M. Landau, Oren Weimann
On Cartesian Trees and Range Minimum Queries. Algorithmica 68 (3) (2014)
Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Longest Common Extensions in Trees. CoRR (2014)
Pawel Gawrychowski, Shay Mozes, Oren Weimann
Improved Submatrix Maximum Queries in Monge Matrices. ICALP (1) (2014)
Amir Abboud, Virginia Vassilevska Williams, Oren Weimann
Consequences of Faster Alignment of Sequences. ICALP (1) (2014)
Shay Mozes, Yahav Nussbaum, Oren Weimann
Faster Shortest Paths in Dense Distance Graphs, with Applications. CoRR (2014)
Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster
Approximating the maximum consecutive subsums of a sequence. Theor. Comput. Sci. 525 (2014)
Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann
Towards optimal packed string matching. Theor. Comput. Sci. 525 (2014)
Shay Mozes, Oren Weimann
Improved Submatrix Maximum Queries in Monge Matrices. CoRR (2013)
Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures CoRR (2013)
Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. ESA (2013)
Oren Weimann, Raphael Yuster
Approximating the Diameter of Planar Graphs in Near Linear Time. ICALP (1) (2013)
Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
On approximating string selection problems with outliers. Theor. Comput. Sci. 498 (2013)
Oren Weimann, Raphael Yuster
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication. ACM Trans. Algorithms 9 (2) (2013)
Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann
Unified Compression-Based Acceleration of Edit-Distance Computation. Algorithmica 65 (2) (2013)
Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. J. Comb. Optim. 25 (1) (2013)
Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Tree Compression with Top Trees CoRR (2013)
Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Tree Compression with Top Trees. ICALP (1) (2013)
Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
Improved Bounds for Online Preemptive Matching. STACS (2013)
Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
Improved Bounds for Online Preemptive Matching CoRR (2012)
Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence. CPM (2012)
Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
On Approximating String Selection Problems with Outliers. CPM (2012)
Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
On Approximating String Selection Problems with Outliers CoRR (2012)
Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann
Fast RNA structure alignment for crossing input structures. J. Discrete Algorithms 9 (1) (2011)
Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster
Distance Oracles for Vertex-Labeled Graphs. ICALP (2) (2011)
Oren Weimann, Raphael Yuster
Approximating the Diameter of Planar Graphs in Near Linear Time CoRR (2011)
Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann
Optimal Packed String Matching. FSTTCS (2011)
Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
Random Access to grammar-Compressed Strings. SODA (2011)
Oren Weimann, David Peleg
A note on exact distance labeling. Inf. Process. Lett. 111 (14) (2011)
Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
The Stackelberg Minimum Spanning Tree Game. Algorithmica 59 (2) (2011)
Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann
Unified Compression-Based Acceleration of Edit-Distance Computation CoRR (2010)
Philip Bille, Gad M. Landau, Oren Weimann
Random Access to Grammar Compressed Strings CoRR (2010)

Oren Weimann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Oren Weimann