The following pages link to (Q2754135):
Displaying 20 items.
- Longest common extensions in trees (Q294947) (← 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)
- The Level-Ancestor problem on pure pointer machines (Q1007543) (← links)
- Dynamic path queries in linear space (Q1799220) (← links)
- Top tree compression of tries (Q2067669) (← links)
- Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
- Position heaps for Cartesian-tree matching on strings and tries (Q2146147) (← links)
- An improved algorithm for the minmax regret path center problem on trees (Q2194857) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- Incremental algorithm for maintaining a DFS tree for undirected graphs (Q2408922) (← links)
- Longest Common Extensions in Trees (Q2942245) (← links)
- On Dynamic DFS Tree in Directed Graphs (Q2946380) (← links)
- Path Minima in Incremental Unrooted Trees (Q3541117) (← links)
- A Space-Optimal Grammar Compression. (Q5111756) (← links)
- Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees (Q6103520) (← links)
- Computing longest Lyndon subsequences and longest common Lyndon subsequences (Q6119829) (← links)
- Time efficient implementation for online \(k\)-server problem on trees (Q6636094) (← links)
