Maintaining dynamic sequences under equality tests in polylogarithmic time
From MaRDI portal
Publication:675314
DOI10.1007/BF02522825zbMath0865.68034OpenAlexW3138321435MaRDI QIDQ675314
Kurt Mehlhorn, Rajamani Sundar, Christian Uhrig
Publication date: 30 June 1997
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02522825
Related Items (23)
Grammar index by induced suffix sorting ⋮ An LMS-based grammar self-index with local consistency properties ⋮ Approximation of smallest linear tree grammar ⋮ Fast and simple compact hashing via bucketing ⋮ Parallel Identity Testing for Skew Circuits with Big Powers and Applications ⋮ Text sparsification via local maxima. ⋮ Near-optimal search time in \(\delta \)-optimal space, and vice versa ⋮ Near-optimal search time in \(\delta \)-optimal space ⋮ Unnamed Item ⋮ Dynamic and internal longest common substring ⋮ Practical Performance of Space Efficient Data Structures for Longest Common Extensions. ⋮ Approximation of grammar-based compression via recompression ⋮ The complexity of compressed membership problems for finite automata ⋮ Grammar-based compression of unranked trees ⋮ Parallel identity testing for skew circuits with big powers and applications ⋮ Inter-procedural Two-Variable Herbrand Equalities ⋮ Repetition Detection in a Dynamic String ⋮ Dynamic index and LZ factorization in compressed space ⋮ Longest common substring made fully dynamic ⋮ Faster Algorithms for All Pairs Non-Decreasing Paths Problem ⋮ A compressed dynamic self-index for highly repetitive text collections ⋮ SLP compression for solutions of equations with constraints in free and hyperbolic groups ⋮ One-variable word equations in linear time
Cites Work
This page was built for publication: Maintaining dynamic sequences under equality tests in polylogarithmic time
