Oren Weimann

According to our database, Oren Weimann authored at least 87 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Minimum Cut in O(mlog ² n) Time.

Pawel Gawrychowski, Shay Mozes, Oren Weimann

Theory Comput. Syst., August, 2024

Distributed Maximum Flow in Planar Graphs.

Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann

CoRR, 2024

Brief Announcement: Distributed Maximum Flow in Planar Graphs.

Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann

Proceedings of the 38th International Symposium on Distributed Computing, 2024

Õptimal Dynamic Time Warping on Run-Length Encoded Strings.

Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Almost Optimal Exact Distance Oracles for Planar Graphs.

Panagiotis Charalampopoulos, Pawel Gawrychowski, Yaowei Long, Shay Mozes, Seth Pettie, Oren Weimann, Christian Wulff-Nilsen

J. ACM, April, 2023

Õptimal Fault-Tolerant Reachability Labeling in Planar Graphs.

Shiri Chechik, Shay Mozes, Oren Weimann

CoRR, 2023

Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings.

Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann

CoRR, 2023

What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs?

Amir Abboud, Shay Mozes, Oren Weimann

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Fault-tolerant distance labeling for planar graphs.

Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann

Theor. Comput. Sci., 2022

On the Hardness of Computing the Edit Distance of Shallow Trees.

Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann

Proceedings of the String Processing and Information Retrieval, 2022

Improved Compression of the Okamura-Seymour Metric.

Shay Mozes, Nathan Wallheimer, Oren Weimann

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

The Fine-Grained Complexity of Episode Matching.

Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n^5/3) Time.

Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann

SIAM J. Comput., 2021

A Conditional Lower Bound for Episode Matching.

Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann

CoRR, 2021

Top Tree Compression of Tries.

Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann

Algorithmica, 2021

A Note on a Recent Algorithm for Minimum Cut.

Pawel Gawrychowski, Shay Mozes, Oren Weimann

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

Planar Negative <i>k</i>-Cycle.

Pawel Gawrychowski, Shay Mozes, Oren Weimann

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

An Almost Optimal Edit Distance Oracle.

Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Compressed range minimum queries.

Pawel Gawrychowski, Seungbum Jo, Shay Mozes, Oren Weimann

Theor. Comput. Sci., 2020

Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search.

Pawel Gawrychowski, Shay Mozes, Oren Weimann

ACM Trans. Algorithms, 2020

Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can).

Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann

ACM Trans. Algorithms, 2020

Incremental distance products via faulty shortest paths.

Oren Weimann, Raphael Yuster

Inf. Process. Lett., 2020

Minimum Cut in O(m log² n) Time.

Pawel Gawrychowski, Shay Mozes, Oren Weimann

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

On the Fine-Grained Complexity of Parity Problems.

Amir Abboud, Shon Feller, Oren Weimann

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Minimum Cut in O(m log²n) Time.

Pawel Gawrychowski, Shay Mozes, Oren Weimann

CoRR, 2019

Almost optimal distance oracles for planar graphs.

Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018

Faster shortest paths in dense distance graphs, with applications.

Shay Mozes, Yahav Nussbaum, Oren Weimann

Theor. Comput. Sci., 2018

The nearest colored node in a tree.

Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann

Theor. Comput. Sci., 2018

Improved bounds for randomized preemptive online matching.

Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann

Inf. Comput., 2018

Compressed Range Minimum Queries.

Seungbum Jo, Shay Mozes, Oren Weimann

Proceedings of the String Processing and Information Retrieval, 2018

Minimum Cut of Directed Planar Graphs in <i>O</i>(<i>n</i> log log <i>n</i>) Time.

Shay Mozes, Kirill Nikolaev, Yahav Nussbaum, Oren Weimann

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Better Tradeoffs for Exact Distance Oracles in Planar Graphs.

Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic <i>Õ</i>(<i>n</i>^5/3) Time.

Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Near-Optimal Compression for the Planar Graph Metric.

Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

A Faster FPTAS for #Knapsack.

Pawel Gawrychowski, Liran Markin, Oren Weimann

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

A Faster Construction of Greedy Consensus Trees.

Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Near-Optimal Distance Emulator for Planar Graphs.

Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, Oren Weimann

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

A Faster Construction of Phylogenetic Consensus Trees.

Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann

CoRR, 2017

Optimal Distance Labeling Schemes for Trees.

Ofer Freedman, Pawel Gawrychowski, Patrick K. Nicholson, Oren Weimann

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Dispersion on Trees.

Pawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes, Oren Weimann

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Longest common extensions in trees.

Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann

Theor. Comput. Sci., 2016

Approximating the Diameter of Planar Graphs in Near Linear Time.

Oren Weimann, Raphael Yuster

ACM Trans. Algorithms, 2016

Bookmarks in Grammar-Compressed Strings.

Patrick Hagge Cording, Pawel Gawrychowski, Oren Weimann

