{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:35:18Z","timestamp":1743071718716,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646822"},{"type":"electronic","value":"9783540691068"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998]]},"DOI":"10.1007\/bfb0054361","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T07:43:28Z","timestamp":1149666208000},"page":"131-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Improved upper bounds for time-space tradeoffs for selection with limited storage"],"prefix":"10.1007","author":[{"given":"Venkatesh","family":"Raman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarnath","family":"Ramnath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"issue":"6","key":"12_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0020-0190(88)90186-X","volume":"26","author":"R. J. Cole","year":"1988","unstructured":"R. J. Cole, An optimally efficient selection algorithm, Information Processing Letters\n                        26 (6) (1988) 295\u2013299.","journal-title":"Information Processing Letters"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0022-0000(87)90002-X","volume":"34","author":"G. N. Frederickson","year":"1987","unstructured":"G. N. Frederickson, Upper bounds for time-space trade-offs in sorting and selection, Journal of Computer and System Sciences\n                        34 (1987) 19\u201326.","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","volume":"12","author":"J. I. Munro","year":"1980","unstructured":"J. I. Munro and M. S. Paterson, Selection and sorting with limited storage, Theoretical Computer Science\n                        12 (1980) 315\u2013325.","journal-title":"Theoretical Computer Science"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(95)00225-1","volume":"165","author":"J. I. Munro","year":"1996","unstructured":"J. I. Munro and V. Raman, Selection from read-only memory and sorting with minimum data movement, Theoretical Computer Science\n                        165 (1996) 311\u2013323.","journal-title":"Theoretical Computer Science"},{"key":"12_CR5","unstructured":"V. Raman and S. Ramnath, \u201cImproved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage\u201d, TR98\/04\/17, Institute of Mathematical Sciences, Chennai, India."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'98"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054361","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T23:23:58Z","timestamp":1676676238000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054361"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646822","9783540691068"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/bfb0054361","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"26 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}