{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:23:50Z","timestamp":1757629430477,"version":"3.44.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1989,2]]},"DOI":"10.1016\/0743-7315(89)90047-6","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"151-165","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["Two nearly optimal sorting algorithms for mesh-connected processor arrays using shear-sort"],"prefix":"10.1016","volume":"6","author":[{"given":"Isaac D.","family":"Scherson","sequence":"first","affiliation":[]},{"given":"Sandeep","family":"Sen","sequence":"additional","affiliation":[]},{"given":"Yiming","family":"Ma","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0743-7315(89)90047-6_BIB1","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. the ACM"},{"issue":"1","key":"10.1016\/0743-7315(89)90047-6_BIB2","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."},{"key":"10.1016\/0743-7315(89)90047-6_BIB3","series-title":"Proc. of the 18th Annual ACM Symp. on Theory of Computing (STOC)","first-page":"255","article-title":"An optimal sorting algorithm for mesh connected computers","author":"Schnorr","year":"1986"},{"issue":"7","key":"10.1016\/0743-7315(89)90047-6_BIB4","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1109\/TC.1985.1676603","article-title":"Systolic sorting on a mesh connected network","volume":"C-34","author":"Lang","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/0743-7315(89)90047-6_BIB5","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\/0743-7315(89)90047-6_BIB6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TC.1981.6312172","article-title":"Data broadcasting in SIMD computers","volume":"C-30","author":"Nassimi","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(89)90047-6_BIB7","unstructured":"Scherson, I. D., Sen, S., and Shamir, A. Shear-sort: A true two dimensional sorting technique for VLSI networks. Proc. of the 1986 International Conference on Parallel Processing, pp. 903\u2013908."},{"article-title":"A Characterization of a Parallel Row-Column Sorting Technique for Rectangular Arrays","year":"1985","author":"Scherson","key":"10.1016\/0743-7315(89)90047-6_BIB8"},{"year":"1973","author":"Knuth","key":"10.1016\/0743-7315(89)90047-6_BIB9"},{"issue":"2","key":"10.1016\/0743-7315(89)90047-6_BIB10","doi-asserted-by":"crossref","DOI":"10.1109\/TPAMI.1985.4767645","article-title":"Geometric algorithms for digitized pictures on a mesh-connected computer","volume":"PAMI-7","author":"Miller","year":"1985","journal-title":"IEEE Trans. PAMI"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900476?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900476?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:28:17Z","timestamp":1757514497000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731589900476"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,2]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,2]]}},"alternative-id":["0743731589900476"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(89)90047-6","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1989,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Two nearly optimal sorting algorithms for mesh-connected processor arrays using shear-sort","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(89)90047-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}