{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:24:31Z","timestamp":1757543071822},"reference-count":16,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[1982,12,1]],"date-time":"1982-12-01T00:00:00Z","timestamp":407548800000},"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":[[1982,12]]},"DOI":"10.1109\/tc.1982.1675943","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T20:35:10Z","timestamp":1188938110000},"page":"1192-1201","source":"Crossref","is-referenced-by-count":48,"title":["The Parallel Enumeration Sorting Scheme for VLSI"],"prefix":"10.1109","volume":"C-31","author":[{"family":"Yasuura","sequence":"first","affiliation":[]},{"family":"Takagi","sequence":"additional","affiliation":[]},{"family":"Yajima","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"312","article-title":"the rebound sorter: an efficient sort engine for large files","author":"chen","year":"1978","journal-title":"Proc 4th VLDB"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1980.1675626"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675805"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1980.1653338"},{"key":"ref14","author":"mead","year":"1980","journal-title":"Introduction to VLSI Systems"},{"key":"ref15","first-page":"65","volume":"19","author":"kung","year":"1980","journal-title":"The Structure of Parallel Algorithms Advances in Computers"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675378"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321882"},{"key":"ref3","first-page":"307","article-title":"sorting networks and their applictions","volume":"32","author":"batcher","year":"1968","journal-title":"AFIPS Proc Spring Joint Comput Conf"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/359461.359481"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1978.1675167"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/359576.359582"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675216"},{"key":"ref2","author":"lorin","year":"1975","journal-title":"Sorting and Sort Systems"},{"key":"ref1","volume":"3","author":"knuth","year":"1973","journal-title":"The Art of Computer Programming Sorting and Searching"},{"key":"ref9","first-page":"427","article-title":"pipeline searching and sorting modules as components of a data flow database computer","author":"tanaka","year":"1980","journal-title":"Proc IFIP'80"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35211\/01675943.pdf?arnumber=1675943","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:39:58Z","timestamp":1638218398000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1675943\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":16,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tc.1982.1675943","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}