The following pages link to Finding level-ancestors in trees (Q1329158):
Displaying 30 items.
- Longest common extensions in trees (Q294947) (← links)
- Algorithms for interval structures with applications (Q388095) (← links)
- Cross-document pattern matching (Q396714) (← links)
- Succinct representations of permutations and functions (Q441860) (← links)
- Compressed subsequence matching and packed tree coloring (Q513266) (← links)
- The level ancestor problem simplified (Q596133) (← links)
- All-pairs disjoint paths from a common ancestor in \(\widetilde O (n^\omega)\) time (Q924140) (← links)
- Center location problems on tree graphs with subtree-shaped customers (Q1005232) (← links)
- The Level-Ancestor problem on pure pointer machines (Q1007543) (← links)
- Improved algorithms for the multicut and multiflow problems in rooted trees (Q1024699) (← links)
- Real two dimensional scaled matching (Q1024780) (← links)
- The suffix tree of a tree and minimizing sequential transducers (Q1127317) (← links)
- Parallel rectilinear shortest paths with rectangular obstacles (Q1190293) (← links)
- Parallel construction and query of index data structures for pattern matching on square matrices (Q1288531) (← links)
- Rectilinear short path queries among rectangular obstacles (Q1351630) (← links)
- A \(\min\)-\(\max\) relation in flowgraphs and some applications (Q1752483) (← links)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- Constructing LZ78 tries and position heaps in linear time for large alphabets (Q2346553) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- Succinct Representations of Ordinal Trees (Q2848982) (← links)
- Longest Common Extensions in Trees (Q2942245) (← links)
- (Q5088898) (← links)
- Faster queries for longest substring palindrome after block edit (Q5088918) (← links)
- On geometric path query problems (Q5096943) (← links)
- Small-space LCE data structure with constant-time queries (Q5111224) (← links)
- Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms. (Q5140774) (← links)
- Fast Label Extraction in the CDAWG (Q5150929) (← links)
- A linear‐time algorithm for broadcast domination in a tree (Q5191137) (← links)
- Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees (Q6072286) (← links)
- Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees (Q6103520) (← links)
