{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:04:37Z","timestamp":1761807877614,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642552236"},{"type":"electronic","value":"9783642552243"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-642-55224-3_20","type":"book-chapter","created":{"date-parts":[[2014,5,5]],"date-time":"2014-05-05T20:44:02Z","timestamp":1399322642000},"page":"202-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Scalable and Efficient Parallel Selection"],"prefix":"10.1007","author":[{"given":"Christian","family":"Siebert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,6]]},"reference":[{"issue":"4","key":"20_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.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7(4), 448\u2013461 (1973)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR2","first-page":"158","volume":"5609","author":"M Fouz","year":"2009","unstructured":"Fouz, M., Kufleitner, M., Manthey, B., Jahromi, N.Z.: On smoothed analysis of quicksort and Hoare\u2019s find. Comput. Comb. 5609, 158\u2013167 (2009)","journal-title":"Comput. Comb."},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1145\/321592.321600","volume":"17","author":"WD Frazer","year":"1970","unstructured":"Frazer, W.D., McKellar, A.C.: Samplesort: a sampling approach to minimal storage tree sorting. J. ACM 17(3), 496\u2013507 (1970)","journal-title":"J. ACM"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Han, Y.: Optimal parallel selection. ACM Trans. Algorithms 3(4) (2007)","DOI":"10.1145\/1290672.1290675"},{"issue":"7","key":"20_CR5","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"CAR Hoare","year":"1961","unstructured":"Hoare, C.A.R.: Algorithm 63 (Partition) and Algorithm 65 (Find). Commun. ACM 4(7), 321\u2013322 (1961)","journal-title":"Commun. ACM"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<143::AID-RSA7>3.0.CO;2-V","volume":"10","author":"P Kirschenhofer","year":"1997","unstructured":"Kirschenhofer, P., Prodinger, H., Mart\u00ednez, C.: Analysis of Hoare\u2019s FIND algorithm with Median-of-Three partition. Random Struct. Alg. 10, 143\u2013156 (1997)","journal-title":"Random Struct. Alg."},{"key":"20_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24685-5_1","volume-title":"ICCS 2004","author":"R Rabenseifner","year":"2004","unstructured":"Rabenseifner, R.: Optimization of collective reduction operations. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2004. LNCS, vol. 3036, pp. 1\u20139. Springer, Heidelberg (2004)"},{"key":"20_CR8","series-title":"LNCS","first-page":"1","volume-title":"EuroMPI 2010","author":"P Sack","year":"2010","unstructured":"Sack, P., Gropp, W.: A scalable $${\\rm MPI}\\_{\\rm Comm}\\_{\\rm split}$$ algorithm for exascale computing. In: Keller, R., Gabriel, E., Resch, M., Dongarra, J. (eds.) EuroMPI 2010. LNCS, vol. 6305, pp. 1\u201310. Springer, Heidelberg (2010)"},{"key":"20_CR9","series-title":"LNCS","first-page":"49","volume-title":"PVM\/MPI 2006","author":"P Sanders","year":"2006","unstructured":"Sanders, P., Tr\u00e4ff, J.L.: Parallel Prefix (Scan) algorithms for MPI. In: Mohr, B., Tr\u00e4ff, J.L., Worringen, J., Dongarra, J. (eds.) PVM\/MPI 2006. LNCS, vol. 4192, pp. 49\u201357. Springer, Heidelberg (2006)"},{"key":"20_CR10","series-title":"LNCS","first-page":"170","volume-title":"EuroMPI 2011","author":"C Siebert","year":"2011","unstructured":"Siebert, C., Wolf, F.: Parallel sorting with minimal data. In: Cotronis, Y., Danalis, A., Nikolopoulos, D.S., Dongarra, J. (eds.) EuroMPI 2011. LNCS, vol. 6960, pp. 170\u2013177. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55224-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T23:02:00Z","timestamp":1675810920000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-55224-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642552236","9783642552243"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55224-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"6 May 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}