{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T21:40:28Z","timestamp":1734126028938,"version":"3.30.2"},"reference-count":25,"publisher":"Informa UK Limited","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1080\/00207160304673","type":"journal-article","created":{"date-parts":[[2003,9,18]],"date-time":"2003-09-18T22:32:58Z","timestamp":1063924378000},"page":"165-179","source":"Crossref","is-referenced-by-count":3,"title":["Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers"],"prefix":"10.1080","volume":"80","author":[{"given":"Hong","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yijie","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Evans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","first-page":"19","author":"Akl S. G.","year":"1984","journal-title":"Information Processing Letters"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80033-9"},{"key":"CIT0003","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Hagerup, T. and Raman, R. Approximate and exact deterministic parallel selection. Proc. Mathematical Foundations of Computer Science. 1993. Springer-Verlag.","DOI":"10.1007\/3-540-57182-5_27"},{"key":"CIT0004","unstructured":"Chen, G. L. and Shen, H. Bitonic selection algorithm on simd machines. Proc. 2nd Intern. Conference on Computers and Applications. pp.176\u2013182. IEEE CS Press."},{"key":"CIT0005","first-page":"1","volume":"24","author":"Chen G. L.","year":"1987","journal-title":"Computer Studies and Development"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90080-8"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90186-X"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(87)90016-X"},{"key":"CIT0009","first-page":"540","volume":"26","author":"Fussenegger F.","year":"1979","journal-title":"J. Asso. Comput Mach."},{"key":"CIT0010","first-page":"114","volume":"5","author":"Hyafil L.","year":"1976","journal-title":"SIAMJ. Compta."},{"key":"CIT0011","doi-asserted-by":"crossref","unstructured":"Batcher, K. E. Sorting networks and their applications. Proc. AFIPS 1968 Spring Joint Computer Conference. pp.307\u2013314. AFIPS Press.","DOI":"10.1145\/1468075.1468121"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322245"},{"key":"CIT0013","doi-asserted-by":"crossref","unstructured":"Krizanc, D. and Narayanan, L. Multiple-packet selection on mesh-connected processor arrays. Proc. 1992 Intern. Parallel Processing Symp. (IPPS'92}. pp.602\u2013605. IEEE CS Press.","DOI":"10.1109\/IPPS.1992.222999"},{"key":"CIT0014","doi-asserted-by":"crossref","unstructured":"Kunde, M. Routing and sorting on mesh-connected architectures. Proc. Agean Workshop on Computing: VLSI algorithms and architectures. pp.423\u2013433. Lecture Notes on Computer Science","DOI":"10.1007\/BFb0040409"},{"key":"CIT0015","first-page":"129","volume":"2","author":"Kunde M.","year":"1989","journal-title":"J. of New Generation Computer Systems"},{"key":"CIT0016","series-title":"Technical Report STAN\/\/CS-TR89-1276","volume-title":"On the network complexity of selection","author":"Plaxton C. G.","year":"1989"},{"volume-title":"On lower bounds for computing the ith largest element","year":"1973","author":"Pratt V R.","key":"CIT0017"},{"key":"CIT0018","doi-asserted-by":"crossref","unstructured":"Schnorr, C. and Shamir, A. An optimal sorting algorithm for mesh-connected computers. Proc. 1996 Symp. Theory of Computing (STOC'86}. pp.255\u2013263. ACM.","DOI":"10.1145\/12130.12156"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80029-3"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(92)90076-J"},{"key":"CIT0021","unstructured":"Shen, H. Efficient parallel multiselection in hypercubes. In: Proc. 1997 Intern. Symp. on Parallel Architectures, Algorithms and Networks (I-SPAN'97}. IEEE CS Press. page to appear"},{"key":"CIT0022","first-page":"287","volume":"188","author":"Shen H.","year":"1997","journal-title":"Parallel Computing"},{"key":"CIT0023","first-page":"88","volume":"13","author":"Shen H.","year":"1990","journal-title":"Chinese Journal of Computers"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223205"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1145\/360336.360339"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160304673","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T20:59:54Z","timestamp":1734123594000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207160304673"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["10.1080\/00207160304673"],"URL":"https:\/\/doi.org\/10.1080\/00207160304673","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"type":"print","value":"0020-7160"},{"type":"electronic","value":"1029-0265"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}