{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T16:58:42Z","timestamp":1694624322721},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[1989,7,1]],"date-time":"1989-07-01T00:00:00Z","timestamp":615254400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1989,7]]},"DOI":"10.1109\/12.30857","type":"journal-article","created":{"date-parts":[[2002,8,24]],"date-time":"2002-08-24T20:26:37Z","timestamp":1030220797000},"page":"1052-1056","source":"Crossref","is-referenced-by-count":2,"title":["Systolic s\/sup 2\/-way merge sort is optimal"],"prefix":"10.1109","volume":"38","author":[{"given":"H.","family":"Schmeck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Schroder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Starke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.1676603"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675216"},{"key":"ref12","author":"sado","year":"1985","journal-title":"A fast parallel sort on a mesh-connected processor array"},{"key":"ref13","author":"sado","year":"1985","journal-title":"A fast parallel pseudo-merge sort algorithm"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12156"},{"key":"ref15","year":"0"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223205"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/359461.359481"},{"key":"ref4","author":"knuth","year":"1973","journal-title":"The Art of Computer Programming Vol 3 Sorting and Searching"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1980.1653338"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264359"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676217"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1982.1653825"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(88)90095-6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1972.5009071"},{"key":"ref1","first-page":"307","article-title":"Sorting networks and their applications","volume":"32","author":"batcher","year":"0","journal-title":"Proc AFIPS 1968 SJCC"},{"key":"ref9","first-page":"256","article-title":"Systolic arrays (for VLSI)","author":"kung","year":"1978","journal-title":"Sparse Matrix Proceedings"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx1\/12\/1327\/00030857.pdf?arnumber=30857","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:23:16Z","timestamp":1642004596000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/30857\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,7]]},"references-count":17,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/12.30857","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[1989,7]]}}}