Algorithmics on SLP-compressed strings: A survey

Groups, Complexity, Cryptology

Volumn 4, Issue 2, 2012, Pages 241-299

  Lohrey, Markus ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

Algorithms for compressed strings; Compressed word problems; Computational complexity

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONTEXT FREE GRAMMARS; FORMAL LANGUAGES; GROUP THEORY; PATTERN MATCHING;

ALGORITHMIC PROBLEMS; COMBINATORIAL GROUP THEORY; COMPRESSION RATES; COMPUTATIONAL TOPOLOGY; MEMBERSHIP PROBLEM; STRAIGHT LINE PROGRAM; WORD EQUATIONS; WORD PROBLEM;

SURVEYS;

EID: 84872769237     PISSN: 18671144     EISSN: 18696104     Source Type: Journal    
DOI: 10.1515/gcc-2012-0016     Document Type: Article

References (144)

1. M. Agrawal and R. Saptharishi, Classifying polynomials and identity testing, Current Trends in Science-Platinum Jubilee Special (2009), 149-162.
2. T. Akutsu, A bisection algorithm for grammar-based compression of ordered trees, Inf. Process. Lett. 110 (2010), no. 18-19, 815-820.
3. E. Allender, P. Bürgisser, J. Kjeldgaard-Pedersen and P. B. Miltersen, On the complexity of numerical analysis, SIAM J. Comput. 38 (2009), no. 5, 1987-2006.
4. S. Alstrup, G. S. Brodal and T. Rauhe, Dynamic pattern matching, Technical Report DIKU Report 98/27, Department of Computer Science, University of Copenhagen, 1998.
5. S. Alstrup, G. S. Brodal and T. Rauhe, Pattern matching in dynamic texts, in: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), ACM/SIAM (2000), 819-828.
6. R. Alur and P. Madhusudan, Visibly pushdown languages, in: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), ACM Press (2004), 202-211.
7. A. Amir, G. Benson and M. Farach, Let sleeping files lie: Pattern matching in Zcompressed files, J. Comput. Syst. Sci. Int. 52 (1996), no. 2, 299-307.
8. J. Arpe and R. Reischuk, On the complexity of optimal grammar-based compression, in: Proceedings of the Data Compression Conference (DCC 2006), IEEE Computer Society (2006), 173-182.
9. D. A. M. Barrington, Bounded-width polynomial-size branching programs recognize exactly those languages in NC1, J. Comput. Syst. Sci. Int. 38 (1989), 150-164.
10. M. Beaudry, P. McKenzie, P. Péladeau and D. Thérien, Finite monoids: From word to circuit evaluation, SIAM J. Comput. 26 (1997), no. 1, 138-152.
11. P. Berman, M. Karpinski, L. L. Larmore, W. Plandowski and W. Rytter, On the complexity of pattern matching for highly compressed two-dimensional texts, J. Comput. Syst. Sci. Int. 65 (2002), no. 2, 332-350.
12. A. Bertoni, C. Choffrut and R. Radicioni, Literal shuffle of compressed words, in: Proceeding of the 5th IFIP International Conference on Theoretical Computer Science (IFIP TCS 2008), Springer (2008), 87-100.
13. A. Bertoni, C. Choffrut and R. Radicioni, The inclusion problem of context-free languages: Some tractable cases, Int. J. Found. Comput. Sci. 22 (2011), no. 2, 289-299.
14. M. Bestvina and N. Brady, Morse theory and finiteness properties of groups, Invent. Math. 129 (1997), no. 3, 445-470.
15. P. Bille, G. M. Landau, R. Raman, K. Sadakane, S. R. Satti and O. Weimann, Random access to grammar-compressed strings, in: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), SIAM (2011), 373-389.
16. W. W. Boone, The word problem, Ann. of Math. (2) 70 (1959), 207-265.
17. I. Burmistrov and L. Khvorost, Straight-line programs: A practical test, in: Proceedings of the 1st International Conference on Data Compression, Communications and Processing (CCP 2011), IEEE (2011), 76-81.
18. G. Busatto, M. Lohrey and S. Maneth, Efficient memory representation of XML document trees, Information Systems 33 (2008), no. 4-5, 456-474.
19. F. B. Cannonito and R. W. Gatterdam, The word problem and power problem in 1-relator groups are primitive recursive, Pacific J. Math. 61 (1975), no. 2, 351-359.
20. A. G. Carles Creus and G. Godoy, One-context unification with STG-compressed terms is in NP, in: Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA 2012), Leibniz International Proceedings in Informatics (2012), 149-164.
21. H. Caussinus, P. McKenzie, D. Thérien and H. Vollmer, Nondeterministic NC1 computation, J. Comput. Syst. Sci. Int. 57 (1998), no. 2, 200-212.
22. P. Cégielski, I. Guessarian, Y. Lifshits and Y. Matiyasevich, Window subsequence problems for compressed texts, in: Proceedings of the International Computer Science Symposium in Russia (CSR 2006), Lecture Notes in Comput. Sci. 3967, Springer (2006), 127-136.
23. M. Charikar, E. Lehman, A. Lehman, D. Liu, R. Panigrahy, M. Prabhakaran, A. Sahai and A. Shelat, The smallest grammar problem, IEEE Trans. Inf. Theory 51 (2005), no. 7, 2554-2576.
24. S. Chen, E. Verbin and W. Yu, Data structure lower bounds on random access to grammar-compressed strings, technical report (2012), http://arxiv.org/abs/ 1203.1080.
25. F. Claude and G. Navarro, Improved grammar-based compressed indexes, technical report (2011), http://arxiv.org/abs/1110.4493.
26. F. Claude and G. Navarro, Self-indexed grammar-based compression, Fundam. Inform. 111 (2011), no. 3, 313-337.
27. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, C. Löding, S. Tison and M. Tommasi, Tree automata techniques and applications, preprint (2007), http://tata.gforge.inria.fr.
28. K. J. Compton and C. W. Henson, A uniform method for proving lower bounds on the computational complexity of logical theories, Ann. Pure Appl. Logic 48 (1990), 1-79.
29. J. Crisp and B.Wiest, Embeddings of graph braid and surface groups in right-angled artin groups and braid groups, Algebr. Geom. Topol. 4 (2004), 439-472.
30. M. Crochemore, G. M. Landau and M. Ziv-Ukelson, A subquadratic sequence alignment algorithm for unrestricted scoring matrices, SIAM J. Comput. 32 (2003), no. 6, 1654-1673.
31. M. Dehn, Über die Toplogie des dreidimensionalen Raumes, Math. Ann. 69 (1910), 137-168.
32. V. Diekert, Makanin's algorithm, in: Algebraic Combinatorics on Words, Cambridge University Press (2001), 342-390.
33. V. Diekert, J. Laun and A. Ushakov, Efficient algorithms for highly compressed data: The word problem in Higman's group is in P, in: Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012), Leibniz International Proceedings in Informatics 14 (2012), 218-229.
34. P. W. Dymond, Input-driven languages are in log n depth, Inform. Process. Lett. 26 (1988), no. 5, 247-250.
35. D. B. A. Epstein, J. W. Cannon, D. F. Holt, S. V. F. Levy, M. S. Paterson and W. P. Thurston, Word Processing in Groups, Jones and Bartlett, Boston, 1992.
36. J. Erickson and A. Nayyeri, Tracing compressed curves in triangulated surfaces, in: Proceedings of the 28th Symposium on Computational Geometry (SOCG 2012), ACM (2012), 131-140.
37. M. Farach and M. Thorup, String matching in Lempel-Ziv compressed strings, Algorithmica 20 (1998), no. 4, 388-404.
38. N. J. Fine and H. S. Wilf, Uniqueness theorems for periodic functions, Proc. Amer. Math. Soc. 16 (1965), 109-114.
39. T. Gagie, P. Gawrychowski, J. Kärkkäinen, Y. Nekrich and S. J. Puglisi, A faster grammar-based self-index, in: Proceedings of the 6th International Conference on Language and Automata Theory and Applications (LATA 2012), Lecture Notes in Comput. Sci. 7183, Springer (2012), 240-251.
40. A. Gascón, G. Godoy and M. Schmidt-Schauß, Unification and matching on compressed terms, ACM Trans. Comput. Log. 12 (2011), no. 4, article number 26.
41. L. Gasieniec, M. Karpinski, W. Plandowski and W. Rytter, Efficient algorithms for Lempel-Ziv encoding (extended abstract), in: Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT 1996), Lecture Notes in Comput. Sci. 1097, Springer (1996), 392-403.
42. L. Gasieniec, M. Karpinski, W. Plandowski and W. Rytter, Randomized efficient algorithms for compressed strings: The finger-print approach (extended abstract), in: Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching (CPM 1996), Lecture Notes in Comput. Sci. 1075, Springer (1996), 39-49.
43. P. Gawrychowski, Optimal pattern matching in LZW compressed strings, in: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), SIAM (2011), 362-372.
44. P. Gawrychowski, Pattern matching in Lempel-Ziv compressed strings: Fast, simple, and deterministic, in: Proceedings of the 19th Annual European Symposium on Algorithms (ESA 2011), Lecture Notes in Comput. Sci. 6942, Springer (2011), 421-432.
45. R. Ghrist and V. Peterson, The geometry and topology of reconfiguration, Adv. in Appl. Math. 38 (2007), no. 3, 302-323.
46. D. Giammarresi and A. Restivo, Two-dimensional languages, in: Handbook of Formal Languages, volume 3, Springer (1997), 216-267.
47. L. M. Goldschlager, "-productions in context-free grammars, Acta Inform. 16 (1981), 303-308.
48. K. Goto, H. Bannai, S. Inenaga and M. Takeda, Fast q-gram mining on SLP compressed strings, in: Proceedings of the 18th International Symposium on String Processing and Information Retrieval (SPIRE 2011), Lecture Notes in Comput. Sci. 7024, Springer (2011), 278-289.
49. K. Goto, H. Bannai, S. Inenaga and M. Takeda, Speeding-up q-gram mining on grammar-based compressed texts, technical report (2012), http://arxiv.org/ abs/1202.3311.
50. S. Greibach, The hardest context-free language, SIAM J. Comput. 2 (1973), no. 4, 304-310.
51. S. Gulwani and A. Tiwari, Computing procedure summaries for interprocedural analysis, in: Proceedings of the 16th European Symposium on Programming (ESOP 2007), Lecture Notes in Comput. Sci. 4421, Springer (2007), 253-267.
52. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge University Press, 1999.
53. C. Gutiérrez, Satisfiability of word equations with constants is in exponential space, in: Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS 1998), IEEE Computer Society Press (1998), 112-119.
54. C. Hagenah, Gleichungen mit regulären Randbedingungen über freien Gruppen, Ph.D. thesis, University of Stuttgart, Institut für Informatik, 2000.
55. F. Haglund and D. T. Wise, Coxeter groups are virtually special, Adv. Math. 224 (2010), no. 5, 1890-1903.
56. N. Haubold and M. Lohrey, Compressed word problems in HNN-extensions and amalgamated products, Theory Comput. Syst. 49 (2011), no. 2, 283-305.
57. N. Haubold, M. Lohrey and C. Mathissen, Compressed conjugacy and the word problem for outer automorphism groups of graph groups, in: Proceedings of Developments in Language Theory (DLT 2010), Lecture Notes in Comput. Sci. 6224, Springer (2010), 218-230. Long version in Internat. J. Algebra Comput., to appear.
58. D. Hermelin, G. M. Landau, S. Landau and O. Weimann, Unified compressionbased acceleration of edit-distance computation, technical report (2010), http: //arxiv.org/abs/1004.1194.
59. U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer and K. W. Wagner, On the power of polynomial time bit-reductions, in: Proceedings of the 8th Annual Structure in Complexity Theory Conference, IEEE Computer Society Press (1993), 200-207.
60. Y. Hirshfeld, M. Jerrum and F. Moller, A polynomial algorithm for deciding bisimilarity of normed context-free processes, Theoret. Comput. Sci. 158 (1996), no. 1-2, 143-159.
61. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, 1979.
62. H. B. Hunt III, D. J. Rosenkrantz and T. G. Szymanski, On the equivalence, containment, and covering problems for the regular and context-free languages, J. Comput. Syst. Sci. 12 (1976), no. 2, 222-268.
63. O. H. Ibarra and S. Moran, Probabilistic algorithms for deciding equivalence of straight-line programs, J. ACM 30 (1983), no. 1, 217-228.
64. B. Jenner, P. McKenzie and D. Thérien, Logspace and logtime leaf languages, Inform. and Comput. 129 (1996), no. 1, 21-33.
65. A. Jez, Compressed membership for NFA (DFA) with compressed labels is in NP (P), in: Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012), Leibniz International Proceedings in Informatics 14 (2012), 136-147.
66. A. Jez, Faster fully compressed pattern matching by recompression, in: Proceedings of the 39th International Colloquium on Automata, Languages, and Programming (ICALP 2012), Lecture Notes in Comput. Sci. 7391, Springer (2012), 533-544.
67. A. Jez, Recompression: A simple and powerful technique for word equations, technical report (2012), http://arxiv.org/abs/1203.3705.
68. T. Jiang and B. Ravikumar, A note on the space complexity of some decision problems for finite automata, Inform. Process. Lett. 40 (1991), no. 1, 25-31.
69. E. Kaltofen, Greatest common divisors of polynomials given by straight-line programs, J. ACM 35 (1988), no. 1, 231-264.
70. I. Kapovich, A. Miasnikov, P. Schupp and V. Shpilrain, Generic-case complexity, decision problems in group theory, and random walks, J. Algebra 264 (2003), no. 2, 665-694.
71. H. J. Karloff and W. L. Ruzzo, The iterated mod problem, Inform. and Comput. 80 (1989), no. 3, 193-204.
72. M. Karpinski, W. Rytter and A. Shinohara, Pattern-matching for strings with short descriptions, in: Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching (CPM 1995), Lecture Notes in Comput. Sci. 937, Springer (1995), 205-214.
73. T. Kida, T. Matsumoto, Y. Shibata, M. Takeda, A. Shinohara and S. Arikawa, Collage system: A unifying framework for compressed pattern matching, Theoret. Comput. Sci. 1 (2003), no. 298, 253-272.
74. D. E. Knuth, J. H. Morris, Jr. and V. R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (1977), no. 2, 323-350.
75. N. Kobayashi, K. Matsuda and A. Shinohara, Functional programs as compressed data, in: Proceedings of the ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation (PEPM 2012), ACM (2012), 121-130.
76. D. Kozen, Lower bounds for natural proof systems, in: Proceedings of the 18th Annual Symposium on Foundations of Computer Science (FOCS 1977), IEEE Computer Society Press (1977), 254-266.
77. N. J. Larsson and A. Moffat, Offline dictionary-based compression, in: Proceedings of the Data Compression Conference (DCC 1999), IEEE Computer Society Press (1999), 296-305.
78. S. Lasota and W. Rytter, Faster algorithm for bisimulation equivalence of normed context-free processes, in: Proceedings of the 31th International Symposium on Mathematical Foundations of Computer Science (MFCS 2006), Lecture Notes in Comput. Sci. 4162, Springer (2006), 646-657.
79. J. Levy, M. Schmidt-Schauß and M. Villaret, The complexity of monadic secondorder unification, SIAM J. Comput. 38 (2008), no. 3, 1113-1140.
80. Y. Lifshits, Processing compressed texts: A tractability border, in: B. Ma and K. Zhang, editors, Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007), Lecture Notes in Comput. Sci. 4580, Springer (2007), 228-240.
81. Y. Lifshits and M. Lohrey, Querying and embedding compressed texts, in: Proceedings of the 31th International Symposium on Mathematical Foundations of Computer Science (MFCS 2006), Lecture Notes in Comput. Sci. 4162, Springer (2006), 681-692.
82. Y. Lifshits, S. Mozes, O.Weimann and M. Ziv-Ukelson, Speeding up HMM decoding and training by exploiting sequence repetitions, Algorithmica 54 (2009), no. 3, 379-399.
83. R. J. Lipton and Y. Zalcstein, Word problems solvable in logspace, J. ACM 24 (1977), no. 3, 522-526.
84. M. Lohrey,Word problems and membership problems on compressed words, SIAM J. Comput. 35 (2006), no. 5, 1210-1240.
85. M. Lohrey, Compressed membership problems for regular expressions and hierarchical automata, Internat. J. Found. Comput. Sci. 21 (2010), no. 5, 817-841.
86. M. Lohrey, Compressed word problems for inverse monoids, in: Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS 2011), Lecture Notes in Comput. Sci. 6907, Springer (2011), 448-459.
87. M. Lohrey, Leaf languages and string compression, Inform. and Comput. 209 (2011), no. 6, 951-965.
88. M. Lohrey, Model-checking hierarchical structures, J. Comput. Syst. Sci. Int. 78 (2012), no. 2, 461-490.
89. M. Lohrey and S. Maneth, The complexity of tree automata and XPath on grammarcompressed trees, Theoret. Comput. Sci. 363 (2006), no. 2, 196-210.
90. M. Lohrey, S. Maneth and R. Mennicke, Tree structure compression with repair, in: Proceedings of the Data Compression Conference (DCC 2011), IEEE Computer Society (2011), 353-362.
91. M. Lohrey, S. Maneth and M. Schmidt-Schauß, Parameter reduction and automata evaluation for grammar-compressed trees, J. Comput. System Sci. 78 (2012), no. 5, 1651-1669.
92. M. Lohrey and C. Mathissen, Compressed membership in automata with compressed labels, in: Proceedings of the 6th International Computer Science Symposium in Russia (CSR 2011), Lecture Notes in Comput. Sci. 6651, Springer (2011), 275-288.
93. M. Lohrey and C. Mathissen, Isomorphism of regular trees and words, in: Proceeding of the 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), Lecture Notes in Comput. Sci. 6756, Springer (2011), 210-221.
94. M. Lohrey and S. Schleimer, Efficient computation in groups via compression, in: Proceedings of Computer Science in Russia (CSR 2007), Lecture Notes in Comput. Sci. 4649, Springer (2007), 249-258.
95. R. C. Lyndon and P. E. Schupp, Combinatorial Group Theory, Springer, 1977.
96. J. Macdonald, Compressed words and automorphisms in fully residually free groups, Internat. J. Algebra Comput. 20 (2010), no. 3, 343-355.
97. G. S. Makanin, The problem of solvability of equations in a free semigroup (in Russian), Math. Sbornik 103 (1977), 147-236; translation in Math. USSR Sbornik 32 (1977), 129-198.
98. N. Markey and P. Schnoebelen, Model checking a path, in: Proceedings of the 14th International Conference on Concurrency Theory (CONCUR 2003), Lecture Notes in Comput. Sci. 2761, Springer (2003), 248-262.
99. N. Markey and P. Schnoebelen, A PTIME-complete matching problem for SLPcompressed words, Inform. Process. Lett. 90 (2004), no. 1, 3-6.
100. S. Maruyama, M. Takeda, M. Nakahara and H. Sakamoto, An online algorithm for lightweight grammar-based compression, in: Proceedings of the 1st International Conference on Data Compression, Communications and Processing (CCP 2011), IEEE (2011), 19-28.
101. S. Maruyama, Y. Tanaka, H. Sakamoto and M. Takeda, Context-sensitive grammar transform: Compression and pattern matching, in: Proceedings of the 15th International Symposium on String Processing and Information Retrieval (SPIRE 2008), Lecture Notes in Comput. Sci. 5280, Springer (2008), 27-38.
102. W. Matsubara, S. Inenaga, A. Ishino, A. Shinohara, T. Nakamura and K. Hashimoto, Efficient algorithms to compute compressed longest common substrings and compressed palindromes, Theoret. Comput. Sci. 410 (2009), no. 8-10, 900-913.
103. A. J. Mayer and L. J. Stockmeyer, The complexity of word problems-This time with interleaving, Inform. and Comput. 115 (1994), no. 2, 293-311.
104. K. Mehlhorn, R. Sundar and C. Uhrig, Maintaining dynamic sequences under equality tests in polylogarithmic time, Algorithmica 17 (1997), no. 2, 183-198.
105. M. Miyazaki, A. Shinohara and M. Takeda, An improved pattern matching algorithm for strings in terms of straight-line programs, in: Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching (CPM 1997), Lecture Notes in Comput. Sci. 1264, Springer (1997), 1-11.
106. A. G. Myasnikov, A. Ushakov and D.W.Won, Power circuits, exponential algebra, and time complexity, Internat. J. Algebra Comput. 22 (2012), no. 6, 1-51.
107. M.-J. Nederhof and G. Satta, The language intersection problem for non-recursive context-free grammars, Inform. and Comput. 192 (2004), no. 2, 172-184.
108. P. S. Novikov, On the algorithmic unsolvability of the word problem in group theory, Amer. Math. Soc. Transl. Ser. 2 9 (1958), 1-122.
109. C. H. Papadimitriou, Computational Complexity, Addison Wesley, 1994.
110. H. Petersen, The membership problem for regular expressions with intersection is complete in LOGCFL, in: Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2002), Lecture Notes in Comput. Sci. 2285, Springer (2002), 513-522.
111. W. Plandowski, Testing equivalence of morphisms on context-free languages, in: Proceedings of the 2nd Annual European Symposium on Algorithms (ESA 1994), Lecture Notes in Comput. Sci. 855, Springer (1994), 460-470.
112. W. Plandowski, Satisfiability of word equations with constants is in PSPACE, J. ACM 51 (2004), no. 3, 483-496.
113. W. Plandowski and W. Rytter, Application of Lempel-Ziv encodings to the solution of word equations, in: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP 1998), Lecture Notes in Comput. Sci. 1443, Springer (1998), 731-742.
114. W. Plandowski and W. Rytter, Complexity of language recognition problems for compressed words, in: Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, Springer (1999), 262-272.
115. R. Radicioni and A. Bertoni, Grammatical compression: Compressed equivalence and other problems, Discrete Math. Theor. Comput. Sci. 12 (2010), no. 4, 109-126.
116. D. Robinson, Parallel algorithms for group word problems, Ph.D. thesis, University of California, San Diego, 1993.
117. J. M. Robson and V. Diekert, On quadratic word equations, in: Proceedings of the16th Annual Symposium on Theoretical Aspects of Computer Science (STACS 1999), Lecture Notes in Comput. Sci. 1563, Springer (1999), 217-226.
118. W. Rytter, Application of Lempel-Ziv factorization to the approximation of grammar-based compression, Theoret. Comput. Sci. 302 (2003), no. 1-3, 211-222.
119. W. Rytter, Grammar compression, LZ-encodings, and string algorithms with implicit input, in: Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), Lecture Notes in Comput. Sci. 3142, Springer (2004), 15-27.
120. H. Sakamoto, A fully linear-time approximation algorithm for grammar-based compression, J. Discrete Algorithms 3 (2005), no. 2-4, 416-430.
121. M. Schaefer, E. Sedgwick and D. Štefankovic, Algorithms for normal curves and surfaces, in: Proceedings of the 8th Annual International Conference on Computing and Combinatorics (COCOON 2002), Lecture Notes in Comput. Sci. 2387, Springer (2002), 370-380.
122. M. Schaefer, E. Sedgwick and D. Štefankovic, Recognizing string graphs in NP, J. Comput. Syst. Sci. Int. 67 (2003), no. 2, 365-380.
123. M. Schaefer, E. Sedgwick and D. Štefankovic, Computing Dehn twists and geometric intersection numbers in polynomial time, in: Proceedings of the 20th Annual Canadian Conference on Computational Geometry (CCCG 2008), 111-114.
124. S. Schleimer, Polynomial-time word problems, Comment. Math. Helv. 83 (2008), no. 4, 741-765.
125. M. Schmidt-Schauß, Polynomial equality testing for terms with shared substructures, Technical Report 21, Institut für Informatik, J. W. Goethe-Universität Frankfurt am Main, 2005.
126. M. Schmidt-Schauß, Matching of compressed patterns with character-variables, in: Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA 2012), Leibniz International Proceedings in Informatics 15 (2012), 272-287.
127. M. Schmidt-Schauß, D. Sabel and A. Anis, Congruence closure of compressed terms in polynomial time, in: Proceedings of the 8th International Symposium on Frontiers of Combining Systems (FroCos 2011), Lecture Notes in Comput. Sci. 6989, Springer (2011), 227-242.
128. M. Schmidt-Schauß and G. Schnitger, Fast equality test for straight-line compressed strings, Inf. Process. Lett. 112 (2012), no. 8-9, 341-345.
129. H.-U. Simon, Word problems for groups and contextfree recognition, in: Proceedings of Fundamentals of Computation Theory (FCT 1979), Akademie-Verlag (1979), 417-422.
130. J. Stillwell, Classical Topology and Combinatorial Group Theory, 2nd ed., Springer, 1995.
131. I. H. Sudborough, On the tape complexity of deterministic context-free languages, J. ACM 25 (1978), no. 3, 405-414.
132. A. Tiskin, Faster subsequence recognition in compressed strings, J. Math. Sci. (N.Y.) 158 (2009), no. 5, 759-769.
133. A. Tiskin, Towards approximate matching in compressed strings: Local subsequence recognition, in: Proceedings of the 6th International Computer Science Symposium in Russia (CSR 2011), Lecture Notes in Comput. Sci. 6651, Springer (2011), 401-414.
134. S. Toda, PP is as hard as the polynomial-time hierarchy, SIAM J. Comput. 20 (1991), no. 5, 865-877.
135. A. Tozawa and Y. Minamide, Complexity results on balanced context-free languages, in: Proceedings of the 10th International Conference on Foundations of Software Science and Computational Structures (FOSSACS 2007), Lecture Notes in Comput. Sci. 4423, Springer (2007), 346-360.
136. V. Vassilevska Williams, Multiplying matrices faster than Coppersmith-Winograd, in: Proceedings of the 44th ACM Symposium on Theory of Computing (STOC 2012), ACM (2012), 887-898.
137. H. Venkateswaran, Properties that characterize LOGCFL, J. Comput. Syst. Sci. Int. 43 (1991), 380-404.
138. K. W. Wagner, The complexity of combinatorial problems with succinct input representation, Acta Inform. 23 (1986), no. 3, 325-356.
139. K. W. Wagner, Leaf language classes, in: Proceedings of the 4th International Conference on Machines, Computations, and Universality (MCU 2004), Lecture Notes in Comput. Sci. 3354, Springer (2005), 60-81.
140. M. K. Warmuth and D. Haussler, On the complexity of iterated shuffle, J. Comput. Syst. Sci. Int. 28 (1984), no. 3, 345-358.
141. D. T. Wise, Research announcement: The structure of groups with a quasiconvex hierarchy, Electron. Res. Announc.Math. Sci. 16 (2009), 44-55.
142. T. Yamamoto, H. Bannai, S. Inenaga and M. Takeda, Faster subsequence and don'tcare pattern matching on compressed texts, in: Proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), Lecture Notes in Comput. Sci. 6661, Springer (2011), 309-322.
143. A. C.-C. Yao, On the evaluation of powers, SIAM J. Comput. 5 (1976), no. 1, 100-103.
144. J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Trans. Inf. Theory 23 (1977), no. 3, 337-343.