Oren Weimann
University of Haifa
H-index: 27
Asia-Israel
Top articles of Oren Weimann
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Near-optimal dynamic time warping on run-length encoded strings | arXiv preprint arXiv:2302.06252 | Itai Boneh Shay Golan Shay Mozes Oren Weimann | 2023/2/13 |
\~ Optimal Fault-Tolerant Reachability Labeling in Planar Graphs | arXiv preprint arXiv:2307.07222 | Shiri Chechik Shay Mozes Oren Weimann | 2023/7/14 |
What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs? | arXiv preprint arXiv:2305.02946 | Amir Abboud Shay Mozes Oren Weimann | 2023/5/4 |
Almost optimal exact distance oracles for planar graphs | Journal of the ACM | Panagiotis Charalampopoulos Paweł Gawrychowski Yaowei Long Shay Mozes Seth Pettie | 2023/3/25 |
On the hardness of computing the edit distance of shallow trees | Panagiotis Charalampopoulos Paweł Gawrychowski Shay Mozes Oren Weimann | 2022/11/1 | |
The Fine-Grained Complexity of Episode Matching | Philip Bille Inge Li Gørtz Shay Mozes Teresa Anna Steiner Oren Weimann | 2022/6/1 | |
Fault-tolerant distance labeling for planar graphs | Theoretical Computer Science | Aviv Bar-Natan Panagiotis Charalampopoulos Paweł Gawrychowski Shay Mozes Oren Weimann | 2022/5/29 |
Improved Compression of the Okamura-Seymour Metric | arXiv preprint arXiv:2202.05127 | Shay Mozes Nathan Wallheimer Oren Weimann | 2022/2/10 |
Top tree compression of tries | Algorithmica | Philip Bille Paweł Gawrychowski Inge Li Gørtz Gad M Landau Oren Weimann | 2021/12 |
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Time | SIAM Journal on Computing | Paweł Gawrychowski Haim Kaplan Shay Mozes Micha Sharir Oren Weimann | 2021 |
A conditional lower bound for episode matching | arXiv preprint arXiv:2108.08613 | Philip Bille Inge Li Gørtz Shay Mozes Teresa Anna Steiner Oren Weimann | 2021/8/19 |
An almost optimal edit distance oracle | arXiv preprint arXiv:2103.03294 | Panagiotis Charalampopoulos Paweł Gawrychowski Shay Mozes Oren Weimann | 2021/3/4 |
Planar Negative k-Cycle | Paweł Gawrychowski Shay Mozes Oren Weimann | 2021 | |
A note on a recent algorithm for minimum cut | Paweł Gawrychowski Shay Mozes Oren Weimann | 2021 | |
On the fine-grained complexity of parity problems | arXiv preprint arXiv:2002.07415 | Amir Abboud Shon Feller Oren Weimann | 2020/2/18 |
Incremental distance products via faulty shortest paths | Information Processing Letters | Oren Weimann Raphael Yuster | 2020/9/1 |
31st Annual Symposium on Combinatorial Pattern Matching | Inge Li Gørtz Oren Weimann | 2020 | |
LIPIcs, Volume 161, CPM 2020, Complete Volume | Inge Li Gørtz Oren Weimann | 2020 | |
Tree edit distance cannot be computed in strongly subcubic time (unless APSP can) | ACM Transactions on Algorithms (TALG) | Karl Bringmann Paweł Gawrychowski Shay Mozes Oren Weimann | 2020/7/6 |
Compressed range minimum queries | Theoretical Computer Science | Paweł Gawrychowski Seungbum Jo Shay Mozes Oren Weimann | 2020/4/6 |
