{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T22:14:12Z","timestamp":1649196852454},"reference-count":7,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1986,5,1]],"date-time":"1986-05-01T00:00:00Z","timestamp":515289600000},"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":[[1986,5]]},"DOI":"10.1016\/0020-0190(86)90067-0","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"285-289","source":"Crossref","is-referenced-by-count":3,"title":["On recurrent and recursive interconnection patterns"],"prefix":"10.1016","volume":"22","author":[{"given":"Ian","family":"Parberry","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90067-0_BIB1","series-title":"Tech. Rept. IW118\/79","article-title":"Recurrent ultracomputers are not (log n)-fast","author":"Meertens","year":"1979"},{"key":"10.1016\/0020-0190(86)90067-0_BIB2","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF00265559","article-title":"Efficiency of universal parallel computers","volume":"19","author":"Meyer auf der Heide","year":"1983","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(86)90067-0_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(83)90001-7","article-title":"Infinite cube-connected cycles","volume":"16","author":"Meyer auf der Heide","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(86)90067-0_BIB4","article-title":"A complexity theory of parallel computation","author":"Parberry","year":"1984"},{"issue":"5","key":"10.1016\/0020-0190(86)90067-0_BIB5","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","article-title":"The cube-connected cycles: A versatile network for parallel computation","volume":"24","author":"Preparata","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(86)90067-0_BIB6","series-title":"Proc. 15th Ann. ACM Symp. on Theory of Computing","first-page":"10","article-title":"A logarithmic time sort for linear size networks","author":"Reif","year":"1983"},{"issue":"2","key":"10.1016\/0020-0190(86)90067-0_BIB7","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."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900670?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900670?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:30:05Z","timestamp":1553592605000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086900670"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,5]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1986,5]]}},"alternative-id":["0020019086900670"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90067-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,5]]}}}