Focal Interest
Focal Interest

Ask price

  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.