{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:21:18Z","timestamp":1726410078472},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642144547"},{"type":"electronic","value":"9783642144554"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14455-4_21","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T15:06:02Z","timestamp":1281711962000},"page":"218-230","source":"Crossref","is-referenced-by-count":0,"title":["Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups"],"prefix":"10.1007","author":[{"given":"Niko","family":"Haubold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Mathissen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10711-007-9148-6","volume":"125","author":"R. Charney","year":"2007","unstructured":"Charney, R.: An introduction to right-angled Artin groups. Geometriae Dedicata\u00a0125, 141\u2013158 (2007)","journal-title":"Geometriae Dedicata"},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1052","volume":"106","author":"R. Cori","year":"1993","unstructured":"Cori, R., M\u00e9tivier, Y., Zielonka, W.: Asynchronous mappings and asynchronous cellular automata. Information and Computation\u00a0106(2), 159\u2013202 (1993)","journal-title":"Information and Computation"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Crisp, J., Godelle, E., Wiest, B.: The conjugacy problem in right-angled Artin groups and their subgroups. Journal of Topology\u00a02(3) (2009)","DOI":"10.1112\/jtopol\/jtp018"},{"issue":"2","key":"21_CR4","doi-asserted-by":"publisher","first-page":"817","DOI":"10.2140\/gt.2009.13.817","volume":"13","author":"M.B. Day","year":"2009","unstructured":"Day, M.B.: Peak reduction and finite presentations for automorphism groups of right-angled Artin groups. Geometry & Topology\u00a013(2), 817\u2013855 (2009)","journal-title":"Geometry & Topology"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-53031-2","volume-title":"Combinatorics on Traces","author":"V. Diekert","year":"1990","unstructured":"Diekert, V.: Combinatorics on Traces. LNCS, vol.\u00a0454. Springer, Heidelberg (1990)"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-61422-2_148","volume-title":"Algorithm Theory - SWAT \u201996","author":"L. Gasieniec","year":"1996","unstructured":"Gasieniec, L., Karpinski, M., Plandowski, W., Rytter, W.: Efficient algorithms for Lempel-Ziv encoding. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol.\u00a01097, pp. 392\u2013403. Springer, Heidelberg (1996)"},{"issue":"4","key":"21_CR7","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/s00224-007-9054-1","volume":"42","author":"B. Genest","year":"2008","unstructured":"Genest, B., Muscholl, A.: Pattern matching and membership for hierarchical message sequence charts. Theory of Computing Systems\u00a042(4), 536\u2013567 (2008)","journal-title":"Theory of Computing Systems"},{"key":"21_CR8","unstructured":"Hagenah, C.: Gleichungen mit regul\u00e4ren Randbedingungen \u00fcber freien Gruppen. PhD thesis, University of Stuttgart, Institut f\u00fcr Informatik (2000)"},{"key":"21_CR9","unstructured":"Haubold, N., Lohrey, M., Mathissen, C.: Compressed conjugacy and the word problem for outer automorphism groups of graph groups (2010), http:\/\/arxiv.org\/abs\/1003.1233"},{"issue":"2","key":"21_CR10","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1112\/jlms\/52.2.318","volume":"52","author":"M.R. Laurence","year":"1995","unstructured":"Laurence, M.R.: A generating set for the automorphism group of a graph group. Journal of the London Mathematical Society. Second Series\u00a052(2), 318\u2013334 (1995)","journal-title":"Journal of the London Mathematical Society. Second Series"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-540-73437-6_24","volume-title":"Combinatorial Pattern Matching","author":"Y. Lifshits","year":"2007","unstructured":"Lifshits, Y.: Processing compressed texts: A tractability border. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol.\u00a04580, pp. 228\u2013240. Springer, Heidelberg (2007)"},{"issue":"2","key":"21_CR12","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/0890-5401(90)90010-F","volume":"89","author":"H.-N. Liu","year":"1990","unstructured":"Liu, H.-N., Wrathall, C., Zeger, K.: Efficient solution to some problems in free partially commutative monoids. Information and Computation\u00a089(2), 180\u2013198 (1990)","journal-title":"Information and Computation"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-540-74510-5_26","volume-title":"Computer Science \u2013 Theory and Applications","author":"M. Lohrey","year":"2007","unstructured":"Lohrey, M., Schleimer, S.: Efficient computation in groups via compression. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds.) CSR 2007. LNCS, vol.\u00a04649, pp. 249\u2013258. Springer, Heidelberg (2007)"},{"key":"21_CR14","volume-title":"Combinatorial Group Theory","author":"R.C. Lyndon","year":"1977","unstructured":"Lyndon, R.C., Schupp, P.E.: Combinatorial Group Theory. Springer, Heidelberg (1977)"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Macdonald, J.: Compressed words and automorphisms in fully residually free groups. International Journal of Algebra and Computation (2009) (to appear)","DOI":"10.1142\/S021819671000542X"},{"key":"21_CR16","volume-title":"Group-based Cryptography","author":"A. Myasnikov","year":"2008","unstructured":"Myasnikov, A., Shpilrain, V., Ushakov, A.: Group-based Cryptography. Birkh\u00e4user, Basel (2008)"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/BFb0049431","volume-title":"Algorithms - ESA \u201994","author":"W. Plandowski","year":"1994","unstructured":"Plandowski, W.: Testing equivalence of morphisms on context-free languages. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 460\u2013470. Springer, Heidelberg (1994)"},{"issue":"4","key":"21_CR18","doi-asserted-by":"publisher","first-page":"741","DOI":"10.4171\/CMH\/142","volume":"83","author":"S. Schleimer","year":"2008","unstructured":"Schleimer, S.: Polynomial-time word problems. Commentarii Mathematici Helvetici\u00a083(4), 741\u2013765 (2008)","journal-title":"Commentarii Mathematici Helvetici"},{"issue":"1","key":"21_CR19","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/0021-8693(89)90319-0","volume":"126","author":"H. Servatius","year":"1989","unstructured":"Servatius, H.: Automorphisms of graph groups. Journal of Algebra\u00a0126(1), 34\u201360 (1989)","journal-title":"Journal of Algebra"},{"issue":"1","key":"21_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0747-7171(88)80024-5","volume":"6","author":"C. Wrathall","year":"1988","unstructured":"Wrathall, C.: The word problem for free partially commutative groups. Journal of Symbolic Computation\u00a06(1), 99\u2013104 (1988)","journal-title":"Journal of Symbolic Computation"},{"key":"21_CR21","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-94-009-2411-6_10","volume-title":"Combinatorics, Computing and Complexity","author":"C. Wrathall","year":"1989","unstructured":"Wrathall, C.: Free partially commutative groups. In: Combinatorics, Computing and Complexity, pp. 195\u2013216. Kluwer Academic Press, Dordrecht (1989)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14455-4_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:52:57Z","timestamp":1606186377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14455-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144547","9783642144554"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14455-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}