scientific article

zbMath0973.68665MaRDI QIDQ2754135

Stephen Alstrup, Jacob Holm

Publication date: 9 December 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items (20)

Succinct indices for path minimum, with applications ⋮ Longest common extensions in trees ⋮ Efficient algorithms for the minmax regret path center problem with length constraint on trees ⋮ Position heaps for Cartesian-tree matching on strings and tries ⋮ Fingerprints in compressed strings ⋮ The level ancestor problem simplified ⋮ Incremental algorithm for maintaining a DFS tree for undirected graphs ⋮ Longest Common Extensions in Trees ⋮ On Dynamic DFS Tree in Directed Graphs ⋮ Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees ⋮ Computing longest Lyndon subsequences and longest common Lyndon subsequences ⋮ An improved algorithm for the minmax regret path center problem on trees ⋮ Succinct representations of permutations and functions ⋮ Path Minima in Incremental Unrooted Trees ⋮ Compressed subsequence matching and packed tree coloring ⋮ Dynamic path queries in linear space ⋮ The Level-Ancestor problem on pure pointer machines ⋮ Time efficient implementation for online \(k\)-server problem on trees ⋮ Top tree compression of tries ⋮ A Space-Optimal Grammar Compression.

This page was built for publication: