{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T10:41:12Z","timestamp":1757587272563,"version":"3.41.2"},"reference-count":9,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[1983,7,1]],"date-time":"1983-07-01T00:00:00Z","timestamp":425865600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1983,7,1]],"date-time":"1983-07-01T00:00:00Z","timestamp":425865600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1983,7,1]],"date-time":"1983-07-01T00:00:00Z","timestamp":425865600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1983,7]]},"DOI":"10.1109\/tc.1983.1676299","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"677-683","source":"Crossref","is-referenced-by-count":11,"title":["The Analysis and Design of Some New Sorting Machines"],"prefix":"10.1109","volume":"C-32","author":[{"family":"Winslow","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Dayton"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Yuan-Chieh Chow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","volume":"3","author":"knuth","year":"1973","journal-title":"The art of computer programming"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/321592.321600"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1978.1675200"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321882"},{"key":"ref8","first-page":"259","article-title":"a highly concurrent tree machine for data base applications","author":"song","year":"1980","journal-title":"Proc 1980 Int Conf Parallel Processing"},{"journal-title":"Elements of Queueing Theory","year":"1961","author":"saaty","key":"ref7"},{"key":"ref2","first-page":"312","article-title":"the rebound sorter: an efficient sort engine for large files","author":"chen","year":"1978","journal-title":"Proc 1978 Int Conf Very Large Data Bases"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1500412.1500434"},{"key":"ref1","first-page":"307","article-title":"sorting networks and their applications","volume":"32","author":"batcher","year":"1968","journal-title":"Proc 1968 SJCC AFIPS"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35229\/01676299.pdf?arnumber=1676299","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:04:43Z","timestamp":1753121083000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1676299\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,7]]},"references-count":9,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tc.1983.1676299","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"type":"print","value":"0018-9340"},{"type":"electronic","value":"1557-9956"},{"type":"electronic","value":"2326-3814"}],"subject":[],"published":{"date-parts":[[1983,7]]}}}