scientific article; zbMATH DE number 1263249

zbMath0978.68520MaRDI QIDQ4234121

Mikkel Thorup, Martin Farach

Publication date: 3 February 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (15)

On the complexity of pattern matching for highly compressed two-dimensional texts. ⋮ Collage system: A unifying framework for compressed pattern matching. ⋮ Efficient algorithms for Lempel-Ziv encoding ⋮ Pattern-matching problems for 2-dimensional images described by finite automata ⋮ Practical and flexible pattern matching over Ziv-Lempel compressed text. ⋮ On compressing and indexing repetitive sequences ⋮ Inplace run-length 2d compressed search. ⋮ Application of Lempel-Ziv factorization to the approximation of grammar-based compression. ⋮ Unnamed Item ⋮ Simple and efficient LZW-compressed multiple pattern matching ⋮ Compressed matching in dictionaries ⋮ The complexity of compressed membership problems for finite automata ⋮ Compressed string-matching in standard Sturmian words ⋮ The complexity of compressing subsegments of images described by finite automata ⋮ String matching over compressed text on handheld devices using tagged sub-optimal code (TSC)

This page was built for publication: