Pages that link to "Item:Q3319776"
From MaRDI portal
The following pages link to Fast Algorithms for Finding Nearest Common Ancestors (Q3319776):
Displaying 44 items.
- A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners (Q5090997) (← links)
- (Q5091140) (← links)
- Finding cores of limited length (Q5096925) (← links)
- Small-space LCE data structure with constant-time queries (Q5111224) (← links)
- Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) (← links)
- Strong Connectivity in Directed Graphs under Failures, with Applications (Q5123984) (← links)
- Compact and localized distributed data structures (Q5138487) (← links)
- Non-Overlapping Indexing - Cache Obliviously (Q5140770) (← links)
- Longest substring palindrome after edit (Q5140775) (← links)
- Longest Lyndon Substring After Edit (Q5140783) (← links)
- The Heaviest Induced Ancestors Problem Revisited (Q5140784) (← links)
- PARENT QUERIES OVER DYNAMIC BALANCED PARENTHESIS STRINGS (Q5168423) (← links)
- Spaces, Trees, and Colors (Q5176183) (← links)
- A linear‐time algorithm for broadcast domination in a tree (Q5191137) (← links)
- Approximation algorithms for graph augmentation (Q5204328) (← links)
- Fast incremental planarity testing (Q5204329) (← links)
- PARALLEL RANGE MINIMA ON COARSE GRAINED MULTICOMPUTERS (Q5249012) (← links)
- Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)
- Inductive computations on graphs defined by clique-width expressions (Q5321781) (← links)
- Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint (Q5387633) (← links)
- (Q5743393) (← links)
- Fast and Deterministic Approximations for k-Cut. (Q5875475) (← links)
- Optimal parallel suffix tree construction (Q5906825) (← links)
- An improved algorithm for diameter-optimally augmenting paths in a metric space (Q5915544) (← links)
- A linear-time algorithm for radius-optimally augmenting paths in a metric space (Q5918103) (← links)
- A linear-space data structure for range-LCP queries in poly-logarithmic time (Q5918832) (← links)
- Covering uncertain points in a tree (Q5920112) (← links)
- Range LCP (Q5920340) (← links)
- Euler is standing in line dial-a-ride problems with precedence-constraints (Q5948963) (← links)
- Compressed indexes for approximate string matching (Q5961970) (← links)
- Tight bound for the number of distinct palindromes in a tree (Q6042101) (← links)
- Shortest-Path Queries in Geometric Networks (Q6065461) (← links)
- Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees (Q6103520) (← links)
- Shortest beer path queries in outerplanar graphs (Q6103523) (← links)
- Partial and simultaneous transitive orientations via modular decompositions (Q6130330) (← links)
- Reconstructing parameterized strings from parameterized suffix and LCP arrays (Q6199197) (← links)
- Range shortest unique substring queries (Q6536259) (← links)
- On efficient algorithms for bottleneck path problems with many sources (Q6542462) (← links)
- Counting edges in a dag (Q6550536) (← links)
- Suffix arrays for multiple strings: a method for on-line multiple string searches (Q6560350) (← links)
- Hierarchical categories in colored searching (Q6577435) (← links)
- Algorithms for subpath convex hull queries and ray-shooting among segments (Q6593765) (← links)
- Approximation algorithms for the two-watchman route in a simple polygon (Q6614109) (← links)
- Minimum cut in \(O(m \log^2 n)\) time (Q6614613) (← links)
