{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T10:00:17Z","timestamp":1773223217376,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642293436","type":"print"},{"value":"9783642293443","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29344-3_21","type":"book-chapter","created":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T14:19:29Z","timestamp":1334067569000},"page":"243-254","source":"Crossref","is-referenced-by-count":4,"title":["Logspace Computations in Graph Groups and Coxeter Groups"],"prefix":"10.1007","author":[{"given":"Volker","family":"Diekert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Kausch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0020-0190(91)90224-6","volume":"38","author":"C. \u00c0lvarez","year":"1991","unstructured":"\u00c0lvarez, C., Gabarr\u00f3, J.: The parallel complexity of two problems on concurrency. Inform. Process. Lett.\u00a038, 61\u201370 (1991)","journal-title":"Inform. Process. Lett."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s002220050168","volume":"129","author":"M. Bestvina","year":"1997","unstructured":"Bestvina, M., Brady, N.: Morse theory and finiteness properties of groups. Invent. Math.\u00a0129, 445\u2013470 (1997)","journal-title":"Invent. Math."},{"key":"21_CR3","unstructured":"Bj\u00f6rner, A., Brenti, F.: Combinatorics of Coxeter groups. Springer (2005)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Book, R., Otto, F.: String-Rewriting Systems. Springer (1993)","DOI":"10.1007\/978-1-4613-9771-7"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01445101","volume":"296","author":"B. Brink","year":"1993","unstructured":"Brink, B., Howlett, R.B.: A finiteness property and an automatic structure for Coxeter groups. Math. Ann.\u00a0296, 179\u2013190 (1993)","journal-title":"Math. Ann."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Cai, J.-Y.: Parallel computation over hyperbolic groups. In: Proceedings STOC 1992, pp. 106\u2013115. ACM Press (1992)","DOI":"10.1145\/129712.129723"},{"key":"21_CR7","unstructured":"Casselman, W.A.: Automata to perform basic calculations in Coxeter groups. In: C.M.S. Conference Proceedings, vol.\u00a016 (1994)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Crisp, J., Godelle, E., Wiest, B.: The conjugacy problem in right-angled Artin groups and their subgroups. J.\u00a0Topol.\u00a02(3) (2009)","DOI":"10.1112\/jtopol\/jtp018"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"439","DOI":"10.2140\/agt.2004.4.439","volume":"4","author":"J. Crisp","year":"2004","unstructured":"Crisp, J., Wiest, B.: Embeddings of graph braid and surface groups in right-angled artin groups and braid groups. Algebr. Geom. Topol.\u00a04, 439\u2013472 (2004)","journal-title":"Algebr. Geom. Topol."},{"key":"21_CR10","unstructured":"Davis, M.W.: The geometry and topology of Coxeter groups. London Mathematical Society Monographs Series, vol.\u00a032. Princeton University Press (2008)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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_CR12","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/s00233-008-9060-x","volume":"77","author":"V. Diekert","year":"2008","unstructured":"Diekert, V., Lohrey, M., Miller, A.: Partially commutative inverse monoids. Semigroup Forum\u00a077, 196\u2013226 (2008)","journal-title":"Semigroup Forum"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1142\/S0218196706003372","volume":"16","author":"V. Diekert","year":"2006","unstructured":"Diekert, V., Muscholl, A.: Solvability of equations in free partially commutative groups is decidable. Internat. J. Algebra Comput.\u00a016, 1047\u20131070 (2006); Journal version of ICALP 2001. LNCS, vol. 2076, pp. 543\u2013554 (2001)","journal-title":"Internat. J. Algebra Comput."},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1090\/S0002-9939-1993-1160298-8","volume":"119","author":"C. Droms","year":"1993","unstructured":"Droms, C., Lewin, J., Servatius, H.: The length of elements in free solvable groups. Proc. Amer. Math. Soc.\u00a0119, 27\u201333 (1993)","journal-title":"Proc. Amer. Math. Soc."},{"key":"21_CR15","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1215\/ijm\/1299679740","volume":"54","author":"M. Elder","year":"2010","unstructured":"Elder, M.: A linear-time algorithm to compute geodesics in solvable Baumslag-solitar groups. Illinois J. Math.\u00a054, 109\u2013128 (2010)","journal-title":"Illinois J. Math."},{"key":"21_CR16","volume-title":"On groups that have normal forms computable in logspace","author":"M. Elder","year":"2011","unstructured":"Elder, M., Elston, G., Ostheimer, G.: On groups that have normal forms computable in logspace. AMS Sectional Meeting, Las Vegas (2011) (paper in preparation)"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1515\/gcc.2010.014","volume":"2","author":"M. Elder","year":"2010","unstructured":"Elder, M., Rechnitzer, A.: Some geodesic problems in groups. Groups. Complexity. Cryptology\u00a02, 223\u2013229 (2010)","journal-title":"Groups. Complexity. Cryptology"},{"key":"21_CR18","doi-asserted-by":"crossref","DOI":"10.1201\/9781439865699","volume-title":"Word Processing in Groups","author":"D.B.A. Epstein","year":"1992","unstructured":"Epstein, D.B.A., Cannon, J.W., Holt, D.F., Levy, S.V.F., Paterson, M.S., Thurston, W.P.: Word Processing in Groups. Jones and Bartlett, Boston (1992)"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.aam.2005.08.009","volume":"38","author":"R. Ghrist","year":"2007","unstructured":"Ghrist, R., Peterson, V.: The geometry and topology of reconfiguration. Adv. in Appl. Math.\u00a038, 302\u2013323 (2007)","journal-title":"Adv. in Appl. Math."},{"issue":"2","key":"21_CR20","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1307\/mmj\/1030132408","volume":"46","author":"T. Hsu","year":"1999","unstructured":"Hsu, T., Wise, D.T.: On linear and residual properties of graph products. Michigan Mathematical Journal\u00a046(2), 251\u2013259 (1999)","journal-title":"Michigan Mathematical Journal"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Lawson, M.V.: Inverse Semigroups: The Theory of Partial Symmetries. World Scientific (1999)","DOI":"10.1142\/9789812816689"},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1145\/322017.322031","volume":"24","author":"R.J. Lipton","year":"1977","unstructured":"Lipton, R.J., Zalcstein, Y.: Word problems solvable in logspace. J. Assoc. Comput. Mach.\u00a024, 522\u2013526 (1977)","journal-title":"J. Assoc. Comput. Mach."},{"key":"21_CR23","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1142\/S0129054105003248","volume":"16","author":"M. Lohrey","year":"2005","unstructured":"Lohrey, M.: Decidability and complexity in automatic monoids. Internat. J. Found. Comput. Sci.\u00a016, 707\u2013722 (2005)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"21_CR24","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1016\/j.ic.2007.01.002","volume":"205","author":"M. Lohrey","year":"2007","unstructured":"Lohrey, M., Ondrusch, N.: Inverse monoids: Decidability and complexity of algebraic questions. Inf. Comput.\u00a0205, 1212\u20131234 (2007)","journal-title":"Inf. Comput."},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Miller III, C.F.: Decision problems for groups \u2013 survey and reflections. In: Algorithms and Classification in Combinatorial Group Theory, pp. 1\u201360. Springer (1992)","DOI":"10.1007\/978-1-4613-9730-4_1"},{"key":"21_CR26","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1112\/plms\/s3-29.3.385","volume":"29","author":"W. Munn","year":"1974","unstructured":"Munn, W.: Free inverse semigroups. Proc. London Math. Soc.\u00a029, 385\u2013404 (1974)","journal-title":"Proc. London Math. Soc."},{"key":"21_CR27","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1090\/S0002-9947-10-04959-7","volume":"362","author":"A. Myasnikov","year":"2010","unstructured":"Myasnikov, A., Roman\u2019kov, V., Ushakov, A., Vershik, A.: The word and geodesic problems in free solvable groups. Trans. Amer. Math. Soc.\u00a0362, 4655\u20134682 (2010)","journal-title":"Trans. Amer. Math. Soc."},{"key":"21_CR28","unstructured":"Papadimitriou, C.: Computation Complexity. Addison-Wesley (1994)"},{"key":"21_CR29","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0196-6774(91)90011-M","volume":"12","author":"M. Paterson","year":"1991","unstructured":"Paterson, M., Razborov, A.: The set of minimal braids is co-NP-complete. J. Algorithms\u00a012, 393\u2013408 (1991)","journal-title":"J. Algorithms"},{"key":"21_CR30","unstructured":"Simon, H.-U.: Word problems for groups and contextfree recognition. In: Proceedings FCT 1979, pp. 417\u2013422. Akademie-Verlag (1979)"},{"key":"21_CR31","unstructured":"Veloso da Costa, A.A.: \u0393-Produtos de Mon\u00f3ides e Semigrupos. PhD thesis, Universidade do Porto, Faculdade de Ci\u00eancias (2003)"},{"key":"21_CR32","series-title":"LNCS","first-page":"467","volume-title":"FCT 1981","author":"S. Waack","year":"1981","unstructured":"Waack, S.: Tape Complexity of Word Problems. In: FCT 1981. LNCS, vol.\u00a0117, pp. 467\u2013471. Springer, Heidelberg (1981)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2012: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29344-3_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:35:32Z","timestamp":1620128132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29344-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642293436","9783642293443"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29344-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}