{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:29:26Z","timestamp":1761611366858},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319156118"},{"type":"electronic","value":"9783319156125"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-15612-5_18","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T04:05:18Z","timestamp":1424664318000},"page":"199-209","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Online Multiselection in Internal and External Memory"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9my","family":"Barbay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ankur","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasa","family":"Rao Satti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Sorenson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"18_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun. ACM\u00a031(9), 1116\u20131127 (1988)","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Brodal, G., Fagerberg, R.: On the limits of cache-obliviousness. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 307\u2013315 (2003)","key":"18_CR2","DOI":"10.1145\/780542.780589"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-40450-4_10","volume-title":"Algorithms \u2013 ESA 2013","author":"J. Barbay","year":"2013","unstructured":"Barbay, J., Gupta, A., Jo, S., Rao, S.S., Sorenson, J.: Theory and implementation of online multiselection algorithms. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol.\u00a08125, pp. 109\u2013120. Springer, Heidelberg (2013)"},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1145\/322261.322264","volume":"28","author":"D.P. Dobkin","year":"1981","unstructured":"Dobkin, D.P., Ian Munro, J.: Optimal time minimal space selection algorithms. J. ACM\u00a028(3), 454\u2013461 (1981)","journal-title":"J. ACM"},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","volume":"47","author":"M.L. Fredman","year":"1993","unstructured":"Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci.\u00a047(3), 424\u2013436 (1993)","journal-title":"J. Comput. Syst. Sci."},{"issue":"7","key":"18_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"C.A.R. Hoare","year":"1961","unstructured":"Hoare, C.A.R.: Algorithm 65: find. Commun. ACM\u00a04(7), 321\u2013322 (1961)","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Hon, W.-K., Sadakane, K., Sung, W.-K.: Succinct data structures for searchable partial sums. In: Proceedings of the International Symposium on Algorithms and Computation, pp. 505\u2013516 (2003)","key":"18_CR7","DOI":"10.1007\/978-3-540-24587-2_52"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-14165-2_21","volume-title":"Automata, Languages and Programming","author":"R.M. Jim\u00e9nez","year":"2010","unstructured":"Jim\u00e9nez, R.M., Mart\u00ednez, C.: Interval Sorting. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 238\u2013249. Springer, Heidelberg (2010)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/11523468_9","volume-title":"Automata, Languages and Programming","author":"K. Kaligosi","year":"2005","unstructured":"Kaligosi, K., Mehlhorn, K., Munro, J.I., Sanders, P.: Towards optimal multiple selection. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 103\u2013114. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Motwani, R., Raghavan, P.: Deferred data structuring: Query-driven preprocessing for geometric search problems. In: Symposium on Computational Geometry, pp. 303\u2013312 (1986)","key":"18_CR10","DOI":"10.1145\/10515.10548"},{"issue":"3","key":"18_CR11","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. Inf. Process. Lett.\u00a056(3), 123\u2013129 (1995)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"18_CR12","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.jalgor.2005.02.002","volume":"58","author":"J.F. Sibeyn","year":"2006","unstructured":"Sibeyn, J.F.: External selection. J. Algorithms\u00a058(2), 104\u2013117 (2006)","journal-title":"J. Algorithms"},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0020-0190(90)90171-S","volume":"35","author":"Y.-T. Ching","year":"1990","unstructured":"Ching, Y.-T., Mehlhorn, K., Smid, M.H.M.: Dynamic deferred data structuring. Information Processing Letters\u00a035(1), 37\u201340 (1990)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15612-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:53:21Z","timestamp":1559123601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-15612-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319156118","9783319156125"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15612-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}