{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:04:43Z","timestamp":1742911483331,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030514655"},{"type":"electronic","value":"9783030514662"}],"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-51466-2_26","type":"book-chapter","created":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T13:03:46Z","timestamp":1592917426000},"page":"296-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Balancing Straight-Line Programs for Strings and Trees"],"prefix":"10.1007","author":[{"given":"Markus","family":"Lohrey","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,24]]},"reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-662-48350-3_13","volume-title":"Algorithms \u2013 ESA 2015","author":"D Belazzougui","year":"2015","unstructured":"Belazzougui, D., Cording, P.H., Puglisi, S.J., Tabei, Y.: Access, rank, and select in grammar-compressed strings. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 142\u2013154. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_13"},{"issue":"2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/s00453-015-0068-9","volume":"77","author":"P Bille","year":"2017","unstructured":"Bille, P., Cording, P.H., G\u00f8rtz, I.L.: Compressed subsequence matching and packed tree coloring. Algorithmica 77(2), 336\u2013348 (2017)","journal-title":"Algorithmica"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-67428-5_9","volume-title":"String Processing and Information Retrieval","author":"P Bille","year":"2017","unstructured":"Bille, P., Fernstr\u00f8m, F., G\u00f8rtz, I.L.: Tight bounds for top tree compression. In: Fici, G., Sciortino, M., Venturini, R. (eds.) SPIRE 2017. LNCS, vol. 10508, pp. 97\u2013102. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67428-5_9"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.jcss.2017.01.002","volume":"86","author":"P Bille","year":"2017","unstructured":"Bille, P., G\u00f8rtz, I.L., Cording, P.H., Sach, B., Vildh\u00f8j, H.W., Vind, S.: Fingerprints in compressed strings. J. Comput. Syst. Sci. 86, 171\u2013180 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.ic.2014.12.012","volume":"243","author":"P Bille","year":"2015","unstructured":"Bille, P., G\u00f8rtz, I.L., Landau, G.M., Weimann, O.: Tree compression with top trees. Inf. Comput. 243, 166\u2013177 (2015)","journal-title":"Inf. Comput."},{"issue":"3","key":"26_CR6","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/130936889","volume":"44","author":"P Bille","year":"2015","unstructured":"Bille, P., Landau, G.M., Raman, R., Sadakane, K., Satti, S.R., Weimann, O.: Random access to grammar-compressed strings and trees. SIAM J. Comput. 44(3), 513\u2013539 (2015)","journal-title":"SIAM J. Comput."},{"issue":"4\u20135","key":"26_CR7","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.is.2008.01.004","volume":"33","author":"G Busatto","year":"2008","unstructured":"Busatto, G., Lohrey, M., Maneth, S.: Efficient memory representation of XML document trees. Inf. Syst. 33(4\u20135), 456\u2013474 (2008)","journal-title":"Inf. Syst."},{"issue":"7","key":"26_CR8","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1109\/TIT.2005.850116","volume":"51","author":"M Charikar","year":"2005","unstructured":"Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Trans. Inf. Theory 51(7), 2554\u20132576 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF01762121","volume":"3","author":"R Cole","year":"1988","unstructured":"Cole, R., Vishkin, U.: The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time. Algorithmica 3, 329\u2013346 (1988)","journal-title":"Algorithmica"},{"key":"26_CR10","unstructured":"Dudek, B., Gawrychowski, P.: Slowing down top trees for better worst-case compression. In: Proceedings of the Annual Symposium on Combinatorial Pattern Matching, CPM 2018, volume 105 of LIPIcs, pp. 16:1\u201316:8. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Ganardi, M., Je\u017c, A., Lohrey, M.: Balancing straight-line programs. In: Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, pp. 1169\u20131183. IEEE Computer Society (2019)","DOI":"10.1109\/FOCS.2019.00073"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Ganardi, M., Je\u017c, A., Lohrey, M.: Balancing straight-line programs. CoRR, abs\/1902.03568 (2019)","DOI":"10.1109\/FOCS.2019.00073"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-319-90530-3_11","volume-title":"Computer Science \u2013 Theory and Applications","author":"A Gasc\u00f3n","year":"2018","unstructured":"Gasc\u00f3n, A., Lohrey, M., Maneth, S., Reh, C.P., Sieber, K.: Grammar-based compression of unranked trees. In: Fomin, F.V., Podolskii, V.V. (eds.) CSR 2018. LNCS, vol. 10846, pp. 118\u2013131. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90530-3_11"},{"key":"26_CR14","unstructured":"Gasieniec, L., Kolpakov, R.M., Potapov, I., Sant, P.: Real-time traversal in grammar-based compressed files. In: Proceedings of the 2005 Data Compression Conference, DCC 2005, p. 458. IEEE Computer Society (2005)"},{"key":"26_CR15","unstructured":"Gawrychowski, P., Jo, S., Mozes, S., Weimann, O.: Compressed range minimum queries. CoRR, abs\/1902.04427 (2019)"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-319-20086-6_2","volume-title":"Experimental Algorithms","author":"L H\u00fcbschle-Schneider","year":"2015","unstructured":"H\u00fcbschle-Schneider, L., Raman, R.: Tree compression with top trees revisited. In: Bampis, E. (ed.) SEA 2015. LNCS, vol. 9125, pp. 15\u201327. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20086-6_2"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.ic.2014.09.009","volume":"240","author":"I Tomohiro","year":"2015","unstructured":"Tomohiro, I., et al.: Detecting regularities on grammar-compressed strings. Inf. Comput. 240, 74\u201389 (2015)","journal-title":"Inf. Comput."},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2015.05.027","volume":"592","author":"A Je\u017c","year":"2015","unstructured":"Je\u017c, A.: Approximation of grammar-based compression via recompression. Theor. Comput. Sci. 592, 115\u2013134 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.tcs.2015.12.032","volume":"616","author":"A Je\u017c","year":"2016","unstructured":"Je\u017c, A.: A really simple approximation of smallest grammar. Theor. Comput. Sci. 616, 141\u2013150 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"26_CR20","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1515\/gcc-2012-0016","volume":"4","author":"M Lohrey","year":"2012","unstructured":"Lohrey, M.: Algorithmics on SLP-compressed strings: a survey. Groups Complex. Cryptol. 4(2), 241\u2013299 (2012)","journal-title":"Groups Complex. Cryptol."},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-319-21500-6_3","volume-title":"Developments in Language Theory","author":"M Lohrey","year":"2015","unstructured":"Lohrey, M.: Grammar-based tree compression. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 46\u201357. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21500-6_3"},{"issue":"8","key":"26_CR22","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.is.2013.06.006","volume":"38","author":"M Lohrey","year":"2013","unstructured":"Lohrey, M., Maneth, S., Mennicke, R.: XML tree structure compression using RePair. Inf. Syst. 38(8), 1150\u20131167 (2013)","journal-title":"Inf. Syst."},{"issue":"7","key":"26_CR23","doi-asserted-by":"publisher","first-page":"2082","DOI":"10.1007\/s00453-017-0331-3","volume":"80","author":"M Lohrey","year":"2018","unstructured":"Lohrey, M., Maneth, S., Reh, C.P.: Constant-time tree traversal and subtree equality check for grammar-compressed trees. Algorithmica 80(7), 2082\u20132105 (2018)","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"26_CR24","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(02)00777-6","volume":"302","author":"W Rytter","year":"2003","unstructured":"Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci. 302(1\u20133), 211\u2013222 (2003)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Beyond the Horizon of Computability"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51466-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T18:12:22Z","timestamp":1615313542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51466-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030514655","9783030514662"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51466-2_26","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":"24 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fisciano","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cie2020.wordpress.com\/","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":"72","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":"28","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":"5","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":"39% - 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 held virtually due to the coronavirus 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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}