Finding level-ancestors in trees
From MaRDI portal
Recommendations
Cites work
- Almost fully-parallel parentheses matching
- An Efficient Parallel Biconnectivity Algorithm
- Computing on a free tree via complexity-preserving mappings
- Fast Algorithms for Finding Nearest Common Ancestors
- Faster optimal parallel prefix sums and list ranking
- Finding the maximum, merging, and sorting in a parallel computation model
- scientific article; zbMATH DE number 4064468 (Why is no real title available?)
- On efficient parallel strong orientation
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Parallel Prefix Computation
- Parallel Tridiagonal Equation Solvers
- Recognizing breadth-first search trees in linear time
- Recursive Star-Tree Parallel Data Structure
- Relations between Concurrent-Write Models of Parallel Computation
Cited in
(40)- Center location problems on tree graphs with subtree-shaped customers
- The Level-Ancestor problem on pure pointer machines
- Improved algorithms for the multicut and multiflow problems in rooted trees
- Real two dimensional scaled matching
- The suffix tree of a tree and minimizing sequential transducers
- Parallel rectilinear shortest paths with rectangular obstacles
- Parallel construction and query of index data structures for pattern matching on square matrices
- Rectilinear short path queries among rectangular obstacles
- A \(\min\)-\(\max\) relation in flowgraphs and some applications
- Computing longest palindromic substring after single-character or block-wise edits
- Constructing LZ78 tries and position heaps in linear time for large alphabets
- scientific article; zbMATH DE number 1670815 (Why is no real title available?)
- Succinct representations of ordinal trees
- Longest common extensions in trees
- Longest common extensions in trees
- scientific article; zbMATH DE number 2086252 (Why is no real title available?)
- scientific article; zbMATH DE number 4213470 (Why is no real title available?)
- Algorithms for interval structures with applications
- Cross-document pattern matching
- scientific article; zbMATH DE number 88972 (Why is no real title available?)
- scientific article; zbMATH DE number 177536 (Why is no real title available?)
- Succinct representations of permutations and functions
- scientific article; zbMATH DE number 7559178 (Why is no real title available?)
- Faster queries for longest substring palindrome after block edit
- On geometric path query problems
- Small-space LCE data structure with constant-time queries
- Locally maximal common factors as a tool for efficient dynamic string algorithms
- Fast label extraction in the CDAWG
- A linear‐time algorithm for broadcast domination in a tree
- The level ancestor problem simplified
- Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees
- Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
- Linear-size suffix tries and linear-size CDAWGs simplified and improved
- A faster algorithm for constructing the frequency difference consensus tree
- Finding diameter-reducing shortcuts in trees
- Computing minimal absent words and extended bispecial factors with CDAWG space
- Compressed dictionary matching on run-length encoded strings
- Compressed dictionary matching on run-length encoded strings
- A faster algorithm for constructing the frequency difference consensus tree
- All-pairs disjoint paths from a common ancestor in \(\widetilde O (n^\omega)\) time
This page was built for publication: Finding level-ancestors in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329158)
