Fast equality test for straight-line compressed strings

Authors:
Manfred Schmidt-Schauí;Georg Schnitger
Affiliations:
Institut für Informatik, Goethe-Universität, Postfach 11 19 32, D-60054 Frankfurt, Germany;Institut für Informatik, Goethe-Universität, Postfach 11 19 32, D-60054 Frankfurt, Germany
Venue:
Information Processing Letters
Year:
2012

Citing 9
Cited 0

Algorithmic number theory

Algorithmic number theory
Complexity of Language Recognition Problems for Compressed Words

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract)

CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Testing Equivalence of Morphisms on Context-Free Languages

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Efficient memory representation of XML document trees

Information Systems
Context Matching for Compressed Terms

LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Efficient memory representation of XML documents

DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
A universal algorithm for sequential data compression

IEEE Transactions on Information Theory
Processing compressed texts: a tractability border

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.89

Visualization

Abstract

The paper describes a simple and fast randomized test for equality of grammar-compressed strings. The thorough running time analysis is done by applying a logarithmic cost measure.