default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOren Weimann
Person information
- affiliation: University of Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j34]Pawel Gawrychowski, Shay Mozes, Oren Weimann
:
Minimum Cut in O(mlog 2 n) Time. Theory Comput. Syst. 68(4): 814-834 (2024)- [c57]Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann:
Õptimal Dynamic Time Warping on Run-Length Encoded Strings. ICALP 2024: 30:1-30:17 - [c56]Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann:
Brief Announcement: Distributed Maximum Flow in Planar Graphs. DISC 2024: 40:1-40:8 - 2023
- [j33]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): 12:1-12:50 (2023) - [c55]Amir Abboud, Shay Mozes, Oren Weimann:
What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs? ESA 2023: 4:1-4:20 - [i39]Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann:
Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings. CoRR abs/2302.06252 (2023) - [i38]Amir Abboud, Shay Mozes, Oren Weimann:
What Else Can Voronoi Diagrams Do For Diameter In Planar Graphs? CoRR abs/2305.02946 (2023) - [i37]Shiri Chechik, Shay Mozes, Oren Weimann:
Õptimal Fault-Tolerant Reachability Labeling in Planar Graphs. CoRR abs/2307.07222 (2023) - 2022
- [j32]Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Fault-tolerant distance labeling for planar graphs. Theor. Comput. Sci. 918: 48-59 (2022) - [c54]Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann:
The Fine-Grained Complexity of Episode Matching. CPM 2022: 4:1-4:12 - [c53]Shay Mozes, Nathan Wallheimer, Oren Weimann:
Improved Compression of the Okamura-Seymour Metric. ISAAC 2022: 27:1-27:19 - [c52]Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
On the Hardness of Computing the Edit Distance of Shallow Trees. SPIRE 2022: 290-302 - [i36]Shay Mozes, Nathan Wallheimer, Oren Weimann:
Improved Compression of the Okamura-Seymour Metric. CoRR abs/2202.05127 (2022) - 2021
- [j31]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Top Tree Compression of Tries. Algorithmica 83(12): 3602-3628 (2021) - [j30]Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann:
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time. SIAM J. Comput. 50(2): 509-554 (2021) - [c51]Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
An Almost Optimal Edit Distance Oracle. ICALP 2021: 48:1-48:20 - [c50]Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Fault-Tolerant Distance Labeling for Planar Graphs. SIROCCO 2021: 315-333 - [c49]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Planar Negative k-Cycle. SODA 2021: 2717-2724 - [c48]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
A Note on a Recent Algorithm for Minimum Cut. SOSA 2021: 74-79 - [i35]Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Fault-Tolerant Distance Labeling for Planar Graphs. CoRR abs/2102.07154 (2021) - [i34]Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
An Almost Optimal Edit Distance Oracle. CoRR abs/2103.03294 (2021) - [i33]Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann:
A Conditional Lower Bound for Episode Matching. CoRR abs/2108.08613 (2021) - 2020
- [j29]Oren Weimann, Raphael Yuster:
Incremental distance products via faulty shortest paths. Inf. Process. Lett. 161: 105977 (2020) - [j28]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): 16:1-16:24 (2020) - [j27]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): 48:1-48:22 (2020) - [j26]Pawel Gawrychowski, Seungbum Jo, Shay Mozes, Oren Weimann:
Compressed range minimum queries. Theor. Comput. Sci. 812: 39-48 (2020) - [c47]Amir Abboud, Shon Feller, Oren Weimann:
On the Fine-Grained Complexity of Parity Problems. ICALP 2020: 5:1-5:19 - [c46]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Minimum Cut in O(m log² n) Time. ICALP 2020: 57:1-57:15 - [e1]Inge Li Gørtz, Oren Weimann:
31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark. LIPIcs 161, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-149-8 [contents] - [i32]Amir Abboud, Shon Feller, Oren Weimann:
On the Fine-Grained Complexity of Parity Problems. CoRR abs/2002.07415 (2020) - [i31]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
A Note on a Recent Algorithm for Minimum Cut. CoRR abs/2008.02060 (2020)
2010 – 2019
- 2019
- [c45]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Top Tree Compression of Tries. ISAAC 2019: 4:1-4:18 - [c44]Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Almost optimal distance oracles for planar graphs. STOC 2019: 138-151 - [i30]Philip Bille, Inge Li Gørtz, Pawel Gawrychowski, Gad M. Landau, Oren Weimann:
Top Tree Compression of Tries. CoRR abs/1902.02187 (2019) - [i29]Pawel Gawrychowski, Seungbum Jo, Shay Mozes, Oren Weimann:
Compressed Range Minimum Queries. CoRR abs/1902.04427 (2019) - [i28]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Minimum Cut in O(m log2n) Time. CoRR abs/1911.01145 (2019) - 2018
- [j25]Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann:
Improved bounds for randomized preemptive online matching. Inf. Comput. 259(1): 31-40 (2018) - [j24]Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann:
The nearest colored node in a tree. Theor. Comput. Sci. 710: 66-73 (2018) - [j23]Shay Mozes, Yahav Nussbaum, Oren Weimann:
Faster shortest paths in dense distance graphs, with applications. Theor. Comput. Sci. 711: 11-35 (2018) - [c43]Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Near-Optimal Distance Emulator for Planar Graphs. ESA 2018: 16:1-16:17 - [c42]Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann:
A Faster Construction of Greedy Consensus Trees. ICALP 2018: 63:1-63:14 - [c41]Pawel Gawrychowski, Liran Markin, Oren Weimann:
A Faster FPTAS for #Knapsack. ICALP 2018: 64:1-64:13 - [c40]Shay Mozes, Kirill Nikolaev, Yahav Nussbaum, Oren Weimann:
Minimum Cut of Directed Planar Graphs in O(n log log n) Time. SODA 2018: 477-494 - [c39]Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann:
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time. SODA 2018: 495-514 - [c38]Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen:
Better Tradeoffs for Exact Distance Oracles in Planar Graphs. SODA 2018: 515-529 - [c37]Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Near-Optimal Compression for the Planar Graph Metric. SODA 2018: 530-549 - [c36]Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). SODA 2018: 1190-1206 - [c35]Seungbum Jo, Shay Mozes, Oren Weimann:
Compressed Range Minimum Queries. SPIRE 2018: 206-217 - [i27]Pawel Gawrychowski, Liran Markin, Oren Weimann:
A Faster FPTAS for #Knapsack. CoRR abs/1802.05791 (2018) - [i26]Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Near-Optimal Distance Emulator for Planar Graphs. CoRR abs/1807.01478 (2018) - [i25]Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Almost Optimal Distance Oracles for Planar Graphs. CoRR abs/1811.01551 (2018) - 2017
- [c34]Pawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes, Oren Weimann:
Dispersion on Trees. ESA 2017: 40:1-40:13 - [c33]Ofer Freedman, Pawel Gawrychowski, Patrick K. Nicholson, Oren Weimann:
Optimal Distance Labeling Schemes for Trees. PODC 2017: 185-194 - [i24]Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Near-Optimal Compression for the Planar Graph Metric. CoRR abs/1703.04814 (2017) - [i23]Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). CoRR abs/1703.08940 (2017) - [i22]Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann:
Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ(n5/3) time. CoRR abs/1704.02793 (2017) - [i21]Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann:
A Faster Construction of Phylogenetic Consensus Trees. CoRR abs/1705.10548 (2017) - [i20]Pawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes, Oren Weimann:
Dispersion on Trees. CoRR abs/1706.09185 (2017) - [i19]Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen:
Better Tradeoffs for Exact Distance Oracles in Planar Graphs. CoRR abs/1708.01386 (2017) - 2016
- [j22]Oren Weimann, Raphael Yuster:
Approximating the Diameter of Planar Graphs in Near Linear Time. ACM Trans. Algorithms 12(1): 12:1-12:13 (2016) - [j21]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Longest common extensions in trees. Theor. Comput. Sci. 638: 98-107 (2016) - [c32]Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann:
The Nearest Colored Node in a Tree. CPM 2016: 25:1-25:12 - [c31]Patrick Hagge Cording, Pawel Gawrychowski, Oren Weimann:
Bookmarks in Grammar-Compressed Strings. SPIRE 2016: 153-159 - [i18]Ofer Freedman, Pawel Gawrychowski, Patrick K. Nicholson, Oren Weimann:
Optimal Distance Labeling Schemes for Trees. CoRR abs/1608.00212 (2016) - 2015
- [j20]Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann:
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. Algorithmica 73(3): 571-588 (2015) - [j19]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Tree compression with top trees. Inf. Comput. 243: 166-177 (2015) - [j18]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): 513-539 (2015) - [c30]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Longest Common Extensions in Trees. CPM 2015: 52-64 - [c29]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search. ICALP (1) 2015: 580-592 - [i17]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Submatrix Maximum Queries in Monge Matrices are Equivalent to Predecessor Search. CoRR abs/1502.07663 (2015) - [i16]Shay Mozes, Cyril Nikolaev, Yahav Nussbaum, Oren Weimann:
Minimum Cut of Directed Planar Graphs in O(nloglogn) Time. CoRR abs/1512.02068 (2015) - 2014
- [j17]Erik D. Demaine, Gad M. Landau, Oren Weimann:
On Cartesian Trees and Range Minimum Queries. Algorithmica 68(3): 610-625 (2014) - [j16]Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann:
Towards optimal packed string matching. Theor. Comput. Sci. 525: 111-129 (2014) - [j15]Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster:
Approximating the maximum consecutive subsums of a sequence. Theor. Comput. Sci. 525: 130-137 (2014) - [c28]Amir Abboud, Virginia Vassilevska Williams, Oren Weimann:
Consequences of Faster Alignment of Sequences. ICALP (1) 2014: 39-51 - [c27]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Improved Submatrix Maximum Queries in Monge Matrices. ICALP (1) 2014: 525-537 - [i15]Danny Hermelin, Gad M. Landau, Yuri Rabinovich, Oren Weimann:
Binary Jumbled Pattern Matching via All-Pairs Shortest Paths. CoRR abs/1401.2065 (2014) - [i14]Shay Mozes, Yahav Nussbaum, Oren Weimann:
Faster Shortest Paths in Dense Distance Graphs, with Applications. CoRR abs/1404.0977 (2014) - [i13]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Longest Common Extensions in Trees. CoRR abs/1412.1254 (2014) - 2013
- [j14]Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann:
Unified Compression-Based Acceleration of Edit-Distance Computation. Algorithmica 65(2): 339-353 (2013) - [j13]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): 19-46 (2013) - [j12]Oren Weimann, Raphael Yuster:
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication. ACM Trans. Algorithms 9(2): 14:1-14:13 (2013) - [j11]Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann:
On approximating string selection problems with outliers. Theor. Comput. Sci. 498: 107-114 (2013) - [c26]Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann:
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. ESA 2013: 517-528 - [c25]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Tree Compression with Top Trees. ICALP (1) 2013: 160-171 - [c24]Oren Weimann, Raphael Yuster:
Approximating the Diameter of Planar Graphs in Near Linear Time. ICALP (1) 2013: 828-839 - [c23]Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann:
Improved Bounds for Online Preemptive Matching. STACS 2013: 389-399 - [i12]Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann:
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. CoRR abs/1301.6127 (2013) - [i11]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Tree Compression with Top Trees. CoRR abs/1304.5702 (2013) - [i10]Shay Mozes, Oren Weimann:
Improved Submatrix Maximum Queries in Monge Matrices. CoRR abs/1307.2313 (2013) - 2012
- [c22]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: 149-158 - [c21]Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann:
On Approximating String Selection Problems with Outliers. CPM 2012: 427-438 - [i9]Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann:
On Approximating String Selection Problems with Outliers. CoRR abs/1202.2820 (2012) - [i8]Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann:
Improved Bounds for Online Preemptive Matching. CoRR abs/1207.1788 (2012) - 2011
- [j10]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): 129-144 (2011) - [j9]Oren Weimann, David Peleg:
A note on exact distance labeling. Inf. Process. Lett. 111(14): 671-673 (2011) - [j8]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): 2-11 (2011) - [c20]Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann:
Optimal Packed String Matching. FSTTCS 2011: 423-432 - [c19]Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster:
Distance Oracles for Vertex-Labeled Graphs. ICALP (2) 2011: 490-501 - [c18]Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann:
Random Access to grammar-Compressed Strings. SODA 2011: 373-389 - [i7]Oren Weimann, Raphael Yuster:
Approximating the Diameter of Planar Graphs in Near Linear Time. CoRR abs/1112.1116 (2011) - 2010
- [j7]Oren Weimann, Raphael Yuster:
Computing the Girth of a Planar Graph in O(n logn) Time. SIAM J. Discret. Math. 24(2): 609-616 (2010) - [j6]Philip N. Klein, Shay Mozes, Oren Weimann:
Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm. ACM Trans. Algorithms 6(2): 30:1-30:18 (2010) - [c17]Gad M. Landau, Dekel Tsur, Oren Weimann:
Indexing a Dictionary for Subset Matching Queries. Algorithms and Applications 2010: 158-169 - [c16]Oren Weimann, Raphael Yuster:
Replacement Paths via Fast Matrix Multiplication. FOCS 2010: 655-662 - [i6]Philip Bille, Gad M. Landau, Oren Weimann:
Random Access to Grammar Compressed Strings. CoRR abs/1001.1565 (2010) - [i5]Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann:
Unified Compression-Based Acceleration of Edit-Distance Computation. CoRR abs/1004.1194 (2010)
2000 – 2009
- 2009
- [b1]Oren Weimann:
Accelerating dynamic programming. Massachusetts Institute of Technology, Cambridge, MA, USA, 2009 - [j5]Yury Lifshits, Shay Mozes, Oren Weimann, Michal Ziv-Ukelson:
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. Algorithmica 54(3): 379-399 (2009) - [j4]Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann:
An optimal decomposition algorithm for tree edit distance. ACM Trans. Algorithms 6(1): 2:1-2:19 (2009) - [j3]Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson:
Fast algorithms for computing tree LCS. Theor. Comput. Sci. 410(43): 4303-4314 (2009) - [c15]Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann:
Fast RNA Structure Alignment for Crossing Input Structures. CPM 2009: 236-248 - [c14]Erik D. Demaine, Gad M. Landau, Oren Weimann:
On Cartesian Trees and Range Minimum Queries. ICALP (1) 2009: 341-353 - [c13]Oren Weimann, Raphael Yuster:
Computing the Girth of a Planar Graph in O(n logn) Time. ICALP (1) 2009: 764-773 - [c12]Philip N. Klein, Shay Mozes, Oren Weimann:
Shortest paths in directed planar graphs with negative lengths: a linear-space O(n log2 n)-time algorithm. SODA 2009: 236-245 - [c11]Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann:
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. STACS 2009: 529-540 - [c10]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. WINE 2009: 125-136 - [i4]Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann:
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. CoRR abs/0902.2649 (2009) - [i3]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. CoRR abs/0909.3221 (2009) - 2008
- [c9]Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson:
Fast Algorithms for Computing Tree LCS. CPM 2008: 230-243 - [c8]Shay Mozes, Krzysztof Onak, Oren Weimann:
Finding an optimal tree searching strategy in linear time. SODA 2008: 1096-1105 - 2007
- [j2]Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M. Landau, Mikhail A. Roytberg, Oren Weimann, Kaizhong Zhang:
Locality and Gaps in RNA Comparison. J. Comput. Biol. 14(8): 1074-1087 (2007) - [c7]Shay Mozes, Oren Weimann, Michal Ziv-Ukelson:
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. CPM 2007: 4-15 - [c6]Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann:
An Optimal Decomposition Algorithm for Tree Edit Distance. ICALP 2007: 146-157 - [c5]Gad M. Landau, Dekel Tsur, Oren Weimann:
Indexing a Dictionary for Subset Matching Queries. SPIRE 2007: 195-204 - [c4]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann:
The Stackelberg Minimum Spanning Tree Game. WADS 2007: 64-76 - [i2]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann:
The Stackelberg Minimum Spanning Tree Game. CoRR abs/cs/0703019 (2007) - 2006
- [c3]Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann:
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes. CPM 2006: 246-257 - [i1]Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann:
An O(n^3)-Time Algorithm for Tree Edit Distance. CoRR abs/cs/0604037 (2006) - 2005
- [j1]Gad M. Landau, Laxmi Parida, Oren Weimann:
Gene Proximity Analysis across Whole Genomes via PQ Trees1. J. Comput. Biol. 12(10): 1289-1306 (2005) - [c2]Gad M. Landau, Laxmi Parida, Oren Weimann:
Using PQ Trees for Comparative Genomics. CPM 2005: 128-143 - [c1]Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann:
Normalized Similarity of RNA Sequences. SPIRE 2005: 360-369
Coauthor Index
[j34] [c57] [j33] [c55] [i39] [i38] [i37] [j32] [c54] [c53] [c52] [i36] [j30] [c51] [c50] [c49] [c48] [i35] [i34] [i33] [j28] [j27] [j26] [c46] [i31] [c44] [i29] [i28] [j24] [j23] [c43] [c40] [c39] [c38] [c37] [c36] [c35] [i26] [i25] [c34] [i24] [i23] [i22] [i20] [i19] [c32] [c29] [i17] [i16] [c27] [i14] [i10] [j6] [j5] [j4] [j3] [c12] [c9] [c8] [c7] [c6] [i1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
