{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T02:45:43Z","timestamp":1649213143689},"reference-count":10,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1016\/0167-8191(90)90064-g","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"273-278","source":"Crossref","is-referenced-by-count":0,"title":["Parallel sorting with cooperating heaps in a linear array of processors"],"prefix":"10.1016","volume":"16","author":[{"given":"Yen-Chun","family":"Lin","sequence":"first","affiliation":[]},{"given":"Ferng-Ching","family":"Lin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(90)90064-G_BIB1","series-title":"Parallel Sorting Algorithms","author":"Akl","year":"1985"},{"key":"10.1016\/0167-8191(90)90064-G_BIB2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0167-8191(86)90003-7","article-title":"Systolic sorting in a sequential input\/output environment","volume":"3","author":"Akl","year":"1986","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(90)90064-G_BIB3","series-title":"The Design and Analysis of Parallel Algorithms","author":"Akl","year":"1989"},{"key":"10.1016\/0167-8191(90)90064-G_BIB4","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1978"},{"key":"10.1016\/0167-8191(90)90064-G_BIB5","author":"Inmos","year":"1988"},{"key":"10.1016\/0167-8191(90)90064-G_BIB6","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."},{"key":"10.1016\/0167-8191(90)90064-G_BIB7","series-title":"Tech. Rep. No. CMU-CS-79-115","article-title":"Systolic priority queues","author":"Leiserson","year":"1979"},{"key":"10.1016\/0167-8191(90)90064-G_BIB8","unstructured":"F.C. Lin and J.C. Shieh, Space and time complexities of balanced sorting on processor arrays, to appear in J. Complexity."},{"key":"10.1016\/0167-8191(90)90064-G_BIB9","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1147\/rd.272.0140","article-title":"A \u2018zero-time\u2019 VLSI sorter","volume":"27","author":"Miranker","year":"1983","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0167-8191(90)90064-G_BIB10","series-title":"Designing Efficient Algorithms for Parallel Computers","author":"Quinn","year":"1987"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090064G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090064G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:26:29Z","timestamp":1551086789000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919090064G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":10,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["016781919090064G"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(90)90064-g","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}