Maintaining dynamic sequences under equality tests in polylogarithmic time
From MaRDI portal
Recommendations
Cites work
Cited in
(40)- Text sparsification via local maxima.
- Grammar index by induced suffix sorting
- An LMS-based grammar self-index with local consistency properties
- Fast and simple compact hashing via bucketing
- Dynamic and internal longest common substring
- The complexity of compressed membership problems for finite automata
- Dynamic index and LZ factorization in compressed space
- One-variable word equations in linear time
- Parallel identity testing for skew circuits with big powers and applications
- Approximation of smallest linear tree grammar
- Representing sets with constant time equality testing
- Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences
- scientific article; zbMATH DE number 1003252 (Why is no real title available?)
- Parallel identity testing for skew circuits with big powers and applications
- Edit distance with block operations
- Approximation of grammar-based compression via recompression
- Repetition Detection in a Dynamic String
- Longest common substring made fully dynamic
- Faster Algorithms for All Pairs Non-Decreasing Paths Problem
- SLP compression for solutions of equations with constraints in free and hyperbolic groups.
- Languages and Compilers for Parallel Computing
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions.
- Near-optimal search time in -optimal space, and vice versa
- Near-optimal search time in -optimal space
- Space-efficient conversions from SLPs
- Compressed decision problems in hyperbolic groups
- Internal pattern matching queries in a text and applications
- Cyclotomic identity testing and applications
- Near-optimal algorithm for constructing greedy consensus tree
- A textbook solution for dynamic strings
- Minimizing tardy processing time on a single machine in near-linear time
- Construction of sparse suffix trees and LCE indexes in optimal time and space
- Minimizing tardy processing time on a single machine in near-linear time
- Locally consistent parsing for text indexing in small space
- Logarithmic-time internal pattern matching queries in compressed and dynamic texts
- A textbook solution for dynamic strings
- Grammar index by induced suffix sorting
- Bounded weighted edit distance: dynamic algorithms and matching lower bounds
- Designing compact ILPs via fast witness verification
- A compressed dynamic self-index for highly repetitive text collections
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)
