{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:26:45Z","timestamp":1725496005094},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770497"},{"type":"electronic","value":"9783540770503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77050-3_2","type":"book-chapter","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T08:39:22Z","timestamp":1196066362000},"page":"9-20","source":"Crossref","is-referenced-by-count":0,"title":["Streaming Algorithms for Selection and Approximate Sorting"],"prefix":"10.1007","author":[{"given":"Richard M.","family":"Karp","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","first-page":"945","volume":"14","author":"L.M. Bregman","year":"1973","unstructured":"Bregman, L.M.: Some properties of nonnegative matrices and their permanents. Soviet Math. Dokl\u00a014, 945\u2013949 (1973)","journal-title":"Soviet Math. Dokl"},{"key":"2_CR2","unstructured":"Bryant, R.E.: Data-intensive supercomputing: the case for DISC.Technical Report CMU-CS-07-128, Carnegie-Mellon University School of Computer Science (2007)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Chazelle, B.: The soft heap: an approximate priority queue with optimal error rate. Journal of the ACM\u00a047 (2000)","DOI":"10.1145\/355541.355554"},{"issue":"30","key":"2_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1145\/360680.360691","volume":"18","author":"R.W. Floyd","year":"1975","unstructured":"Floyd, R.W., Rivest, R.L.: Expected time bounds for selection. Communications of the ACM\u00a018(30), 165\u2013172 (1975)","journal-title":"Communications of the ACM"},{"key":"2_CR5","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":"2_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0020-0190(95)00150-B","volume":"56","author":"H. Prodinger","year":"1995","unstructured":"Prodinger, H.: Multiple quickselect: Hoare\u2019s find algorithm for several elements. Information Processing Letters\u00a056, 123\u2013129 (1995)","journal-title":"Information Processing Letters"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"J.S. Vitter","year":"1985","unstructured":"Vitter, J.S.: Random sampling with a reservoir. ACM Trans. on Math Software\u00a011(1), 37\u201357 (1985)","journal-title":"ACM Trans. on Math Software"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77050-3_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:55:51Z","timestamp":1619520951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77050-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540770497","9783540770503"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77050-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}