{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T10:10:23Z","timestamp":1764843023236,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031661587"},{"type":"electronic","value":"9783031661594"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-66159-4_9","type":"book-chapter","created":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T09:01:34Z","timestamp":1721984494000},"page":"114-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Complexity and\u00a0Approximability of\u00a0Bounded Access Lempel Ziv Coding"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1652-0599","authenticated-orcid":false,"given":"Ferdinando","family":"Cicalese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesca","family":"Ugazio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,27]]},"reference":[{"key":"9_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-62592-5_80","volume-title":"Algorithms and Complexity","author":"P Alimonti","year":"1997","unstructured":"Alimonti, P., Kann, V.: Hardness of approximating problems on cubic graphs. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol. 1203, pp. 288\u2013298. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62592-5_80"},{"key":"9_CR2","unstructured":"Bannai, H., Funakoshi, M., Hendrian, D., Matsuda, M., Puglisi, S.J.: Height-bounded Lempel-Ziv encodings. arXiv preprint arXiv:2403.08209 (2024)"},{"key":"9_CR3","unstructured":"Bannai, H., Funakoshi, M., Kurita, K., Nakashima, Y., Seto, K., Uno, T.: Optimal LZ-end parsing is hard. In: Bulteau, L., Lipt\u00e1k, Z. (eds.) 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0259, pp. 3:1\u20133:11 (2023)"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Cenzato, D., Lipt\u00e1k, Zs.: A theoretical and experimental analysis of BWT variants for string collections. In: Bannai, H., Holub, J. (eds.) 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, 27\u201329 June 2022, Prague, Czech Republic. LIPIcs, vol.\u00a0223, pp. 25:1\u201325:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPICS.CPM.2022.25","DOI":"10.4230\/LIPICS.CPM.2022.25"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.tcs.2005.11.029","volume":"354","author":"M Chleb\u00edk","year":"2006","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Complexity of approximating bounded variants of optimization problems. Theoret. Comput. Sci. 354(3), 320\u2013338 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1137\/050646846","volume":"21","author":"S Constantinescu","year":"2007","unstructured":"Constantinescu, S., Ilie, L.: The Lempel-Ziv complexity of fixed points of morphisms. SIAM J. Discret. Math. 21(2), 466\u2013481 (2007)","journal-title":"SIAM J. Discret. Math."},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Crescenzi, P.: A short guide to approximation preserving reductions. In: Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, pp. 262\u2013273 (1997). https:\/\/doi.org\/10.1109\/CCC.1997.612321","DOI":"10.1109\/CCC.1997.612321"},{"key":"9_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-031-43980-3_20","volume-title":"String Processing and Information Retrieval","author":"P Gawrychowski","year":"2023","unstructured":"Gawrychowski, P., Kosche, M., Manea, F.: On the number of factors in the LZ-End factorization. In: Nardini, F.M., Pisanti, N., Venturini, R. (eds.) SPIRE 2023. LNCS, vol. 14240, pp. 253\u2013259. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-43980-3_20"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-030-86692-1_10","volume-title":"String Processing and Information Retrieval","author":"T Ideue","year":"2021","unstructured":"Ideue, T., Mieno, T., Funakoshi, M., Nakashima, Y., Inenaga, S., Takeda, M.: On the approximation ratio of LZ-End to LZ77. In: Lecroq, T., Touzet, H. (eds.) SPIRE 2021. LNCS, vol. 12944, pp. 114\u2013126. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86692-1_10"},{"key":"9_CR10","unstructured":"Kempa, D., Kosolobov, D.: LZ-End parsing in linear time. In: 25th Annual European Symposium on Algorithms (ESA 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Kempa, D., Saha, B.: An Upper Bound and Linear-Space Queries on the LZ-End Parsing, pp. 2847\u20132866. https:\/\/doi.org\/10.1137\/1.9781611977073.111. https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9781611977073.111","DOI":"10.1137\/1.9781611977073.111"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Kreft, S., Navarro, G.: LZ77-like compression with fast random access. In: 2010 Data Compression Conference, pp. 239\u2013248 (2010). https:\/\/doi.org\/10.1109\/DCC.2010.29","DOI":"10.1109\/DCC.2010.29"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Leech, J.: 2726. a problem on strings of beads. Math. Gazette 41(338), 277\u2013278 (1957)","DOI":"10.1017\/S0025557200236115"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"22","author":"A Lempel","year":"1976","unstructured":"Lempel, A., Ziv, J.: On the complexity of finite sequences. IEEE Trans. Inf. Theory 22(1), 75\u201381 (1976). https:\/\/doi.org\/10.1109\/TIT.1976.1055501","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9_CR15","unstructured":"Lipt\u00e1k, Zs., Masillo, F., Navarro, G.: BAT-LZ out of hell. In: 35th Annual Symposium on Combinatorial Pattern Matching (CPM 2024). Leibniz International Proceedings in Informatics (LIPIcs) (2024, to appear)"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425\u2013440 (1991). https:\/\/doi.org\/10.1016\/0022-0000(91)90023-X. https:\/\/www.sciencedirect.com\/science\/article\/pii\/002200009190023X","DOI":"10.1016\/0022-0000(91)90023-X"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Rodeh, M., Pratt, V.R., Even, S.: Linear algorithm for data compression via string matching. J. ACM 28(1), 16-24 (1981). https:\/\/doi.org\/10.1145\/322234.322237","DOI":"10.1145\/322234.322237"},{"key":"9_CR18","unstructured":"Storer, J.: NP-completeness results concerning data compression. Technical Report 234 (1977)"},{"issue":"4","key":"9_CR19","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1145\/322344.322346","volume":"29","author":"JA Storer","year":"1982","unstructured":"Storer, J.A., Szymanski, T.G.: Data compression via textual substitution. J. ACM 29(4), 928\u2013951 (1982)","journal-title":"J. ACM"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-642-38905-4_24","volume-title":"Combinatorial Pattern Matching","author":"E Verbin","year":"2013","unstructured":"Verbin, E., Yu, W.: Data structure lower bounds on random access to grammar-compressed strings. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol. 7922, pp. 247\u2013258. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38905-4_24"},{"issue":"3","key":"9_CR21","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23(3), 337\u2013343 (1977)","journal-title":"IEEE Trans. Inf. Theory"}],"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-66159-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T08:02:53Z","timestamp":1729324973000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66159-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031661587","9783031661594"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66159-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"27 July 2024","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":"G\u00f6ttingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}