Pages that link to "Item:Q3823152"
From MaRDI portal
The following pages link to On Finding Lowest Common Ancestors: Simplification and Parallelization (Q3823152):
Displaying 50 items.
- Satisfiability problems on intervals and unit intervals (Q1392209) (← links)
- Kinetic collision detection between two simple polygons. (Q1428461) (← links)
- Computing longest common extensions in partial words (Q1647840) (← links)
- A simple linear-space data structure for constant-time range minimum query (Q1740692) (← links)
- Single backup table schemes for shortest-path routing (Q1770371) (← links)
- Parallel preprocessing for path queries without concurrent reading. (Q1854339) (← links)
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree (Q1861569) (← links)
- When can you fold a map? (Q1883580) (← links)
- Optimal parallel algorithms for rectilinear link-distance problems (Q1897477) (← links)
- Designing checkers for programs that run in parallel (Q1911462) (← links)
- Variations of the parameterized longest previous factor (Q1932360) (← links)
- The lowest common ancestor problem on a tree with an unfixed root (Q1961826) (← links)
- On the restricted 1-Steiner tree problem (Q2019490) (← links)
- Efficient pattern matching in elastic-degenerate strings (Q2042726) (← links)
- Range minimum queries in minimal space (Q2078612) (← links)
- On the restricted \(k\)-Steiner tree problem (Q2084651) (← links)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- Fast parallel and serial multidimensional approximate array matching (Q2277849) (← links)
- Reciprocal best match graphs (Q2299268) (← links)
- Geometric biplane graphs. II: Graph augmentation (Q2345512) (← links)
- Faster algorithms for finding lowest common ancestors in directed acyclic graphs (Q2373733) (← links)
- Approximating points by a piecewise linear function (Q2375945) (← links)
- On the range maximum-sum segment query problem (Q2384388) (← links)
- Best match graphs (Q2420450) (← links)
- Fast smallest lowest common ancestor computation based on stable match (Q2434584) (← links)
- Algorithms for extracting motifs from biological weighted sequences (Q2457295) (← links)
- Linear time algorithm for the longest common repeat problem (Q2457296) (← links)
- Longest repeats with a block of \(k\) don't cares (Q2508981) (← links)
- Checking whether a word is Hamming-isometric in linear time (Q2676462) (← links)
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time (Q2810272) (← links)
- A Linear-Time Algorithm for Reconciliation of Non-binary Gene Tree and Binary Species Tree (Q2867119) (← links)
- A fast algorithm for finding the lowest common ancestor of two neighboring nodes in a complete binary tree (Q2923974) (← links)
- Data-Oblivious Graph Algorithms in Outsourced External Memory (Q2942400) (← links)
- On the Galois Lattice of Bipartite Distance Hereditary Graphs (Q2946040) (← links)
- The longest common substring problem (Q2971067) (← links)
- FINDING ALL APPROXIMATE GAPPED PALINDROMES (Q3069733) (← links)
- Fast Algorithms for Finding Nearest Common Ancestors (Q3319776) (← links)
- Simple Parallel Algorithms for Dynamic Range Products (Q3464484) (← links)
- A Path Cover Technique for LCAs in Dags (Q3512461) (← links)
- Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication (Q3527218) (← links)
- Succinct Greedy Graph Drawing in the Hyperbolic Plane (Q3611834) (← links)
- Optimal parallel colouring algorithms for totally decomposable graphs (Q4323714) (← links)
- Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree<sup>∗</sup> (Q4511611) (← links)
- Dynamic algorithms for graphs of bounded treewidth (Q4571961) (← links)
- FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH (Q4820153) (← links)
- Parallel dynamic lowest common ancestors (Q5054770) (← links)
- Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs (Q5055890) (← links)
- Faster enumeration of all spanning trees of a directed graph (Q5057454) (← links)
- A simpler minimum spanning tree verification algorithm (Q5057455) (← links)
- Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs (Q5060111) (← links)
