Equality Testing of Compressed Strings

DOI10.1007/978-3-319-23660-5_2MaRDI QIDQ3449353zbMATH OpenOpenAlexFDO

Authors Markus Lohrey

Publication date 4 November 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-23660-5_2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Cites work

• scientific article; zbMATH DE number 6678923 (Why is no real title available?)
• scientific article; zbMATH DE number 3658527 (Why is no real title available?)
• scientific article; zbMATH DE number 687006 (Why is no real title available?)
• scientific article; zbMATH DE number 1003252 (Why is no real title available?)
• scientific article; zbMATH DE number 784042 (Why is no real title available?)
• scientific article; zbMATH DE number 1445383 (Why is no real title available?)
• A Mathematical Theory of Communication
• A note on succinct representations of graphs
• A polynomial algorithm for deciding bisimilarity of normed context-free processes
• Algorithmics on SLP-compressed strings: a survey
• Approximation of smallest linear tree grammar
• Derandomizing polynomial identity tests means proving circuit lower bounds
• Efficient algorithms for Lempel-Ziv encoding
• Fast equality test for straight-line compressed strings
• Introduction to Lie Algebras and Representation Theory
• On the complexity of pattern matching for highly compressed two-dimensional texts.
• Parallel identity testing for skew circuits with big powers and applications
• Primality and identity testing via Chinese remaindering
• Processing Compressed Texts: A Tractability Border
• Querying and Embedding Compressed Texts
• Succinct circuit representations and leaf language classes are basically the same concept
• Succinct representation, leaf languages, and projection reductions
• Succinct representations of graphs
• The Compressed Word Problem for Groups
• The Smallest Grammar Problem
• The complexity of searching succinctly represented graphs
• The parallel complexity of exponentiating polynomials over finite fields
• Uniqueness Theorems for Periodic Functions

Cited in

(1)

• Comparing Degenerate Strings

This page was built for publication: Equality Testing of Compressed Strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449353)