Proceedings of the String Processing and Information Retrieval, 2016

2015

Random Access to Grammar-Compressed Strings and Trees.

Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann

SIAM J. Comput., 2015

Tree compression with top trees.

Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann

Inf. Comput., 2015

Minimum Cut of Directed Planar Graphs in O(nloglogn) Time.

Shay Mozes, Cyril Nikolaev, Yahav Nussbaum, Oren Weimann

CoRR, 2015

Binary Jumbled Pattern Matching on Trees and Tree-Like Structures.

Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann

Algorithmica, 2015

Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search.

Pawel Gawrychowski, Shay Mozes, Oren Weimann

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Approximating the maximum consecutive subsums of a sequence.

Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster

Theor. Comput. Sci., 2014

Towards optimal packed string matching.

Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann

Theor. Comput. Sci., 2014

Binary Jumbled Pattern Matching via All-Pairs Shortest Paths.

Danny Hermelin, Gad M. Landau, Yuri Rabinovich, Oren Weimann

CoRR, 2014

Longest Common Extensions in Trees.

Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann

CoRR, 2014

On Cartesian Trees and Range Minimum Queries.

Erik D. Demaine, Gad M. Landau, Oren Weimann

Algorithmica, 2014

Improved Submatrix Maximum Queries in Monge Matrices.

Pawel Gawrychowski, Shay Mozes, Oren Weimann

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Consequences of Faster Alignment of Sequences.

Amir Abboud, Virginia Vassilevska Williams, Oren Weimann

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

On approximating string selection problems with outliers.

Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann

Theor. Comput. Sci., 2013

Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication.

Oren Weimann, Raphael Yuster

ACM Trans. Algorithms, 2013

The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs.

Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann

J. Comb. Optim., 2013

Improved Submatrix Maximum Queries in Monge Matrices.

Shay Mozes, Oren Weimann

CoRR, 2013

Unified Compression-Based Acceleration of Edit-Distance Computation.

Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann

Algorithmica, 2013

Improved Bounds for Online Preemptive Matching.

Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2012

Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence.

Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Fast RNA structure alignment for crossing input structures.

Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann

J. Discrete Algorithms, 2011

A note on exact distance labeling.

Oren Weimann, David Peleg

Inf. Process. Lett., 2011

The Stackelberg Minimum Spanning Tree Game.

Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann

Algorithmica, 2011

Random Access to grammar-Compressed Strings.

Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Distance Oracles for Vertex-Labeled Graphs.

Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Optimal Packed String Matching.

Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010

Shortest paths in directed planar graphs with negative lengths: A linear-space <i>O</i>(<i>n</i> log² <i>n</i>)-time algorithm.

Philip N. Klein, Shay Mozes, Oren Weimann

ACM Trans. Algorithms, 2010

Computing the Girth of a Planar Graph in O(n logn) Time.

Oren Weimann, Raphael Yuster

SIAM J. Discret. Math., 2010

Random Access to Grammar Compressed Strings

Philip Bille, Gad M. Landau, Oren Weimann

CoRR, 2010

Replacement Paths via Fast Matrix Multiplication.

Oren Weimann, Raphael Yuster

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009

Accelerating dynamic programming.

Oren Weimann

PhD thesis, 2009

Fast algorithms for computing tree LCS.

Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson

Theor. Comput. Sci., 2009

An optimal decomposition algorithm for tree edit distance.

Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann

ACM Trans. Algorithms, 2009

Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions.

Yury Lifshits, Shay Mozes, Oren Weimann, Michal Ziv-Ukelson

Algorithmica, 2009

A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression.

Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Computing the Girth of a Planar Graph in <i>O</i>(<i>n</i> log<i>n</i>) Time.

Oren Weimann, Raphael Yuster

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008

Finding an optimal tree searching strategy in linear time.

Shay Mozes, Krzysztof Onak, Oren Weimann

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

Locality and Gaps in RNA Comparison.

Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M. Landau, Mikhail A. Roytberg, Oren Weimann, Kaizhong Zhang

J. Comput. Biol., 2007

Indexing a Dictionary for Subset Matching Queries.

Gad M. Landau, Dekel Tsur, Oren Weimann

Proceedings of the String Processing and Information Retrieval, 2007

Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions.

Shay Mozes, Oren Weimann, Michal Ziv-Ukelson

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006

An O(n^3)-Time Algorithm for Tree Edit Distance

Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann

CoRR, 2006

Local Alignment of RNA Sequences with Arbitrary Scoring Schemes.

Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann

Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005

Gene Proximity Analysis across Whole Genomes via PQ Trees¹.

Gad M. Landau, Laxmi Parida, Oren Weimann

J. Comput. Biol., 2005

Normalized Similarity of RNA Sequences.

Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann

Proceedings of the String Processing and Information Retrieval, 2005

Using PQ Trees for Comparative Genomics.

Gad M. Landau, Laxmi Parida, Oren Weimann

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005