{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,26]],"date-time":"2023-12-26T19:27:23Z","timestamp":1703618843799},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,10,10]],"date-time":"2013-10-10T00:00:00Z","timestamp":1381363200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s00224-013-9509-5","type":"journal-article","created":{"date-parts":[[2013,10,9]],"date-time":"2013-10-09T06:46:11Z","timestamp":1381301171000},"page":"742-770","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Algorithms for Highly Compressed Data: The Word Problem in Generalized Higman Groups Is in P"],"prefix":"10.1007","volume":"55","author":[{"given":"J\u00fcrn","family":"Laun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,10]]},"reference":[{"issue":"2","key":"9509_CR1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.4153\/CJM-2011-062-8","volume":"64","author":"D. Allcock","year":"2012","unstructured":"Allcock, D.: Triangles of baumslag-solitar groups. Can. J. Math. 64(2), 241\u2013253 (2012)","journal-title":"Can. J. Math."},{"key":"9509_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9771-7","volume-title":"String-Rewriting Systems","author":"R.V. Book","year":"1993","unstructured":"Book, R.V., Otto, F.: String-Rewriting Systems. Springer, Berlin (1993)"},{"key":"9509_CR3","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"9509_CR4","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","first-page":"218","volume-title":"29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)","author":"V. Diekert","year":"2012","unstructured":"Diekert, V., Laun, J., Ushakov, A.: Efficient algorithms for highly compressed data: the word problem in Higman\u2019s group is in\u00a0P. In: 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), vol. 14, pp. 218\u2013229 (2012)"},{"key":"9509_CR5","doi-asserted-by":"crossref","unstructured":"Diekert, V., Laun, J., Ushakov, A.: Efficient algorithms for highly compressed data: the word problem in Higman\u2019s group is in P. Int. J. Algebra Comput. 22(8) (2012)","DOI":"10.1142\/S0218196712400085"},{"key":"9509_CR6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1112\/jlms\/s1-26.1.61","volume":"26","author":"G. Higman","year":"1951","unstructured":"Higman, G.: A finitely generated infinite simple group. J. Lond. Math. Soc. 26, 61\u201364 (1951)","journal-title":"J. Lond. Math. Soc."},{"key":"9509_CR7","series-title":"Classics in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61896-3","volume-title":"Combinatorial Group Theory","author":"R. Lyndon","year":"2001","unstructured":"Lyndon, R., Schupp, P.: Combinatorial Group Theory. Classics in Mathematics. Springer, Berlin (2001)"},{"key":"9509_CR8","unstructured":"Laun, J.: Solving Algorithmic Problems in Baumslag-Solitar Groups and their Extensions Using Data Compression. PhD thesis, Universit\u00e4t Stuttgart (2012)"},{"key":"9509_CR9","unstructured":"Myasnikov, A.G., Ushakov, A.: Cryptography And Groups (CRAG) Software Library"},{"issue":"1","key":"9509_CR10","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/j.jalgebra.2011.07.024","volume":"345","author":"A.G. Myasnikov","year":"2011","unstructured":"Myasnikov, A.G., Ushakov, A., Won, D.W.: The word problem in the baumslag group with a non-elementary Dehn function is polynomial time decidable. J. Algebra 345(1), 324\u2013342 (2011)","journal-title":"J. Algebra"},{"key":"9509_CR11","doi-asserted-by":"crossref","unstructured":"Myasnikov, A.G., Ushakov, A., Won, D.W.: Power circuits, exponential algebra, and time complexity. Int. J. Algebra Comput. 22(6) (2012)","DOI":"10.1142\/S0218196712500476"},{"issue":"919","key":"9509_CR12","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1098\/rsta.1954.0007","volume":"246","author":"B.H. Neumann","year":"1954","unstructured":"Neumann, B.H.: An essay on free products of groups with amalgamations. Philos. Trans. R. Soc. Lond. Ser. A, Math. Phys. Sci. 246(919), 503\u2013554 (1954)","journal-title":"Philos. Trans. R. Soc. Lond. Ser. A, Math. Phys. Sci."},{"key":"9509_CR13","volume-title":"Trees","author":"J.-P. Serre","year":"2002","unstructured":"Serre, J.-P.: Trees, 2nd corr. printing edn. Springer, Berlin (2002)","edition":"2"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9509-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9509-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9509-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T14:55:45Z","timestamp":1564498545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9509-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,10]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["9509"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9509-5","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,10]]}}}