{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:23:32Z","timestamp":1745987012437,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642368981"},{"type":"electronic","value":"9783642368998"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36899-8_12","type":"book-chapter","created":{"date-parts":[[2013,3,5]],"date-time":"2013-03-05T06:33:37Z","timestamp":1362465217000},"page":"284-297","source":"Crossref","is-referenced-by-count":0,"title":["On the Value of Multiple Read\/Write Streams for Data Compression"],"prefix":"10.1007","author":[{"given":"Travis","family":"Gagie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","first-page":"203","volume":"28","author":"T. Aardenne-Ehrenfest van","year":"1951","unstructured":"van Aardenne-Ehrenfest, T., de Bruijn, N.G.: Circuits and trees in oriented linear graphs. Simon Stevin\u00a028, 203\u2013217 (1951)","journal-title":"Simon Stevin"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Datar, M., Rajagopalan, S., Ruhl, M.: On the streaming model augmented with a sorting primitive. In: Proceedings of the 45th Symposium on Foundations of Computer Science, pp. 540\u2013549 (2004)","DOI":"10.1109\/FOCS.2004.48"},{"issue":"6","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1137\/S0097539703428324","volume":"36","author":"L. Arge","year":"2007","unstructured":"Arge, L., Bender, M.A., Demaine, E.D., Holland-Minkley, B., Munro, J.I.: An optimal cache-oblivious priority queue and its application to graph algorithms. SIAM Journal on Computing\u00a036(6), 1672\u20131695 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Beame, P., Huynh, T.: On the value of multiple read\/write streams for approximating frequency moments. In: Proceedings of the 49th Symposium on Foundations of Computer Science, pp. 499\u2013508 (2008)","DOI":"10.1109\/FOCS.2008.52"},{"issue":"6","key":"12_CR5","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1017\/S0956796804005118","volume":"14","author":"R.S. Bird","year":"2004","unstructured":"Bird, R.S., Mu, S.-C.: Inverting the Burrows-Wheeler transform. Journal of Functional Programming\u00a014(6), 603\u2013612 (2004)","journal-title":"Journal of Functional Programming"},{"key":"12_CR6","first-page":"758","volume":"49","author":"N.G. Bruijn de","year":"1946","unstructured":"de Bruijn, N.G.: A combinatorial problem. Koninklijke Nederlandse Akademie van Wetenschappen\u00a049, 758\u2013764 (1946)","journal-title":"Koninklijke Nederlandse Akademie van Wetenschappen"},{"key":"12_CR7","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm, Technical Report\u00a024, Digital Equipment Corporation (1994)"},{"issue":"7","key":"12_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 Transactions on Information Theory\u00a051(7), 2554\u20132576 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1137\/0220039","volume":"20","author":"J. Chen","year":"1991","unstructured":"Chen, J., Yap, C.-K.: Reversal complexity. SIAM Journal on Computing\u00a020(4), 622\u2013638 (1991)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Chien, Y.-F., Hon, W.-K., Shah, R., Vitter, J.S.: Geometric Burrows-Wheeler Transform: Linking range searching and text indexing. In: Proceedings of the Data Compression Conference, pp. 252\u2013261 (2008)","DOI":"10.1109\/DCC.2008.67"},{"issue":"4","key":"12_CR11","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","volume":"51","author":"R. Cilibrasi","year":"2005","unstructured":"Cilibrasi, R., Vit\u00e1nyi, P.: Clustering by compression. IEEE Transactions on Information Theory\u00a051(4), 1523\u20131545 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-24698-5_6","volume-title":"LATIN 2004: Theoretical Informatics","author":"F. Erg\u00fcn","year":"2004","unstructured":"Erg\u00fcn, F., Muthukrishnan, S., Sahinalp, S.C.: Sublinear Methods for Detecting Periodic Trends in Data Streams. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 16\u201328. Springer, Heidelberg (2004)"},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s00453-011-9535-0","volume":"63","author":"P. Ferragina","year":"2012","unstructured":"Ferragina, P., Gagie, T., Manzini, G.: Lightweight data indexing and compression in external memory. Algorithmica\u00a063(3), 707\u2013730 (2012)","journal-title":"Algorithmica"},{"key":"12_CR14","first-page":"107","volume":"1","author":"C. Flye Sainte-Marie","year":"1894","unstructured":"Flye Sainte-Marie, C.: Solution to question nr. 48. L\u2019Interm\u00e9diare de Math\u00e9maticiens\u00a01, 107\u2013110 (1894)","journal-title":"L\u2019Interm\u00e9diare de Math\u00e9maticiens"},{"issue":"6","key":"12_CR15","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.ipl.2006.04.008","volume":"99","author":"T. Gagie","year":"2006","unstructured":"Gagie, T.: Large alphabets and incompressibility. Information Processing Letters\u00a099(6), 246\u2013251 (2006)","journal-title":"Information Processing Letters"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-02441-2_7","volume-title":"Combinatorial Pattern Matching","author":"T. Gagie","year":"2009","unstructured":"Gagie, T.: On the Value of Multiple Read\/Write Streams for Data Compression. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol.\u00a05577, pp. 68\u201377. Springer, Heidelberg (2009)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-642-13089-2_23","volume-title":"Language and Automata Theory and Applications","author":"T. Gagie","year":"2010","unstructured":"Gagie, T., Gawrychowski, P.: Grammar-Based Compression in a Streaming Model. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 273\u2013284. Springer, Heidelberg (2010)"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-540-73437-6_10","volume-title":"Combinatorial Pattern Matching","author":"T. Gagie","year":"2007","unstructured":"Gagie, T., Manzini, G.: Move-to-Front, Distance Coding, and Inversion Frequencies Revisited. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol.\u00a04580, pp. 71\u201382. Springer, Heidelberg (2007)"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-540-74456-6_20","volume-title":"Mathematical Foundations of Computer Science 2007","author":"T. Gagie","year":"2007","unstructured":"Gagie, T., Manzini, G.: Space-Conscious Compression. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 206\u2013217. Springer, Heidelberg (2007)"},{"issue":"1-3","key":"12_CR20","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.tcs.2007.02.062","volume":"380","author":"M. Grohe","year":"2007","unstructured":"Grohe, M., Koch, C., Schweikardt, N.: Tight lower bounds for query processing on streaming and external memory data. Theoretical Computer Science\u00a0380(1-3), 199\u2013217 (2007)","journal-title":"Theoretical Computer Science"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Grohe, M., Schweikardt, N.: Lower bounds for sorting with few random accesses to external memory. In: Proceedings of the 24th Symposium on Principles of Database Systems, pp. 238\u2013249 (2005)","DOI":"10.1145\/1065167.1065197"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Gupta, A., Grossi, R., Vitter, J.S.: Nearly tight bounds on the encoding length of the Burrows-Wheeler Transform. In: Proceedings of the 4th Workshop on Analytic Algorithmics and Combinatorics, pp. 191\u2013202 (2008)","DOI":"10.1137\/1.9781611972986.3"},{"issue":"1-3","key":"12_CR23","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.tcs.2008.04.026","volume":"401","author":"A. Hernich","year":"2008","unstructured":"Hernich, A., Schweikardt, N.: Reversal complexity revisited. Theoretical Computer Science\u00a0401(1-3), 191\u2013205 (2008)","journal-title":"Theoretical Computer Science"},{"key":"12_CR24","unstructured":"Knuth, D.E.: The Art of Computer Programming, 2nd edn., vol.\u00a03. Addison-Wesley (1998)"},{"issue":"3","key":"12_CR25","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1137\/S0097539797331105","volume":"29","author":"R. Kosaraju","year":"1999","unstructured":"Kosaraju, R., Manzini, G.: Compression of low entropy strings with Lempel-Ziv algorithms. SIAM Journal on Computing\u00a029(3), 893\u2013911 (1999)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"12_CR26","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1145\/382780.382782","volume":"48","author":"G. Manzini","year":"2001","unstructured":"Manzini, G.: An analysis of the Burrows-Wheeler Transform. Journal of the ACM\u00a048(3), 407\u2013430 (2001)","journal-title":"Journal of the ACM"},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","volume":"12","author":"J.I. Munro","year":"1980","unstructured":"Munro, J.I., Paterson, M.S.: Selection and sorting with limited storage. Theoretical Computer Science\u00a012, 315\u2013323 (1980)","journal-title":"Theoretical Computer Science"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S.: Data Streams: Algorithms and Applications. Foundations and Trends in Theoretical Computer Science. Now Publishers (2005)","DOI":"10.1561\/0400000002"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Computing Surveys\u00a039(1) (2007)","DOI":"10.1145\/1216370.1216372"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Orlandi, A., Venturini, R.: Space-efficient substring occurrence estimation. In: Proceedings of the 30th Symposium on Principles of Database Systems, pp. 95\u2013106 (2011)","DOI":"10.1145\/1989284.1989300"},{"issue":"4","key":"12_CR31","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1109\/TIT.1986.1057210","volume":"32","author":"J. Rissanen","year":"1986","unstructured":"Rissanen, J.: Complexity of strings in the class of Markov sources. IEEE Transactions on Information Theory\u00a032(4), 526\u2013532 (1986)","journal-title":"IEEE Transactions on Information Theory"},{"key":"12_CR32","unstructured":"Ruhl, J.M.: Efficient algorithms for new computational models, PhD thesis, Massachusetts Institute of Technology (2003)"},{"issue":"1-3","key":"12_CR33","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. Theoretical Computer Science\u00a0302(1-3), 211\u2013222 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"12_CR34","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1109\/18.567642","volume":"43","author":"S. Savari","year":"1997","unstructured":"Savari, S.: Redundancy of the Lempel-Ziv incremental parsing rule. IEEE Transactions on Information Theory\u00a043(1), 9\u201321 (1997)","journal-title":"IEEE Transactions on Information Theory"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Schweikardt, N.: Machine models and lower bounds for query processing. In: Proceedings of the 26th Symposium on Principles of Database Systems, pp. 41\u201352 (2007)","DOI":"10.1145\/1265530.1265537"},{"issue":"3","key":"12_CR36","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 Transactions on Information Theory\u00a023(3), 337\u2013343 (1977)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"12_CR37","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 Transactions on Information Theory\u00a024(5), 530\u2013536 (1978)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Information Theory, Combinatorics, and Search Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36899-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T22:57:58Z","timestamp":1745967478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36899-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642368981","9783642368998"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36899-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}