-
1
-
-
48249130049
-
Literal shuffle of compressed words
-
Berlin: Springer
-
Bertoni, A., Choffrut, C., Radicioni, R.: Literal shuffle of compressed words. In: Proceeding of the 5th IFIP International Conference on Theoretical Computer Science (IFIP TCS 2008), Milan (Italy), pp. 87-100. Springer, Berlin (2008).
-
(2008)
Proceeding of the 5th IFIP International Conference on Theoretical Computer Science
, pp. 87-100
-
-
Bertoni, A.1
Choffrut, C.2
Radicioni, R.3
-
2
-
-
0011994346
-
The word problem
-
Boone, W. W.: The word problem. Ann. Math. (2) 70, 207-265 (1959).
-
(1959)
Ann. Math. (2)
, vol.70
, pp. 207-265
-
-
Boone, W.W.1
-
3
-
-
0000376243
-
Über die Toplogie des dreidimensionalen Raumes
-
In German
-
Dehn, M.: Über die Toplogie des dreidimensionalen Raumes. Math. Ann. 69, 137-168 (1910). In German.
-
(1910)
Math. Ann
, vol.69
, pp. 137-168
-
-
Dehn, M.1
-
5
-
-
0002268911
-
Efficient algorithms for Lempel-Ziv encoding (extended abstract)
-
Lecture Notes in Computer Science, R. G. Karlsson and A. Lingas (Eds.), Berlin: Springer (SWAT 1996), Reykjavík (Iceland)
-
Gasieniec, L., Karpinski, M., Plandowski, W., Rytter, W.: Efficient algorithms for Lempel-Ziv encoding (extended abstract). In: Karlsson, R. G., Lingas, A. (eds.) Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT 1996), Reykjavík (Iceland). Lecture Notes in Computer Science, vol. 1097, pp. 392-403. Springer, Berlin (1996).
-
(1996)
Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
, vol.1097
, pp. 392-403
-
-
Gasieniec, L.1
Karpinski, M.2
Plandowski, W.3
Rytter, W.4
-
6
-
-
26444585152
-
Gleichungen mit regulären Randbedingungen über freien Gruppen
-
University of Stuttgart, Institut für Informatik
-
Hagenah, C.: Gleichungen mit regulären Randbedingungen über freien Gruppen. PhD thesis, University of Stuttgart, Institut für Informatik (2000).
-
(2000)
PhD thesis
-
-
Hagenah, C.1
-
7
-
-
84962995482
-
Embedding theorems for groups
-
Higman, G., Neumann, B. H., Neumann, H.: Embedding theorems for groups. J. Lond. Math. Soc. (2) 24, 247-254 (1949).
-
(1949)
J. Lond. Math. Soc. (2)
, vol.24
, pp. 247-254
-
-
Higman, G.1
Neumann, B.H.2
Neumann, H.3
-
8
-
-
84963078749
-
Embedding theorems for semigroups
-
Howie, J. M.: Embedding theorems for semigroups. Q. J. Math. Oxford (2) 14, 254-258 (1963).
-
(1963)
Q. J. Math. Oxford (2)
, vol.14
, pp. 254-258
-
-
Howie, J.M.1
-
9
-
-
0037673298
-
Generic-case complexity, decision problems in group theory, and random walks
-
Kapovich, I., Myasnikov, A., Schupp, P., Shpilrain, V.: Generic-case complexity, decision problems in group theory, and random walks. J. Algebra 264(2), 665-694 (2003).
-
(2003)
J. Algebra
, vol.264
, Issue.2
, pp. 665-694
-
-
Kapovich, I.1
Myasnikov, A.2
Schupp, P.3
Shpilrain, V.4
-
10
-
-
37849000545
-
Processing compressed texts: A tractability border
-
Lecture Notes in Computer Science, B. Ma and K. Zhang (Eds.), Berlin: Springer (CPM 2007), London (Canada)
-
Lifshits, Y.: Processing compressed texts: A tractability border. In: Ma, B., Zhang, K. (eds.) Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007), London (Canada). Lecture Notes in Computer Science, vol. 4580. Springer, Berlin (2007).
-
(2007)
Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching
, vol.4580
-
-
Lifshits, Y.1
-
11
-
-
33749260063
-
Word problems and membership problems on compressed words
-
Lohrey, M.: Word problems and membership problems on compressed words. SIAM J. Comput. 35(5), 1210-1240 (2006).
-
(2006)
SIAM J. Comput
, vol.35
, Issue.5
, pp. 1210-1240
-
-
Lohrey, M.1
-
12
-
-
37249046440
-
Efficient computation in groups via compression
-
Lecture Notes in Computer Science, Berlin: Springer (CSR 2007), Ekaterinburg (Russia)
-
Lohrey, M., Schleimer, S.: Efficient computation in groups via compression. In: Proceedings of Computer Science in Russia (CSR 2007), Ekaterinburg (Russia). Lecture Notes in Computer Science, vol. 4649, pp. 249-258. Springer, Berlin (2007).
-
(2007)
Proceedings of Computer Science in Russia
, vol.4649
, pp. 249-258
-
-
Lohrey, M.1
Schleimer, S.2
-
13
-
-
33746354638
-
Theories of HNN-extensions and amalgamated products
-
Lecture Notes in Computer Science, M. Bugliesi, B. Preneel, V. Sassone, and I. Wegener (Eds.), Berlin: Springer (ICALP 2006), Venice (Italy)
-
Lohrey, M., Sénizergues, G.: Theories of HNN-extensions and amalgamated products. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) Proceedings of the 33st International Colloquium on Automata, Languages and Programming (ICALP 2006), Venice (Italy). Lecture Notes in Computer Science, vol. 4052, pp. 681-692. Springer, Berlin (2006).
-
(2006)
Proceedings of the 33st International Colloquium on Automata, Languages and Programming
, vol.4052
, pp. 681-692
-
-
Lohrey, M.1
Sénizergues, G.2
-
14
-
-
44249087431
-
Rational subsets in HNN-extensions and amalgamated products
-
Lohrey, M., Sénizergues, G.: Rational subsets in HNN-extensions and amalgamated products. Int. J. Algebra Comput. 18(1), 111-163 (2008).
-
(2008)
Int. J. Algebra Comput
, vol.18
, Issue.1
, pp. 111-163
-
-
Lohrey, M.1
Sénizergues, G.2
-
16
-
-
77953771005
-
Compressed words and automorphisms in fully residually free groups
-
Macdonald, J.: Compressed words and automorphisms in fully residually free groups. Int. J. Algebra Comput. 20(3), 343-355 (2010).
-
(2010)
Int. J. Algebra Comput
, vol.20
, Issue.3
, pp. 343-355
-
-
Macdonald, J.1
-
17
-
-
84948958591
-
An improved pattern matching algorithm for strings in terms of straight-line programs
-
Lecture Notes in Computer Science, A. Apostolico and J. Hein (Eds.), Berlin: Springer (CPM 97), Aarhus (Denmark)
-
Miyazaki, M., Shinohara, A., Takeda, M.: An improved pattern matching algorithm for strings in terms of straight-line programs. In: Apostolico, A., Hein, J. (eds.) Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching (CPM 97), Aarhus (Denmark). Lecture Notes in Computer Science, pp. 1-11. Springer, Berlin (1997).
-
(1997)
Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
, pp. 1-11
-
-
Miyazaki, M.1
Shinohara, A.2
Takeda, M.3
-
19
-
-
2642531180
-
On the algorithmic unsolvability of the word problem in group theory
-
Novikov, P. S.: On the algorithmic unsolvability of the word problem in group theory. Trans. Am. Math. Soc. II. Ser. 9, 1-122 (1958).
-
(1958)
Trans. Am. Math. Soc. II. Ser
, vol.9
, pp. 1-122
-
-
Novikov, P.S.1
-
20
-
-
85016671597
-
Testing equivalence of morphisms on context-free languages
-
Lecture Notes in Computer Science, J. Leeuwenvan (Ed.), Berlin: Springer (ESA'94), Utrecht (The Netherlands)
-
Plandowski, W.: Testing equivalence of morphisms on context-free languages. In: van Leeuwen, J. (ed.) Second Annual European Symposium on Algorithms (ESA'94), Utrecht (The Netherlands). Lecture Notes in Computer Science, vol. 855, pp. 460-470. Springer, Berlin (1994).
-
(1994)
Second Annual European Symposium on Algorithms
, vol.855
, pp. 460-470
-
-
Plandowski, W.1
-
21
-
-
84878620266
-
Application of Lempel-Ziv encodings to the solution of word equations
-
Lecture Notes in Computer Science, Berlin: Springer (ICALP 1998)
-
Plandowski, W., Rytter, W.: 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 Computer Science, vol. 1443, pp. 731-742. Springer, Berlin (1998).
-
(1998)
Proceedings of the 25th International Colloquium on Automata, Languages and Programming
, vol.1443
, pp. 731-742
-
-
Plandowski, W.1
Rytter, W.2
-
22
-
-
1442357683
-
Complexity of language recognition problems for compressed words
-
J. Karhumäki, H. A. Maurer, G. Paun, and G. Rozenberg (Eds.), Berlin: Springer
-
Plandowski, W., Rytter, W.: Complexity of language recognition problems for compressed words. In: Karhumäki, J., Maurer, H. A., Paun, G., Rozenberg, G. (eds.) Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pp. 262-272. Springer, Berlin (1999).
-
(1999)
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
, pp. 262-272
-
-
Plandowski, W.1
Rytter, W.2
-
23
-
-
55349141807
-
Polynomial-time word problems
-
Schleimer, S.: Polynomial-time word problems. Comment. Math. Helv. 83(4), 741-765 (2008).
-
(2008)
Comment. Math. Helv
, vol.83
, Issue.4
, pp. 741-765
-
-
Schleimer, S.1
|