{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:53Z","timestamp":1761611333935},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_10","type":"book-chapter","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T23:22:47Z","timestamp":1376608967000},"page":"109-120","source":"Crossref","is-referenced-by-count":2,"title":["Theory and Implementation of Online Multiselection Algorithms"],"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":"Seungbum","family":"Jo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satti Srinivasa","family":"Rao","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":"10_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"},{"key":"10_CR2","unstructured":"Barbay, J., Gupta, A., Rao, S.S., Sorenson, J.: Competitive online selection in main and external memory. CoRR, abs\/1206.5336 (2012)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/11672142_6","volume-title":"STACS 2006","author":"A. Belal","year":"2006","unstructured":"Belal, A., Elmasry, A.: Distribution-sensitive construction of minimum-redundancy prefix codes. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 92\u2013103. Springer, Heidelberg (2006)"},{"issue":"4","key":"10_CR4","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.R., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci.\u00a07(4), 448\u2013461 (1973)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Cardinal, J., Fiorini, S., Joret, G., Jungers, R.M., Munro, J.I.: An efficient algorithm for partial order production. In: STOC, pp. 93\u2013100 (2009)","DOI":"10.1145\/1536414.1536430"},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1145\/322261.322264","volume":"28","author":"D.P. Dobkin","year":"1981","unstructured":"Dobkin, D.P., Munro, J.I.: Optimal time minimal space selection algorithms. J. ACM\u00a028(3), 454\u2013461 (1981)","journal-title":"J. ACM"},{"issue":"5","key":"10_CR7","doi-asserted-by":"crossref","first-page":"1722","DOI":"10.1137\/S0097539795288611","volume":"28","author":"D. Dor","year":"1999","unstructured":"Dor, D., Zwick, U.: Selecting the median. SICOMP\u00a028(5), 1722\u20131758 (1999)","journal-title":"SICOMP"},{"issue":"7","key":"10_CR8","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"},{"key":"10_CR9","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":"10_CR10","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)"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/0215021","volume":"15","author":"D.G. Kirkpatrick","year":"1986","unstructured":"Kirkpatrick, D.G., Seidel, R.: The ultimate planar convex hull algorithm. SIAM J. Comput.\u00a015(1), 287\u2013299 (1986)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10_CR12","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":"10_CR13","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/S0022-0000(76)80029-3","volume":"13","author":"A. Sch\u00f6nhage","year":"1976","unstructured":"Sch\u00f6nhage, A., Paterson, M., Pippenger, N.: Finding the median. J. Comput. Syst. Sci.\u00a013(2), 184\u2013199 (1976)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T13:17:10Z","timestamp":1558012630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}