{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T14:02:54Z","timestamp":1648735374394},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3850,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0304-3975(02)00321-3","type":"journal-article","created":{"date-parts":[[2003,2,5]],"date-time":"2003-02-05T01:51:53Z","timestamp":1044409913000},"page":"1829-1850","source":"Crossref","is-referenced-by-count":0,"title":["Faster deterministic sorting through better sampling"],"prefix":"10.1016","volume":"290","author":[{"given":"Jop F.","family":"Sibeyn","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"9","key":"10.1016\/S0304-3975(02)00321-3_BIB1","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","article-title":"The input\/output complexity of sorting and related problems","volume":"31","author":"Aggarwal","year":"1988","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(02)00321-3_BIB2","doi-asserted-by":"crossref","unstructured":"P. Berthom\u00e9, A. Ferreira, B.M. Maggs, S. Perennes, C.G. Plaxton, Sorting-based selection algorithms for hypercubic networks, Proc. 7th Internat. Parallel Processing Symp., IEEE, New York, 1993, pp. 89\u201395.","DOI":"10.1109\/IPPS.1993.262861"},{"key":"10.1016\/S0304-3975(02)00321-3_BIB3","doi-asserted-by":"crossref","unstructured":"G.E. Blelloch, C.E. Leiserson, B.M. Maggs, C.G. Plaxton, S.J. Smith, M. Zagha, A comparison of sorting algorithms for the Connection Machine CM-2, Proc. Symp. on Parallel Algorithms and Architectures, ACM, New York, 1991, pp. 3\u201316.","DOI":"10.1145\/113379.113380"},{"key":"10.1016\/S0304-3975(02)00321-3_BIB4","doi-asserted-by":"crossref","unstructured":"S. Chaudhuri, T. Hagerup, R. Raman, Approximate and exact deterministic parallel selection, Proc. 18th Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 711, Springer, Berlin, 1993, pp. 352\u2013361.","DOI":"10.1007\/3-540-57182-5_27"},{"key":"10.1016\/S0304-3975(02)00321-3_BIB5","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/S0304-3975(02)00321-3_BIB6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0020-0190(85)90080-8","article-title":"A Parallel Median Algorithm","volume":"20","author":"Cole","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(02)00321-3_BIB7","doi-asserted-by":"crossref","unstructured":"R. Diekmann, J. Gehring, R. L\u00fcling, B. Monien, M. N\u00fcbel, R. Wanka, Sorting large data sets on a massively parallel system, Proc. 6th Symp. on Parallel and Distributed Processing, IEEE, New York, 1994, pp. 2\u20139.","DOI":"10.1109\/SPDP.1994.346188"},{"issue":"3","key":"10.1016\/S0304-3975(02)00321-3_BIB8","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1145\/321592.321600","article-title":"Samplesort","volume":"17","author":"Frazer","year":"1970","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(02)00321-3_BIB9","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1006\/jpdc.1994.1085","article-title":"Direct bulk-synchronous parallel algorithms","volume":"22","author":"Gerbessiotis","year":"1994","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0304-3975(02)00321-3_BIB10","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","article-title":"A guided tour of chernoff bounds","volume":"33","author":"Hagerup","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(02)00321-3_BIB11","doi-asserted-by":"crossref","unstructured":"W.L. Hightower, J.F. Prins, J.H. Reif, Implementations of randomized sorting on large parallel machines, Proc. 4th Symp. on Parallel Algorithms and Architectures, ACM, New York, 1992, pp. 158\u2013167.","DOI":"10.1145\/140901.140918"},{"key":"10.1016\/S0304-3975(02)00321-3_BIB12","doi-asserted-by":"crossref","unstructured":"C. Kaklamanis, D. Krizanc, L. Narayanan, Th. Tsantilas, Randomized sorting and selection on mesh connected processor arrays, Proc. 3rd Symp. on Parallel Algorithms and Architectures, ACM, New York, 1991, pp. 17\u201328.","DOI":"10.1145\/113379.113381"},{"key":"10.1016\/S0304-3975(02)00321-3_BIB13","doi-asserted-by":"crossref","unstructured":"M. Kaufmann, S. Rajasekaran, J.F. Sibeyn, Matching the bisection bound for routing and sorting on the mesh, Proc. 4th Symp. on Parallel Algorithms and Architectures, ACM, New York, 1992, pp. 31\u201340.","DOI":"10.1145\/140901.140905"},{"key":"10.1016\/S0304-3975(02)00321-3_BIB14","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/BF02523190","article-title":"Randomized multipacket routing and sorting on meshes","volume":"17","author":"Kaufmann","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(02)00321-3_BIB15","unstructured":"M. Kaufmann, J.F. Sibeyn, T. Suel, Derandomizing algorithms for routing and sorting on meshes, Proc. 5th Symp. on Discrete Algorithms, ACM\u2013SIAM, New York\u2013Philadelphia, PA, 1994, pp. 669\u2013679."},{"key":"10.1016\/S0304-3975(02)00321-3_BIB16","doi-asserted-by":"crossref","unstructured":"M. Kunde, Block gossiping on grids and tori: deterministic sorting and routing match the bisection bound, Proc. 1st European Symp. on Algorithms, Lecture Notes in Computer Science, Vol. 726, Springer, Berlin, 1993, pp. 272\u2013283.","DOI":"10.1007\/3-540-57273-2_62"},{"issue":"4","key":"10.1016\/S0304-3975(02)00321-3_BIB17","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/TC.1985.5009385","article-title":"Tight bounds on the complexity of parallel sorting","volume":"C-34","author":"Leighton","year":"1985","journal-title":"IEEE Trans. on Comput."},{"key":"10.1016\/S0304-3975(02)00321-3_BIB18","doi-asserted-by":"crossref","unstructured":"T. Leighton, Average case analysis of greedy routing algorithms on arrays, Proc. 2nd Symp. on Parallel Algorithms and Architectures, ACM, New York, 1990, pp. 2\u201310.","DOI":"10.1145\/97444.97448"},{"key":"10.1016\/S0304-3975(02)00321-3_BIB19","series-title":"Introduction to Parallel Algorithms and Architectures","author":"Leighton","year":"1991"},{"key":"10.1016\/S0304-3975(02)00321-3_BIB20","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/7531.7532","article-title":"A logarithmic time sort for linear size networks","volume":"34","author":"Reif","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(02)00321-3_BIB21","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1137\/0214030","article-title":"Probabilistic parallel algorithms for sorting and selection","volume":"14","author":"Reischuk","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00321-3_BIB22","doi-asserted-by":"crossref","unstructured":"C.P. Schnorr, A. Shamir, An optimal sorting algorithm for mesh connected computers, Proc. 18th Symp. on Theory of Comput., ACM, New York, 1986, pp. 255\u2013263.","DOI":"10.1145\/12130.12156"},{"issue":"3","key":"10.1016\/S0304-3975(02)00321-3_BIB23","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1137\/S009753979427011X","article-title":"Row-major sorting on meshes","volume":"28","author":"Sibeyn","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00321-3_BIB24","unstructured":"J.F. Sibeyn, Sample sort on meshes, Technical Report MPI-I-95-1012, Max-Planck Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany, 1995."},{"key":"10.1016\/S0304-3975(02)00321-3_BIB25","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1137\/0211027","article-title":"A scheme for fast parallel communication","volume":"11","author":"Valiant","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00321-3_BIB26","doi-asserted-by":"crossref","unstructured":"A. Wachsmann, R. Wanka, Sorting on a massively parallel system using a library of basic primitives: modeling and experimental results, Proc. 3rd Internat. Euro-Par Conf., Lecture Notes in Computer Science, Vol. 1300, Springer, Berlin, 1997, pp. 399\u2013408.","DOI":"10.1007\/BFb0002763"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502003213?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502003213?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T08:59:19Z","timestamp":1583744359000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502003213"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0304397502003213"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00321-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}