{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:15:03Z","timestamp":1726409703230},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033506"},{"type":"electronic","value":"9783642033513"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03351-3_23","type":"book-chapter","created":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T12:53:58Z","timestamp":1249304038000},"page":"237-249","source":"Crossref","is-referenced-by-count":0,"title":["Compressed Word Problems in HNN-Extensions and Amalgamated Products"],"prefix":"10.1007","author":[{"given":"Niko","family":"Haubold","sequence":"first","affiliation":[]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-0-387-09680-3_6","volume-title":"Proceeding of the 5th IFIP International Conference on Theoretical Computer Science (IFIP TCS 2008)","author":"A. Bertoni","year":"2008","unstructured":"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), Milano (Italy), pp. 87\u2013100. Springer, Heidelberg (2008)"},{"key":"23_CR2","volume-title":"Groups Acting on Graphs","author":"W. Dicks","year":"1989","unstructured":"Dicks, W., Dunwoody, M.J.: Groups Acting on Graphs. Cambridge University Press, Cambridge (1989)"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1112\/jlms\/s1-24.4.247","volume":"24","author":"G. Higman","year":"1949","unstructured":"Higman, G., Neumann, B.H., Neumann, H.: Embedding theorems for groups. Journal of the London Mathematical Society. Second Series\u00a024, 247\u2013254 (1949)","journal-title":"Journal of the London Mathematical Society. Second Series"},{"key":"23_CR4","unstructured":"Haubold, N., Lohrey, M.: Compressed word problems in HNN-extensions and amalgamated products. arXiv.org (2008), \n                    \n                      http:\/\/arxiv.org\/abs\/0811.3303"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1093\/qmath\/14.1.254","volume":"14","author":"J.M. Howie","year":"1963","unstructured":"Howie, J.M.: Embedding theorems for semigroups. Quart. J. Math. Oxford Ser. (2)\u00a014, 254\u2013258 (1963)","journal-title":"Quart. J. Math. Oxford Ser. (2)"},{"issue":"2","key":"23_CR6","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/S0021-8693(03)00167-4","volume":"264","author":"I. Kapovich","year":"2003","unstructured":"Kapovich, I., Myasnikov, A., Schupp, P., Shpilrain, V.: Generic-case complexity, decision problems in group theory, and random walks. J. Algebra\u00a0264(2), 665\u2013694 (2003)","journal-title":"J. Algebra"},{"issue":"5","key":"23_CR7","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1137\/S0097539704445950","volume":"35","author":"M. Lohrey","year":"2006","unstructured":"Lohrey, M.: Word problems and membership problems on compressed words. SIAM J. Comput.\u00a035(5), 1210\u20131240 (2006)","journal-title":"SIAM J. Comput."},{"key":"23_CR8","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":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/11787006_43","volume-title":"Automata, Languages and Programming","author":"M. Lohrey","year":"2006","unstructured":"Lohrey, M., S\u00e9nizergues, G.: Theories of HNN-extensions and amalgamated products. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 504\u2013515. Springer, Heidelberg (2006)"},{"issue":"1","key":"23_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1142\/S021819670800438X","volume":"18","author":"M. Lohrey","year":"2008","unstructured":"Lohrey, M., S\u00e9nizergues, G.: Rational subsets in HNN-extensions and amalgamated products. Internat. J. Algebra Comput.\u00a018(1), 111\u2013163 (2008)","journal-title":"Internat. J. Algebra Comput."},{"key":"23_CR11","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":"23_CR12","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":"23_CR13","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)"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-60207-8_23","volume-title":"Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa","author":"W. Plandowski","year":"1999","unstructured":"Plandowski, W., Rytter, W.: Complexity of language recognition problems for compressed words. In: Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pp. 262\u2013272. Springer, Heidelberg (1999)"},{"issue":"4","key":"23_CR15","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. Comment. Math. Helv.\u00a083(4), 741\u2013765 (2008)","journal-title":"Comment. Math. Helv."},{"key":"23_CR16","unstructured":"Stallings, J.R.: Group Theory and Three-Dimensional Manifolds. Yale Mathematical Monographs, No.\u00a04. Yale University Press (1971)"}],"container-title":["Lecture Notes in Computer Science","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03351-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T08:00:15Z","timestamp":1552118415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03351-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033506","9783642033513"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03351-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}