{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:50:13Z","timestamp":1743015013435,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387678"},{"type":"electronic","value":"9783642387685"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38768-5_15","type":"book-chapter","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T04:31:28Z","timestamp":1368765088000},"page":"147-157","source":"Crossref","is-referenced-by-count":2,"title":["Selection from Read-Only Memory with Limited Workspace"],"prefix":"10.1007","author":[{"given":"Amr","family":"Elmasry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel Dahl","family":"Juhl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jyrki","family":"Katajainen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasa Rao","family":"Satti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-38236-9_4","volume-title":"Theory and Applications of Models of Computation","author":"T. Asano","year":"2013","unstructured":"Asano, T., Elmasry, A., Katajainen, J.: Priority queues and sorting for read-only data. In: Chan, T.-H.H., Lau, L.C., Trevisan, L. (eds.) TAMC 2013. LNCS, vol.\u00a07876, pp. 32\u201341. Springer, Heidelberg (2013)"},{"issue":"2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1137\/0220017","volume":"20","author":"P. Beame","year":"1991","unstructured":"Beame, P.: A general sequential time-space tradeoff for finding unique elements. SIAM J. Comput.\u00a020(2), 270\u2013277 (1991)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"15_CR3","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M. Blum","year":"1973","unstructured":"Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. System Sci.\u00a07(4), 448\u2013461 (1973)","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1721837.1721842","volume":"6","author":"T.M. Chan","year":"2010","unstructured":"Chan, T.M.: Comparison-based time-space lower bounds for selection. ACM Trans. Algorithms\u00a06(2), 26:1\u201326:16 (2010)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"15_CR5","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"B. Chazelle","year":"1988","unstructured":"Chazelle, B.: A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput.\u00a017(3), 427\u2013462 (1988)","journal-title":"SIAM J. Comput."},{"key":"15_CR6","unstructured":"Clark, D.: Compact Pat Trees. Ph.D. thesis, Department of Computer Science, University of Waterloo, Waterloo (1996)"},{"key":"15_CR7","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0022-0000(87)90002-X","volume":"34","author":"G.N. Frederickson","year":"1987","unstructured":"Frederickson, G.N.: Upper bounds for time-space trade-offs in sorting and selection. J. Comput. System Sci.\u00a034(1), 19\u201326 (1987)","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"15_CR9","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/j.tcs.2007.07.041","volume":"387","author":"A. Golynski","year":"2007","unstructured":"Golynski, A.: Optimal lower bounds for rank and select indexes. Theoret. Comput. Sci.\u00a0387(3), 348\u2013359 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR10","first-page":"841","volume-title":"SODA 2003","author":"R. Grossi","year":"2003","unstructured":"Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: SODA 2003, pp. 841\u2013850. SIAM, Philadelphia (2003)"},{"key":"15_CR11","first-page":"549","volume-title":"FOCS 1989","author":"G. Jacobson","year":"1989","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: FOCS 1989, pp. 549\u2013554. IEEE Computer Society, Los Alamitos (1989)"},{"key":"15_CR12","volume-title":"Combinatorial Algorithms: Part 1, The Art of Computer Programming","author":"D.E. Knuth","year":"2011","unstructured":"Knuth, D.E.: Combinatorial Algorithms: Part 1, The Art of Computer Programming, vol.\u00a04A. Addison-Wesley, Boston (2011)"},{"issue":"3","key":"15_CR13","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. Theoret. Comput. Sci.\u00a012(3), 315\u2013323 (1980)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-62034-6_35","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"J.I. Munro","year":"1996","unstructured":"Munro, J.I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol.\u00a01180, pp. 37\u201342. Springer, Heidelberg (1996)"},{"issue":"2","key":"15_CR15","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(95)00225-1","volume":"165","author":"J.I. Munro","year":"1996","unstructured":"Munro, J.I., Raman, V.: Selection from read-only memory and sorting with minimum data movement. Theoret. Comput. Sci.\u00a0165(2), 311\u2013323 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-31265-6_2","volume-title":"Combinatorial Pattern Matching","author":"G. Navarro","year":"2012","unstructured":"Navarro, G.: Wavelet trees for all. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol.\u00a07354, pp. 2\u201326. Springer, Heidelberg (2012)"},{"key":"15_CR17","first-page":"264","volume-title":"FOCS 1998","author":"J. Pagter","year":"1998","unstructured":"Pagter, J., Rauhe, T.: Optimal time-space trade-offs for sorting. In: FOCS 1998, pp. 264\u2013268. IEEE Computer Society, Los Alamitos (1998)"},{"issue":"4","key":"15_CR18","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/1290672.1290680","volume":"3","author":"R. Raman","year":"2007","unstructured":"Raman, R., Raman, V., Satti, S.R.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3(4), Article 43 (2007)","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"15_CR19","first-page":"162","volume":"6","author":"V. Raman","year":"1999","unstructured":"Raman, V., Ramnath, S.: Improved upper bounds for time-space trade-offs for selection. Nordic J. Comput.\u00a06(2), 162\u2013180 (1999)","journal-title":"Nordic J. Comput."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38768-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T11:48:26Z","timestamp":1676807306000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-38768-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387678","9783642387685"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38768-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}