{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:51:47Z","timestamp":1725533507885},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642024405"},{"type":"electronic","value":"9783642024412"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02441-2_7","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T09:19:32Z","timestamp":1245230372000},"page":"68-77","source":"Crossref","is-referenced-by-count":5,"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":"7_CR1","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":"7_CR2","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":"7_CR3","doi-asserted-by":"crossref","unstructured":"Beame, P., Hu\u1ef3nh-Ng\u1ecdc, D.-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":"7_CR4","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":"7_CR5","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical Report\u00a024, Digital Equipment Corporation (1994)"},{"issue":"7","key":"7_CR6","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":"7_CR7","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"},{"issue":"4","key":"7_CR8","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":"7_CR9","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"2006","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley, Chichester (2006)","edition":"2"},{"key":"7_CR10","first-page":"758","volume":"49","author":"N.G. de Bruijn","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":"7_CR11","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G., M\u00e4kinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms\u00a03(2) (2007)","DOI":"10.1145\/1240233.1240243"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Gagie, T., Manzini, G.: Move-to-front, distance coding, and inversion frequencies revisited. In: Proceedings of the 18th Symposium on Combinatorial Pattern Matching, pp. 71\u201382 (2007)","DOI":"10.1007\/978-3-540-73437-6_10"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Gagie, T., Manzini, G.: Space-conscious compression. In: Proceedings of the 32nd Symposium on Mathematical Foundations of Computer Science, pp. 206\u2013217 (2007)","DOI":"10.1007\/978-3-540-74456-6_20"},{"issue":"1\u20133","key":"7_CR14","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\u20133), 199\u2013217 (2007)","journal-title":"Theoretical Computer Science"},{"key":"7_CR15","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":"7_CR16","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\u20133","key":"7_CR17","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\u20133), 191\u2013205 (2008)","journal-title":"Theoretical Computer Science"},{"key":"7_CR18","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming, 2nd edn., vol.\u00a03. Addison-Wesley, Reading (1998)","edition":"2"},{"issue":"3","key":"7_CR19","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":"7_CR20","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":"7_CR21","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":"7_CR22","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S.: Data Streams: Algorithms and Applications. In: Foundations and Trends in Theoretical Computer Science. Now Publishers (2005)","DOI":"10.1561\/0400000002"},{"key":"7_CR23","unstructured":"Ruhl, J.M.: Efficient Algorithms for New Computational Models. PhD thesis, Massachusetts Institute of Technology (2003)"},{"issue":"1\u20133","key":"7_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. Theoretical Computer Science\u00a0302(1\u20133), 211\u2013222 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"7_CR25","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":"7_CR26","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":"7_CR27","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":"7_CR28","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","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02441-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T19:33:29Z","timestamp":1558380809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02441-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024405","9783642024412"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02441-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}