{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:46:41Z","timestamp":1743108401507,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031055775"},{"type":"electronic","value":"9783031055782"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-05578-2_23","type":"book-chapter","created":{"date-parts":[[2022,5,8]],"date-time":"2022-05-08T17:06:22Z","timestamp":1652029582000},"page":"286-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Power Word Problem in\u00a0Graph Products"],"prefix":"10.1007","author":[{"given":"Florian","family":"Stober","sequence":"first","affiliation":[]},{"given":"Armin","family":"Wei\u00df","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,6]]},"reference":[{"unstructured":"Allender, E.: Arithmetic circuits and counting complexity classes. Compl. Comput. Proofs Quaderni di Matematica 13, 33\u201372 (2004)","key":"23_CR1"},{"issue":"3","key":"23_CR2","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1112\/jtopol\/jtp018","volume":"2","author":"J Crisp","year":"2009","unstructured":"Crisp, J., Godelle, E., Wiest, B.: The conjugacy problem in subgroups of right-angled artin groups. J. Topol. 2(3), 442\u2013460 (2009)","journal-title":"J. Topol."},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF01456932","volume":"71","author":"M Dehn","year":"1911","unstructured":"Dehn, M.: \u00dcber unendliche diskontinuierliche gruppen. Math. Ann. 71(1), 116\u2013144 (1911)","journal-title":"Math. Ann."},{"doi-asserted-by":"crossref","unstructured":"Diekert, V., Kausch, J., Lohrey, M.: Logspace computations in Coxeter groups and graph groups. Contemp. Math. (Amer. Math. Soc.) 582, 77\u201394 (2012)","key":"23_CR4","DOI":"10.1090\/conm\/582\/11553"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0304-3975(86)90028-9","volume":"46","author":"C Duboc","year":"1986","unstructured":"Duboc, C.: On some equations in free partially commutative monoids. Theoret. Comput. Sci. 46, 159\u2013174 (1986)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"NJ Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Am. Math. Soc. 16(1), 109\u2013114 (1965)","journal-title":"Proc. Am. Math. Soc."},{"unstructured":"Green, E.R.: Graph products of groups. Ph.D. thesis, University of Leeds (1990)","key":"23_CR7"},{"issue":"08","key":"23_CR8","first-page":"218","volume":"22","author":"N Haubold","year":"2012","unstructured":"Haubold, N., Lohrey, M., Mathissen, C.: Compressed decision problems for graph products and applications to (outer) automorphism groups. IJAC 22(08), 218\u2013230 (2012)","journal-title":"IJAC"},{"unstructured":"Kausch, J.: The parallel complexity of certain algorithmic problems in group theory. Ph.D. thesis (2017). http:\/\/dx.doi.org\/10.18419\/opus-9152","key":"23_CR9"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1145\/322017.322031","volume":"24","author":"RJ Lipton","year":"1977","unstructured":"Lipton, R.J., Zalcstein, Y.: Word problems solvable in logspace. J. ACM 24, 522\u2013526 (1977)","journal-title":"J. ACM"},{"doi-asserted-by":"publisher","unstructured":"Lohrey, M.: The Compressed Word Problem for Groups. SM, Springer, New York (2014). https:\/\/doi.org\/10.1007\/978-1-4939-0748-9","key":"23_CR11","DOI":"10.1007\/978-1-4939-0748-9"},{"doi-asserted-by":"publisher","unstructured":"Lohrey, M., Schleimer, S.: Efficient computation in groups via compression. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds.) CSR 2007. LNCS, vol. 4649, pp. 249\u2013258. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74510-5_26","key":"23_CR12","DOI":"10.1007\/978-3-540-74510-5_26"},{"doi-asserted-by":"publisher","unstructured":"Lohrey, M., Wei\u00df, A.: The power word problem. In: MFCS 2019, Proceedings. LIPIcs, vol. 138, pp. 43:1\u201343:15 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2019.43","key":"23_CR13","DOI":"10.4230\/LIPIcs.MFCS.2019.43"},{"issue":"1","key":"23_CR14","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/s00224-017-9808-3","volume":"62","author":"M Lohrey","year":"2018","unstructured":"Lohrey, M., Zetzsche, G.: Knapsack in graph groups. Theor. Comput. Syst. 62(1), 192\u2013246 (2018)","journal-title":"Theor. Comput. Syst."},{"issue":"292","key":"23_CR15","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1090\/S0025-5718-2014-02880-9","volume":"84","author":"A Myasnikov","year":"2015","unstructured":"Myasnikov, A., Nikolaev, A., Ushakov, A.: Knapsack problems in groups. Math. Comput. 84(292), 987\u20131016 (2015)","journal-title":"Math. Comput."},{"unstructured":"Novikov, P.S.: On the algorithmic unsolvability of the word problem in group theory (1955)","key":"23_CR16"},{"doi-asserted-by":"publisher","unstructured":"Stober, F.: The power word problem in graph groups. Master\u2019s thesis (2021). https:\/\/doi.org\/10.18419\/opus-11768","key":"23_CR17","DOI":"10.18419\/opus-11768"},{"doi-asserted-by":"crossref","unstructured":"Stober, F., Wei\u00df, A.: The power word problem in graph products .https:\/\/arxiv.org\/abs\/2201.06543 (2022)","key":"23_CR18","DOI":"10.1007\/978-3-031-05578-2_23"},{"key":"23_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03927-4","volume-title":"Introduction to Circuit Complexity","author":"H Vollmer","year":"1999","unstructured":"Vollmer, H.: Introduction to Circuit Complexity. Springer, Berlin (1999)"},{"issue":"1","key":"23_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. J. Symb. Comput. 6(1), 99\u2013104 (1988)","journal-title":"J. Symb. Comput."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-05578-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T17:30:13Z","timestamp":1675531813000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-05578-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031055775","9783031055782"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-05578-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tampa, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.usf.edu\/arts-sciences\/conferences\/dlt2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}