Pages that link to "Item:Q596133"
From MaRDI portal
The following pages link to The level ancestor problem simplified (Q596133):
Displayed 50 items.
- Succinct dynamic cardinal trees (Q262263) (← links)
- Longest common extensions in trees (Q294947) (← links)
- Cross-document pattern matching (Q396714) (← links)
- Simple and efficient fully-functional succinct trees (Q507389) (← links)
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text (Q507399) (← links)
- Compressed subsequence matching and packed tree coloring (Q513266) (← links)
- Faster algorithms for computing the R* consensus tree (Q727985) (← links)
- Constant delay traversal of grammar-compressed graphs with bounded rank (Q776844) (← links)
- Tree path majority data structures (Q784481) (← links)
- Efficiently computing runs on a trie (Q820550) (← links)
- Fast layout computation of clustered networks: algorithmic advances and experimental analysis (Q903597) (← links)
- On compact representations of all-pairs-shortest-path-distance matrices (Q986563) (← links)
- Ramsey partitions and proximity data structures (Q997827) (← links)
- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393) (← links)
- Internal dictionary matching (Q2037109) (← links)
- Top tree compression of tries (Q2067669) (← links)
- Position heaps for Cartesian-tree matching on strings and tries (Q2146147) (← links)
- Mincut sensitivity data structures for the insertion of an edge (Q2165037) (← links)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- Efficient counting of square substrings in a tree (Q2250458) (← links)
- \(L_{1}\) shortest path queries in simple polygons (Q2272388) (← links)
- Efficient computation of longest single-arm-gapped palindromes in a string (Q2297859) (← links)
- Constructing LZ78 tries and position heaps in linear time for large alphabets (Q2346553) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- On finding the Adams consensus tree (Q2407110) (← links)
- Parallel construction of succinct trees (Q2410360) (← links)
- Generalized substring compression (Q2437745) (← links)
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning (Q2515049) (← links)
- Absent subsequences in words (Q2695493) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Longest Common Extensions in Trees (Q2942245) (← links)
- Self-indexed Text Compression Using Straight-Line Programs (Q3182928) (← links)
- Efficient Oracles and Routing Schemes for Replacement Paths (Q3304107) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- Finding Articulation Points of Large Graphs in Linear Time (Q3449834) (← links)
- Range Medians (Q3541112) (← links)
- (Q5088898) (← links)
- Computing runs on a trie (Q5088914) (← links)
- Faster queries for longest substring palindrome after block edit (Q5088918) (← links)
- A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners (Q5090997) (← links)
- (Q5091063) (← links)
- (Q5092430) (← links)
- Small-space LCE data structure with constant-time queries (Q5111224) (← links)
- Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs (Q5115790) (← links)
- Longest Lyndon Substring After Edit (Q5140783) (← links)
- Fast Label Extraction in the CDAWG (Q5150929) (← links)
- A linear‐time algorithm for broadcast domination in a tree (Q5191137) (← links)
- Mincut Sensitivity Data Structures for the Insertion of an Edge (Q5874478) (← links)
- (Q5874525) (← links)
- Covering uncertain points in a tree (Q5920112) (← links)