{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:54:30Z","timestamp":1743000870743,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030500252"},{"type":"electronic","value":"9783030500269"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50026-9_28","type":"book-chapter","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:02:43Z","timestamp":1592780563000},"page":"379-392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Subquadratic Derivational Complexity of Semi-Thue Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1237-9682","authenticated-orcid":false,"given":"Alexey","family":"Talambutsa","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1134\/S0001434612070012","volume":"92","author":"SI Adian","year":"2012","unstructured":"Adian, S.I.: On a method for proving exact bounds on derivational complexity in Thue systems. Math. Notes 92(1), 3\u201315 (2012)","journal-title":"Math. Notes"},{"issue":"5","key":"28_CR2","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1007\/PL00001646","volume":"10","author":"N Brady","year":"2000","unstructured":"Brady, N., Bridson, M.R.: There is only one gap in the isoperimetric spectrum. Geom. Funct. Anal. GAFA 10(5), 1053\u20131070 (2000)","journal-title":"Geom. Funct. Anal. GAFA"},{"issue":"2","key":"28_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1142\/S0218196798000132","volume":"8","author":"J-C Birget","year":"1998","unstructured":"Birget, J.-C.: Time-complexity of the word problem for semigroups and the Higman embedding theorem Internat. J. Algebra Comput. 8(2), 235\u2013294 (1998)","journal-title":"J. Algebra Comput."},{"issue":"2","key":"28_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.2307\/3597195","volume":"156","author":"M Sapir","year":"2002","unstructured":"Sapir, M., Birget, J.-C., Rips, E.: Isoperimetric and isodiametric functions of groups. Ann. Math. 156(2), 345\u2013466 (2002)","journal-title":"Ann. Math."},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/3-540-51081-8_107","volume-title":"Rewriting Techniques and Applications","author":"D Hofbauer","year":"1989","unstructured":"Hofbauer, D., Lautemann, C.: Termination proofs and the length of derivations. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol. 355, pp. 167\u2013177. Springer, Heidelberg (1989). \nhttps:\/\/doi.org\/10.1007\/3-540-51081-8_107"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.ipl.2005.12.011","volume":"98","author":"D Hofbauer","year":"2006","unstructured":"Hofbauer, D., Waldmann, J.: Termination of {$$aa \\rightarrow bc$$, $$bb \\rightarrow ac$$, $$cc \\rightarrow ab$$}. Inform. Process. Lett. 98, 156\u2013158 (2006)","journal-title":"Inform. Process. Lett."},{"key":"28_CR7","unstructured":"Kobayashi, Y.: Undecidability of the complexity of rewriting systems, Algebraic system, Logic, Language and Computer Science, Kyoto University Research Information Repository 2008, pp. 47\u201351 (2016). \nhttps:\/\/repository.kulib.kyoto-u.ac.jp\/dspace\/handle\/2433\/231547"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.02.037","volume":"438","author":"Y Kobayashi","year":"2012","unstructured":"Kobayashi, Y.: The derivational complexity of string rewriting systems. Theoret. Comput. Sci. 438, 1\u201312 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"28_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1142\/S0218196791000183","volume":"1","author":"AY Olshanskii","year":"1991","unstructured":"Olshanskii, A.Y.: Hyperbolicity of groups with subquadratic isoperimetric inequality. Int. J. Algebra Comput. 1(3), 281\u2013289 (1991)","journal-title":"Int. J. Algebra Comput."},{"issue":"4","key":"28_CR10","doi-asserted-by":"publisher","first-page":"311","DOI":"10.4171\/JCA\/2-4-1","volume":"2","author":"A Yu Olshanskii","year":"2018","unstructured":"Yu Olshanskii, A.: Polynomially-bounded Dehn functions of groups. J. Comb. Algebra 2(4), 311\u2013433 (2018)","journal-title":"J. Comb. Algebra"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50026-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:07:31Z","timestamp":1592780851000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50026-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500252","9783030500269"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50026-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csr2020.sciencesconf.org\/","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":"49","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":"25","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":"51% - 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":"7","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)"}},{"value":"The conference was cancelled as a live conference due to the corona pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}