The level ancestor problem simplified
From MaRDI portal
Publication:596133
Recommendations
Cites work
Cited in
(62)- Efficiently computing runs on a trie
- Longest Lyndon Substring After Edit
- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs
- Succinct dynamic cardinal trees
- Shortest-Path Queries in Geometric Networks
- scientific article; zbMATH DE number 7559178 (Why is no real title available?)
- scientific article; zbMATH DE number 7651193 (Why is no real title available?)
- Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
- Fast label extraction in the CDAWG
- Distance queries over dynamic interval graphs
- Absent subsequences in words
- Longest common extensions in trees
- scientific article; zbMATH DE number 2086252 (Why is no real title available?)
- Longest common extensions in trees
- Efficient counting of square substrings in a tree
- Mincut Sensitivity Data Structures for the Insertion of an Edge
- Cross-document pattern matching
- Faster algorithms for computing the R* consensus tree
- The Level-Ancestor problem on pure pointer machines
- Ramsey partitions and proximity data structures
- Position heaps for Cartesian-tree matching on strings and tries
- Parallel construction of succinct trees
- Internal dictionary matching
- Computing longest palindromic substring after single-character or block-wise edits
- Fast approximation and exact computation of negative curvature parameters of graphs
- scientific article; zbMATH DE number 7561422 (Why is no real title available?)
- Finding articulation points of large graphs in linear time
- Absent Subsequences in Words
- Tight bound for the number of distinct palindromes in a tree
- Small-space LCE data structure with constant-time queries
- Balancing graph Voronoi diagrams with one more vertex
- Linear-size suffix tries and linear-size CDAWGs simplified and improved
- Mincut sensitivity data structures for the insertion of an edge
- Fast layout computation of clustered networks: algorithmic advances and experimental analysis
- A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners
- Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees
- Self-indexed Text Compression Using Straight-Line Programs
- Fully functional static and dynamic succinct trees
- On compact representations of all-pairs-shortest-path-distance matrices
- Time efficient implementation for online \(k\)-server problem on trees
- Constant delay traversal of grammar-compressed graphs with bounded rank
- Constructing LZ78 tries and position heaps in linear time for large alphabets
- Morphing tree drawings in a small 3D grid
- Top tree compression of tries
- Faster queries for longest substring palindrome after block edit
- Tree path majority data structures
- Efficient oracles and routing schemes for replacement paths
- Efficient computation of longest single-arm-gapped palindromes in a string
- Indexing graph search trees and applications
- On finding the Adams consensus tree
- Generalized substring compression
- A linear‐time algorithm for broadcast domination in a tree
- Range Medians
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
- Simple and efficient fully-functional succinct trees
- Computing runs on a trie
- On longest common property preserved substring queries
- On efficient algorithms for bottleneck path problems with many sources
- \(L_{1}\) shortest path queries in simple polygons
- Connectivity oracles for graphs subject to vertex failures
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
- Enumerating \(m\)-length walks in directed graphs with constant delay
This page was built for publication: The level ancestor problem simplified
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596133)
