{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T23:58:55Z","timestamp":1768435135809,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642141645","type":"print"},{"value":"9783642141652","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_21","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T13:26:02Z","timestamp":1278336362000},"page":"238-249","source":"Crossref","is-referenced-by-count":4,"title":["Interval Sorting"],"prefix":"10.1007","author":[{"given":"Rosa M.","family":"Jim\u00e9nez","sequence":"first","affiliation":[]},{"given":"Conrado","family":"Mart\u00ednez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","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., Pratt, V., Rivest, R., Tarjan, R.: Time bounds for selection. J. Comp. Syst. Sci.\u00a07, 448\u2013461 (1973)","journal-title":"J. Comp. Syst. Sci."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"C. Hoare","year":"1961","unstructured":"Hoare, C.: Find (Algorithm 65). Comm. ACM\u00a04, 321\u2013322 (1961)","journal-title":"Comm. ACM"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"C. Hoare","year":"1962","unstructured":"Hoare, C.: Quicksort. Computer Journal\u00a05, 10\u201315 (1962)","journal-title":"Computer Journal"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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., 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":"5","key":"21_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.ipl.2006.04.003","volume":"99","author":"M. Kuba","year":"2006","unstructured":"Kuba, M.: On quickselect, partial sorting and multiple quickselect. Inform. Process. Lett.\u00a099(5), 181\u2013186 (2006)","journal-title":"Inform. Process. Lett."},{"key":"21_CR6","unstructured":"Mart\u00ednez, C.: Partial quicksort. In: Arge, L., Italiano, G., Sedgewick, R. (eds.) Proc. of the 6th ACM-SIAM Workshop on Algorithm Engineering and Experiments (ALENEX) and the 1st ACM-SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp. 224\u2013228 (2004)"},{"key":"21_CR7","unstructured":"Mart\u00ednez, C., Panario, D., Viola, A.: Adaptive sampling for quickselect. In: Proc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 440\u2013448 (2004)"},{"issue":"3","key":"21_CR8","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1137\/S0097539700382108","volume":"31","author":"C. Mart\u00ednez","year":"2001","unstructured":"Mart\u00ednez, C., Roura, S.: Optimal sampling strategies in quicksort and quickselect. SIAM J. Comput.\u00a031(3), 683\u2013705 (2001)","journal-title":"SIAM J. Comput."},{"key":"21_CR9","series-title":"Sorting and Searching","volume-title":"Data Structures and Efficient Algorithms","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Efficient Algorithms. Sorting and Searching, vol.\u00a01. Springer, Heidelberg (1984)"},{"issue":"3","key":"21_CR10","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 \u2014 Hoare\u2019s Find algorithm for several elements. Inform. Process. Lett.\u00a056(3), 123\u2013129 (1995)","journal-title":"Inform. Process. Lett."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Yao, F.: Efficient dynamic programming using quadrangle inequalities. In: Proc. of the 12th Annual ACM Symposium on the Theory of Computing (STOC), pp. 429\u2013435 (1980)","DOI":"10.1145\/800141.804691"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:20:32Z","timestamp":1619785232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}