The following pages link to Shay Mozes (Q732017):
Displaying 48 items.
- Fast algorithms for computing tree LCS (Q732018) (← links)
- Speeding up HMM decoding and training by exploiting sequence repetitions (Q834590) (← links)
- The nearest colored node in a tree (Q1698706) (← links)
- Faster shortest paths in dense distance graphs, with applications (Q1698725) (← links)
- Efficient vertex-label distance oracles for planar graphs (Q1743124) (← links)
- Compressed range minimum queries (Q2297849) (← links)
- An optimal decomposition algorithm for tree edit distance (Q2930275) (← links)
- Shortest paths in directed planar graphs with negative lengths (Q2930306) (← links)
- A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection (Q2941581) (← links)
- The Train Delivery Problem - Vehicle Routing Meets Bin Packing (Q3075453) (← 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)
- New construction for a QMA complete three-local Hamiltonian (Q3529790) (← links)
- (Q3579429) (← links)
- Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time (Q3586397) (← links)
- (Q4607913) (← links)
- (Q4607914) (← links)
- (Q4607915) (← links)
- (Q4607916) (← links)
- (Q4607965) (← links)
- (Q4633831) (← links)
- Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications (Q4962663) (← links)
- Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search (Q4987433) (← links)
- (Q5009573) (← links)
- (Q5111728) (← links)
- Improved Submatrix Maximum Queries in Monge Matrices (Q5167770) (← links)
- Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time (Q5199274) (← links)
- Almost optimal distance oracles for planar graphs (Q5212755) (← links)
- Short and Simple Cycle Separators in Planar Graphs (Q5232446) (← links)
- Exact Distance Oracles for Planar Graphs with Failing Vertices (Q5236314) (← links)
- Short and Simple Cycle Separators in Planar Graphs (Q5266605) (← links)
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time (Q5348455) (← links)
- The Nearest Colored Node in a Tree (Q5369560) (← links)
- An Optimal Decomposition Algorithm for Tree Edit Distance (Q5428805) (← links)
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time (Q5495015) (← links)
- Structured recursive separator decompositions for planar graphs in linear time (Q5495821) (← links)
- (Q5743390) (← links)
- (Q5743404) (← links)
- Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
- Dynamic String Alignment. (Q5874435) (← links)
- Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can) (Q5888939) (← links)
- Efficient dynamic approximate distance oracles for vertex-labeled planar graphs (Q5915659) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5918639) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5970814) (← links)
- (Q6147524) (← links)
- (Q6187842) (← links)
- The fine-grained complexity of episode matching (Q6496830) (← links)
