{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T07:03:14Z","timestamp":1751094194498},"reference-count":23,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Microprocessing and Microprogramming"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/0165-6074(94)90012-4","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T00:56:10Z","timestamp":1060304170000},"page":"487-497","source":"Crossref","is-referenced-by-count":1,"title":["Odd-even, compare-exchange parallel sorting"],"prefix":"10.1016","volume":"40","author":[{"given":"Stavros D.","family":"Nikolopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stylianos D.","family":"Danielopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0165-6074(94)90012-4_BIB1","series-title":"Proc. 15th Ann. Symp. on Theory of Computing","first-page":"1","article-title":"An O(n log n) sorting network","author":"Ajtal","year":"1983"},{"issue":"11","key":"10.1016\/0165-6074(94)90012-4_BIB2","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TC.1987.5009478","article-title":"Optimal parallel merging and sorting without memory conflicts","volume":"C-36","author":"Akl","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0165-6074(94)90012-4_BIB3","first-page":"307","article-title":"Sorting networks and their applications","volume":"Vol. 32","author":"Batcher","year":"1968"},{"issue":"2","key":"10.1016\/0165-6074(94)90012-4_BIB4","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0218014","article-title":"Adaptive bitonic sorting: An optimal parallel algorithm for shared-memory machines","volume":"18","author":"Bilardi","year":"1989","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0165-6074(94)90012-4_BIB5","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF00991635","article-title":"Simplified odd-even sort using multiple shift-register loops","volume":"7","author":"Chen","year":"1978","journal-title":"Int. J. Comput. Information Sci."},{"key":"10.1016\/0165-6074(94)90012-4_BIB6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(88)90092-0","article-title":"A parallel bucked sort","volume":"27","author":"Chlebus","year":"1988","journal-title":"Informat. Process. Lett."},{"key":"10.1016\/0165-6074(94)90012-4_BIB7","series-title":"Graph Theory","author":"Harary","year":"1969"},{"issue":"8","key":"10.1016\/0165-6074(94)90012-4_BIB8","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1145\/359576.359582","article-title":"Fast parallel sorting algorithms","volume":"21","author":"Hirschberg","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0165-6074(94)90012-4_BIB9","volume":"Vol. 3","author":"Knuth","year":"1973"},{"issue":"10","key":"10.1016\/0165-6074(94)90012-4_BIB10","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TC.1983.1676138","article-title":"Searching, merging and sorting in parallel computation","volume":"C-32","author":"Kruskal","year":"1983","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/0165-6074(94)90012-4_BIB11","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/TC.1983.1676217","article-title":"An efficient implementation of Batcher's odd-even merge algorithm and its application in parallel sorting schemes","volume":"C-32","author":"Kumar","year":"1983","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/0165-6074(94)90012-4_BIB12","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/TC.1981.1675805","article-title":"An on-chip compare\/steer bubble sorter","volume":"C-30","author":"Lee","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0165-6074(94)90012-4_BIB13","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. Comput."},{"issue":"1","key":"10.1016\/0165-6074(94)90012-4_BIB14","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TC.1979.1675216","article-title":"Bitonic sort on a mesh-connected parallel computer","volume":"C-27","author":"Nassimi","year":"1979","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/0165-6074(94)90012-4_BIB15","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1145\/322326.322329","article-title":"Parallel permutation and sorting algorithms and a new generalized connection network","volume":"29","author":"Nassimi","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0165-6074(94)90012-4_BIB16","series-title":"14th Int. Symp. on Mathematical Programming","article-title":"Parallel odd-even QuickSort","author":"Nikolopoulos","year":"1991"},{"issue":"5","key":"10.1016\/0165-6074(94)90012-4_BIB17","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","article-title":"The cube-connected cycles: A versatile network for parallel computation","volume":"24","author":"Preparata","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/0165-6074(94)90012-4_BIB18","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","article-title":"Finding the maximum, merging and sorting in a parallel computation model","volume":"2","author":"Shiloach","year":"1981","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/0165-6074(94)90012-4_BIB19","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","article-title":"Parallel processing with the perfect shuffle","volume":"C-20","author":"Stone","year":"1971","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0165-6074(94)90012-4_BIB20","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/359461.359481","article-title":"Sorting on a mesh-connected parallel computer","volume":"20","author":"Thompson","year":"1977","journal-title":"Comm. ACM"},{"issue":"3","key":"10.1016\/0165-6074(94)90012-4_BIB21","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1093\/comjnl\/27.3.260","article-title":"Parallel sorting on a re-circulating systolic sorter","volume":"27","author":"Wong","year":"1984","journal-title":"Comput. J."},{"issue":"12","key":"10.1016\/0165-6074(94)90012-4_BIB22","doi-asserted-by":"crossref","first-page":"1192","DOI":"10.1109\/TC.1982.1675943","article-title":"The parallel enumeration sorting scheme for VLSI","volume":"C-31","author":"Yasuura","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0165-6074(94)90012-4_BIB23","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF01952784","article-title":"Optimal parallel QuickSort on EREW PRAM","volume":"31","author":"Zhang","year":"1991","journal-title":"Bit"}],"container-title":["Microprocessing and Microprogramming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0165607494900124?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0165607494900124?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T21:53:44Z","timestamp":1552600424000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0165607494900124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":23,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0165607494900124"],"URL":"https:\/\/doi.org\/10.1016\/0165-6074(94)90012-4","relation":{},"ISSN":["0165-6074"],"issn-type":[{"value":"0165-6074","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}