Focal Interest
Focal Interest

Algorithms and Data Compression

External reference: https://openalex.org/T11269

  1. Logarithmic-time pattern matching for compressed and dynamic texts
    Study introduces O(log n)-time algorithms for Internal Pattern Matching queries on compressed and dynamic strings using recompression-based representations.