The following pages link to Oren Weimann (Q294946):
Displaying 50 items.
- Longest common extensions in trees (Q294947) (← links)
- On approximating string selection problems with outliers (Q391209) (← links)
- On Cartesian trees and range minimum queries (Q528853) (← links)
- Fast RNA structure alignment for crossing input structures (Q533402) (← links)
- The Stackelberg minimum spanning tree game (Q627533) (← links)
- Fast algorithms for computing tree LCS (Q732018) (← links)
- Incremental distance products via faulty shortest paths (Q783710) (← links)
- Speeding up HMM decoding and training by exploiting sequence repetitions (Q834590) (← links)
- Binary jumbled pattern matching on trees and tree-like structures (Q893318) (← links)
- The nearest colored node in a tree (Q1698706) (← links)
- Faster shortest paths in dense distance graphs, with applications (Q1698725) (← links)
- Improved bounds for randomized preemptive online matching (Q1706142) (← links)
- Bookmarks in grammar-compressed strings (Q1796844) (← links)
- Unified compression-based acceleration of edit-distance computation (Q1939664) (← links)
- A note on exact distance labeling (Q1944109) (← links)
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs (Q1945700) (← links)
- Top tree compression of tries (Q2067669) (← links)
- Compressed range minimum queries (Q2297849) (← links)
- Tree compression with top trees (Q2347804) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- Approximating the maximum consecutive subsums of a sequence (Q2437755) (← links)
- Binary Jumbled Pattern Matching on Trees and Tree-Like Structures (Q2849342) (← links)
- Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence (Q2904488) (← links)
- On Approximating String Selection Problems with Outliers (Q2904515) (← links)
- Optimal packed string matching (Q2911643) (← links)
- An optimal decomposition algorithm for tree edit distance (Q2930275) (← links)
- Shortest paths in directed planar graphs with negative lengths (Q2930306) (← links)
- Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication (Q2933644) (← links)
- Longest Common Extensions in Trees (Q2942245) (← links)
- Improved Bounds for Online Preemptive Matching (Q2957900) (← links)
- Distance Oracles for Vertex-Labeled Graphs (Q3012943) (← links)
- Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search (Q3448817) (← links)
- Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions (Q3506904) (← links)
- Fast Algorithms for Computing Tree LCS (Q3506956) (← links)
- Indexing a Dictionary for Subset Matching Queries (Q3558268) (← links)
- (Q3579429) (← links)
- The Stackelberg Minimum Spanning Tree Game (Q3603515) (← links)
- Fast RNA Structure Alignment for Crossing Input Structures (Q3637116) (← links)
- On Cartesian Trees and Range Minimum Queries (Q3638046) (← links)
- Computing the Girth of a Planar Graph in O(n logn) Time (Q3638079) (← links)
- (Q4607913) (← links)
- (Q4607914) (← links)
- (Q4607915) (← links)
- (Q4607916) (← links)
- (Q4607965) (← links)
- (Q4633831) (← links)
- Approximating the Diameter of Planar Graphs in Near Linear Time (Q4962209) (← links)
- Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search (Q4987433) (← links)
- (Q5002740) (← links)
- A Faster FPTAS for #Knapsack (Q5002742) (← links)
