{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T22:40:08Z","timestamp":1736116808631,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634409"},{"type":"electronic","value":"9783540695493"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0002762","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T12:29:42Z","timestamp":1132748982000},"page":"389-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Sample sort on meshes"],"prefix":"10.1007","author":[{"given":"Jop F.","family":"Sibeyn","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,26]]},"reference":[{"key":"50_CR1","doi-asserted-by":"crossref","unstructured":"Blelloch, G. E., C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. J. Smith, M. Zagha, \u2018A Comparison of Sorting Algorithms for the Connection Machine CM-2,\u2019 Proc. 3rd SPAA, pp. 3\u201316. ACM, 1991.","DOI":"10.1145\/113379.113380"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Berthom\u00e9, P., A. Ferreira, B.M. Maggs, S. Perennes, C.G. Plaxton, 'sorting-Based Selection Algorithms for Hypercubic Networks,\u2019 Proc. 7th IPPS, pp. 89\u201395, IEEE, 1993.","DOI":"10.1109\/IPPS.1993.262861"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., T Hagerup, R. Raman, \u2018Approximate and Exact Deterministic Parallel Selection,\u2019 Proc. 18th MFCS, LNCS 711, pp. 352\u2013361, Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57182-5_27"},{"key":"50_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0020-0190(85)90080-8","volume":"20","author":"C. Cole","year":"1985","unstructured":"Cole, C., C.K. Yap, \u2018A Parallel Median Algorithm,\u2019 IPL, 20, pp. 137\u2013139,1985.","journal-title":"IPL"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Diekmann, R., J. Gehring, R. L\u00fcling, B. Monien M. N\u00fcbel, R. Wanka, 'sorting Large Data Sets on a Massively Parallel System,\u2019 Proc. 6th SPDP, pp. 2\u20139, IEEE, 1994.","DOI":"10.1109\/SPDP.1994.346188"},{"key":"50_CR6","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T. Hagerup","year":"1990","unstructured":"Hagerup, T., C. Rob, \u2018A Guided Tour of Chemoff Bounds,\u2019 Inf. Proc. Lett. 33, 305\u2013308, 1990.","journal-title":"Inf. Proc. Lett."},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Hightower, W.L., J.F. Prins, J.H. Reif, \u2018Implementations of Randomized Sorting on Large Parallel Machines,\u2019 Proc. 4th Symp. on Parallel Algorithms and Architectures, pp. 158\u2013167, ACM, 1992.","DOI":"10.1145\/140901.140918"},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"Kaklamanis, C., D. Krizanc, L. Narayanan, Th. Tsantilas, \u2018Randomized Sorting and Selection on Mesh Connected Processor Arrays,\u2019 Proc. 3rd SPAA, pp. 17\u201328, ACM, 1991.","DOI":"10.1145\/113379.113381"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., S. Rajasekaran, J.F. Sibeyn, \u2018Matching the Bisection Bound for Routing and Sorting on the Mesh,\u2019 Proc. 4th Symp. on Parallel Algorithms and Architectures, pp. 31\u201340, ACM, 1992.","DOI":"10.1145\/140901.140905"},{"key":"50_CR10","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/BF02523190","volume":"17","author":"M. Kaufmann","year":"1997","unstructured":"Kaufmann, M., J.F. Sibeyn, \u2018Randomized Multipacket Routing and Sorting on Meshes,\u2019 Algorithinica, 17, pp. 224\u2013244, 1997.","journal-title":"Algorithinica"},{"key":"50_CR11","unstructured":"Kaufmann, M., J.F. Sibeyn, T Suel, \u2018Derandomizing Algorithms for Routing and Sorting on Meshes,\u2019 Proc. 5th Symp. on Discrete Algorithms, pp. 669\u2013679 ACM-SIAM, 1994."},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"Kunde, M., \u2018Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound,\u2019 Proc. 1st ESA, LNCS 726, pp. 272\u2013283, Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57273-2_62"},{"issue":"4","key":"50_CR13","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1109\/TC.1985.5009385","volume":"C-34","author":"FT Leighton","year":"1985","unstructured":"Leighton, FT, \u2018Tight Bounds on the Complexity of Parallel Sorting,\u2019 IEEE Transactions on Computers, C-34(4), pp. 344\u2013354,1985.","journal-title":"IEEE Transactions on Computers"},{"key":"50_CR14","doi-asserted-by":"crossref","unstructured":"Leighton, T., \u2018Average Case Analysis of Greedy Routing Algorithms on Arrays,\u2019 Proc. 2nd Syrnp. on Parallel Algorithms and Architectures, pp. 2\u201310, ACM, 1990.","DOI":"10.1145\/97444.97448"},{"key":"50_CR15","doi-asserted-by":"crossref","unstructured":"Leighton, FT, Introduction to Parallel Algorithms andArchitectures: Arrays, Trees and Hypercubes, Morgan Kaufmann,1991.","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"issue":"1","key":"50_CR16","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/7531.7532","volume":"34","author":"J.H. Reif","year":"1987","unstructured":"Reif, J.H., L.G. Valiant, \u2018A logarithmic time sort for linear size networks,\u2019 Journal of the ACM, 34(1), pp. 68\u201376, 1987.","journal-title":"Journal of the ACM"},{"key":"50_CR17","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1137\/0214030","volume":"14","author":"R. Reischuk","year":"1985","unstructured":"Reischuk, R., \u2018Probabilistic Parallel Algorithms for Sorting and Selection,\u2019 SIAM Journal of Compttting, 14, pp. 396\u2013411, 1985.","journal-title":"SIAM Journal of Compttting"},{"key":"50_CR18","doi-asserted-by":"crossref","unstructured":"Schnorr, C.P., A. Shamir, 'sAn Optimal Sorting Algorithm for Mesh Connected Computers', Proc. 18th Symp. on Theory of Computing, pp. 255\u2013263, ACM, 1986.","DOI":"10.1145\/12130.12156"},{"key":"50_CR19","doi-asserted-by":"crossref","unstructured":"Sibeyn, J.F, \u2018Desnakification of Mesh Sorting Algorithms,\u2019 accepted 9-1996 for SIAM Journal on Computing. Preliminary version in Proc. 2nd European Symp. on Algorithms, LNCS 855, pp. 377-390, Springer-Verlag, 1994. Full version in Techn. Rep. MPI-1-94-102, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken,Germany, 1994.","DOI":"10.1007\/BFb0049424"},{"key":"50_CR20","unstructured":"Sibeyn, J.F, 'sample Sort on Meshes,\u2019 Techn. Rep. MPI-1-95-1012, Max-Planck Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany, 1995."},{"key":"50_CR21","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1137\/0211027","volume":"11","author":"L. G. Valiant","year":"1982","unstructured":"Valiant, L. G.. \u2018A Scheme for Fast Parallel Communication,\u2019 SIAM Journal on Computing, 11, pp. 350\u2013361,1982. *** DIRECT SUPPORT *** A0008C42 00014","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'97 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0002762","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T22:01:59Z","timestamp":1736114519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0002762"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634409","9783540695493"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0002762","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"26 September 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}