Maintaining dynamic sequences under equality tests in polylogarithmic time
From MaRDI portal
Recommendations
Cites work
Cited in
(28)- Longest common substring made fully dynamic
- Near-optimal search time in \(\delta \)-optimal space, and vice versa
- One-variable word equations in linear time
- Representing sets with constant time equality testing
- Text sparsification via local maxima.
- Edit distance with block operations
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions.
- An LMS-based grammar self-index with local consistency properties
- Grammar index by induced suffix sorting
- Dynamic and internal longest common substring
- Compressed decision problems in hyperbolic groups
- Faster Algorithms for All Pairs Non-Decreasing Paths Problem
- SLP compression for solutions of equations with constraints in free and hyperbolic groups.
- The complexity of compressed membership problems for finite automata
- Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences
- Internal pattern matching queries in a text and applications
- Languages and Compilers for Parallel Computing
- Approximation of smallest linear tree grammar
- Near-optimal search time in \(\delta \)-optimal space
- Parallel identity testing for skew circuits with big powers and applications
- A compressed dynamic self-index for highly repetitive text collections
- Approximation of grammar-based compression via recompression
- Fast and simple compact hashing via bucketing
- Repetition Detection in a Dynamic String
- Cyclotomic identity testing and applications
- Parallel identity testing for skew circuits with big powers and applications
- Space-efficient conversions from SLPs
- Dynamic index and LZ factorization in compressed space
This page was built for publication: Maintaining dynamic sequences under equality tests in polylogarithmic time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675314)
