4.1 Article

Compressed Communication Complexity of Hamming Distance

Related references

Note: Only part of the references are listed.
Article Computer Science, Theory & Methods

A combinatorial view on string attractors

Sabrina Mantaci et al.

Summary: This paper introduces the concept of string attractor and explores its combinatorial properties, showing how the size of the smallest string attractor of a word varies with combinatorial operations. A circular variant of the notion of string attractor is also introduced to characterize the conjugacy classes of standard Sturmian words.

THEORETICAL COMPUTER SCIENCE (2021)

Article Computer Science, Theory & Methods

Streaming k-mismatch with error correcting and applications

Jakub Radoszewski et al.

INFORMATION AND COMPUTATION (2020)

Article Computer Science, Theory & Methods

Space lower bounds for online pattern matching

Raphael Clifford et al.

THEORETICAL COMPUTER SCIENCE (2013)

Article Computer Science, Theory & Methods

Application of Lempel-Ziv factorization to the approximation of grammar-based compression

W Rytter

THEORETICAL COMPUTER SCIENCE (2003)