Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Groups Complexity Cryptology

Managing Editor: Shpilrain, Vladimir / Weil, Pascal

Editorial Board Member: Blackburn, Simon R. / Conder, Marston / Dehornoy, Patrick / Eick, Bettina / Fine, Benjamin / Gilman, Robert / Grigoriev, Dima / Ko, Ki Hyoung / Kreuzer, Martin / Mikhalev, Alexander V. / Myasnikov, Alexei / Roman'kov, Vitalii / Rosenberger, Gerhard / Sapir, Mark / Schäge, Sven / Thomas, Rick / Tsaban, Boaz / Capell, Enric Ventura

2 Issues per year


CiteScore 2016: 0.35

SCImago Journal Rank (SJR) 2016: 0.372
Source Normalized Impact per Paper (SNIP) 2016: 0.517

Mathematical Citation Quotient (MCQ) 2016: 0.23

Online
ISSN
1869-6104
See all formats and pricing
More options …

Algorithmics on SLP-compressed strings: A survey

Markus Lohrey
Published Online: 2012-11-27 | DOI: https://doi.org/10.1515/gcc-2012-0016

Abstract.

Results on algorithmic problems on strings that are given in a compressed form via straight-line programs are surveyed. A straight-line program is a context-free grammar that generates exactly one string. In this way, exponential compression rates can be achieved. Among others, we study pattern matching for compressed strings, membership problems for compressed strings in various kinds of formal languages, and the problem of querying compressed strings. Applications in combinatorial group theory and computational topology and to the solution of word equations are discussed as well. Finally, extensions to compressed trees and pictures are considered.

Keywords: Algorithms for compressed strings; compressed word problems; computational complexity

About the article

Received: 2012-06-06

Published Online: 2012-11-27

Published in Print: 2012-12-01


Citation Information: , ISSN (Online) 1869-6104, ISSN (Print) 1867-1144, DOI: https://doi.org/10.1515/gcc-2012-0016.

Export Citation

© 2012 by Walter de Gruyter Berlin Boston. Copyright Clearance Center

Citing Articles

Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.

[1]
Markus Lohrey and Georg Zetzsche
Theory of Computing Systems, 2017
[2]
Sebastian Eberhard and Stefan Hetzl
Information and Computation, 2017
[3]
Markus Lohrey, Sebastian Maneth, and Carl Philipp Reh
Algorithmica, 2017
[4]
[5]
Artur Jeż and Alexander Okhotin
Theoretical Computer Science, 2017, Volume 665, Page 13
[6]
Moses Ganardi, Danny Hucke, Artur Jeż, Markus Lohrey, and Eric Noeth
Journal of Computer and System Sciences, 2017, Volume 86, Page 136
[7]
Artur Jeż and Markus Lohrey
Information and Computation, 2016, Volume 251, Page 215
[8]
Artur Jeż
Theoretical Computer Science, 2016, Volume 616, Page 141
[9]
Markus Lohrey and Manfred Schmidt-Schauß
Theory of Computing Systems, 2017, Volume 61, Number 2, Page 322
[10]
Markus Lohrey and Christian Mathissen
Information and Computation, 2013, Volume 224, Page 71
[11]
Artur Jeż
Theoretical Computer Science, 2015, Volume 592, Page 115
[12]
Artur Jeż
Theory of Computing Systems, 2014, Volume 55, Number 4, Page 685
[13]
Alexander Tiskin
Algorithmica, 2015, Volume 71, Number 4, Page 859
[14]
Volker Diekert, Olga Kharlampovich, and Atefeh Mohajeri Moghaddam
International Journal of Algebra and Computation, 2015, Volume 25, Number 01n02, Page 81
[15]
Travis Gagie, Paweł Gawrychowski, and Simon J. Puglisi
Journal of Discrete Algorithms, 2015, Volume 32, Page 64

Comments (0)

Please log in or register to comment.
Log in