{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:15:09Z","timestamp":1649074509826},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1981,4,1]],"date-time":"1981-04-01T00:00:00Z","timestamp":354931200000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1981,4]]},"DOI":"10.1016\/0020-0190(81)90008-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"83-88","source":"Crossref","is-referenced-by-count":2,"title":["A layout for the shuffle-exchange network with \u0398(N2\u29f8log N) area"],"prefix":"10.1016","volume":"12","author":[{"given":"David","family":"Steinberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Rodeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(81)90008-9_BIB1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","article-title":"Parallel processing with the perfect shuffle","volume":"C-20","author":"Stone","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(81)90008-9_BIB2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1109\/TC.1976.5009205","article-title":"Interconnections between processing and memory modules using the shuffle-exchange network","volume":"C-25","author":"Lang","year":"1976","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(81)90008-9_BIB3","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1109\/T-C.1975.224157","article-title":"Access and alignment of data in an array processor","volume":"C-24","author":"Lawrie","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(81)90008-9_BIB4","series-title":"A self-routing Benes network and parallel permutation algorithms","author":"Nassimi","year":"1979"},{"issue":"4","key":"10.1016\/0020-0190(81)90008-9_BIB5","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/357114.357116","article-title":"Ultracomputers","volume":"2","author":"Schwartz","year":"1980","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0020-0190(81)90008-9_BIB6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1109\/TC.1980.1675553","article-title":"Notes on shuffle\/exchange-type networks","volume":"C-29","author":"Parker","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(81)90008-9_BIB7","series-title":"Ph.D. Thesis","article-title":"A complexity theory for VLSI","author":"Thompson","year":"1980"},{"key":"10.1016\/0020-0190(81)90008-9_BIB8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1145\/800135.804401","article-title":"Area-time complexity for VLSI","author":"Thompson","year":"1979","journal-title":"Proc. 11th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0020-0190(81)90008-9_BIB9","series-title":"An O(N2\u29f8log N) layout of the shuffle-exchange network","author":"Steinberg","year":"1980"},{"key":"10.1016\/0020-0190(81)90008-9_BIB10","first-page":"329","article-title":"A layout for the shuffle-exchange network","author":"Hoey","year":"1980","journal-title":"Proc. the 1980 Internat. Conference on Parallel Processing"},{"key":"10.1016\/0020-0190(81)90008-9_BIB11","series-title":"A layout for the shuffle-exchange network with \u0398(N2\u29f8log32 N) area","author":"Steinberg","year":"1980"},{"key":"10.1016\/0020-0190(81)90008-9_BIB12","series-title":"Addendum to CMU-CS-80-139","author":"Hoey","year":"1980"},{"key":"10.1016\/0020-0190(81)90008-9_BIB13","author":"Leighton","year":"1980","journal-title":"personal communication"},{"key":"10.1016\/0020-0190(81)90008-9_BIB14","series-title":"Proc. 20th Annual Symposium on Foundations of Computer Science","article-title":"The cube connected cycles: a versatile network for parallel computation","author":"Preparata","year":"1979"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019081900089?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019081900089?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:52:11Z","timestamp":1555087931000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019081900089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,4]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,4]]}},"alternative-id":["0020019081900089"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(81)90008-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1981,4]]}}}