{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:28:28Z","timestamp":1742912908116,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319328584"},{"type":"electronic","value":"9783319328591"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-319-32859-1_24","type":"book-chapter","created":{"date-parts":[[2016,4,15]],"date-time":"2016-04-15T11:12:06Z","timestamp":1460718726000},"page":"285-289","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compressing Big Data: When the Rate of Convergence to the Entropy Matters"],"prefix":"10.1007","author":[{"given":"Salvatore","family":"Aronica","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessio","family":"Langiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesca","family":"Marzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvatore","family":"Mazzola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filippo","family":"Mignosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giulio","family":"Nazzicone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,16]]},"reference":[{"key":"24_CR1","volume-title":"Text Compression","author":"TC Bell","year":"1990","unstructured":"Bell, T.C., Cleary, J.G., Witten, I.H.: Text Compression. Prentice Hall, Upper Saddle River (1990)"},{"issue":"4","key":"24_CR2","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1145\/179812.179892","volume":"41","author":"TC Bell","year":"1994","unstructured":"Bell, T.C., Witten, I.H.: The relationship between greedy parsing and symbolwise text compression. J. ACM 41(4), 708\u2013724 (1994)","journal-title":"J. ACM"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-642-19222-7_38","volume-title":"Combinatorial Algorithms","author":"M Crochemore","year":"2011","unstructured":"Crochemore, M., Giambruno, L., Langiu, A., Mignosi, F., Restivo, A.: Dictionary-symbolwise flexible parsing. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol. 6460, pp. 390\u2013403. Springer, Heidelberg (2011)"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.jda.2011.12.021","volume":"14","author":"M Crochemore","year":"2012","unstructured":"Crochemore, M., Giambruno, L., Langiu, A., Mignosi, F., Restivo, A.: Dictionary-symbolwise flexible parsing. J. Discrete Algorithms 14, 74\u201390 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"24_CR5","first-page":"421","volume-title":"DCC","author":"M Crochemore","year":"2013","unstructured":"Crochemore, M., Langiu, A., Mignosi, F.: The rightmost equal-cost position problem. In: Bilgin, A., Marcellin, M.W., Serra-Sagrist\u00e0, J., Storer, J.A. (eds.) DCC, pp. 421\u2013430. IEEE, Los Alamitos (2013)"},{"issue":"1","key":"24_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/234313.234331","volume":"28","author":"M Crochemore","year":"1996","unstructured":"Crochemore, M., Lecroq, T.: Pattern-matching and text-compression algorithms. ACM Comput. Surv. 28(1), 39\u201341 (1996)","journal-title":"ACM Comput. Surv."},{"issue":"8","key":"24_CR7","doi-asserted-by":"publisher","first-page":"4977","DOI":"10.1109\/TIT.2013.2259291","volume":"59","author":"T Jacob","year":"2013","unstructured":"Jacob, T., Bansal, R.K.: Almost sure optimality of sliding window Lempel-Ziv algorithm and variants revisited. IEEE Trans. Inf.Theor. 59(8), 4977\u20134984 (2013)","journal-title":"IEEE Trans. Inf.Theor."},{"issue":"1&2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0304-3975(94)00298-W","volume":"144","author":"P Jacquet","year":"1995","unstructured":"Jacquet, P., Szpankowski, W.: Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees. Theor. Comput. Sci. 144(1&2), 161\u2013197 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511843204","volume-title":"Analytic Pattern Matching. From DNA to Twitter","author":"P Jacquet","year":"2015","unstructured":"Jacquet, P., Szpankowski, W.: Analytic Pattern Matching. From DNA to Twitter. Cambridge University Press, Cambridge (2015)"},{"key":"24_CR10","unstructured":"Langiu, A.: Optimal Parsing for dictionary text compression. Ph.D thesis, Universit\u00e9 Paris-Est, (2012). \n                      https:\/\/tel.archives-ouvertes.fr\/tel-00804215\/document"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.jda.2013.04.001","volume":"20","author":"A Langiu","year":"2013","unstructured":"Langiu, A.: On parsing optimality for dictionary-based text compression - the zip case. J. Discrete Algorithms 20, 65\u201370 (2013)","journal-title":"J. Discrete Algorithms"},{"issue":"12","key":"24_CR12","doi-asserted-by":"publisher","first-page":"5267","DOI":"10.1109\/TIT.2006.885458","volume":"52","author":"LA Lastras-Montano","year":"2006","unstructured":"Lastras-Montano, L.A.: On certain pathwise properties of the sliding-window Lempel-Ziv algorithm. IEEE Trans. Inf. Theor. 52(12), 5267\u20135283 (2006)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Matias, Y., Sahinalp, S.C.: On the optimality of parsing in dynamic dictionary based data compression. In: SODA, pp. 943\u2013944 (1999)","DOI":"10.1109\/DCC.1999.755673"},{"issue":"1","key":"24_CR14","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/18.179344","volume":"39","author":"D Ornstein","year":"1993","unstructured":"Ornstein, D., Weiss, B.: Entropy and data compression schemes. IEEE Trans. Inf. Theor. 39(1), 78\u201383 (1993)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"24_CR15","volume-title":"Data compression - The Complete Reference","author":"D Salomon","year":"2007","unstructured":"Salomon, D.: Data compression - The Complete Reference, 4th edn. Springer, New York (2007)","edition":"4"},{"key":"24_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-959-0","volume-title":"Variable-length Codes for Data Compression","author":"D Salomon","year":"2007","unstructured":"Salomon, D.: Variable-length Codes for Data Compression. Springer-Verlag, London (2007)"},{"issue":"2","key":"24_CR17","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1109\/18.661522","volume":"44","author":"SA Savari","year":"1998","unstructured":"Savari, S.A.: Redundancy of the Lempel-Ziv string matching code. IEEE Trans. Inf. Theor. 44(2), 787\u2013791 (1998)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"3","key":"24_CR18","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1109\/18.382018","volume":"41","author":"AD Wyner","year":"1995","unstructured":"Wyner, A.D., Wyner, A.J.: Improved redundancy of a version of the Lempel-Ziv algorithm. IEEE Trans. Inf. Theor. 41(3), 723\u2013731 (1995)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"3","key":"24_CR19","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. Theor. 23(3), 337\u2013343 (1977)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"5","key":"24_CR20","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theor. 24(5), 530\u2013536 (1978)","journal-title":"IEEE Trans. Inf. Theor."}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32859-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T20:33:22Z","timestamp":1559421202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32859-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319328584","9783319328591"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32859-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"16 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}