{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:58:30Z","timestamp":1757541510724},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[1983,6,1]],"date-time":"1983-06-01T00:00:00Z","timestamp":423273600000},"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":[[1983,6]]},"DOI":"10.1109\/tc.1983.1676279","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T20:35:10Z","timestamp":1188938110000},"page":"569-581","source":"Crossref","is-referenced-by-count":84,"title":["Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees"],"prefix":"10.1109","volume":"C-32","author":[{"family":"Nath","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Maheshwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Bhatt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","first-page":"6","article-title":"a generalisation of the aanderaarosenberg conjecture","author":"rivest","year":"1975","journal-title":"Proc 7th Annu Symp Theory Comput Ass Comput Mach"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/359461.359481"},{"key":"ref31","author":"thompson","year":"0"},{"key":"ref30","author":"thompson","year":"1982","journal-title":"The VLSI complexity of sorting"},{"key":"ref10","author":"dekel","year":"1979","journal-title":"Parallel matrix and graph algorithms"},{"key":"ref11","author":"guibas","year":"1979","journal-title":"Direct VLSI implementation of combinatorial algorithms"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/359138.359141"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TAU.1968.1162002"},{"key":"ref14","first-page":"278","article-title":"new layouts for the shuffle-exchange graph","author":"kleitman","year":"1981","journal-title":"Proc 13th Ass Comput Mach Symp Theory Comput"},{"key":"ref15","article-title":"algorithms for vlsi processor arrays","author":"kung","year":"1978","journal-title":"Proc Symp Sparse Matrix Computat"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1981.22"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/361573.361576"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321882"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675216"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/357114.357116"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-68402-9_10"},{"key":"ref27","article-title":"area-time tradeoffs for matrix multiplication and transitive closure in the vlsi model","author":"savage","year":"1979","journal-title":"Proc 17th Annu Allerton Conf Commun Control Comput"},{"key":"ref3","author":"bentley","year":"1979","journal-title":"A tree machine for searching problems"},{"key":"ref6","first-page":"521","author":"brent","year":"1981","journal-title":"The area-time complexity of binary multiplication"},{"key":"ref29","author":"thompson","year":"1980","journal-title":"A Complexity Theory for VLSI"},{"key":"ref5","author":"brent","year":"1980","journal-title":"Some area-time trade offs for VLSI"},{"key":"ref8","author":"capello","year":"1981","journal-title":"Area-efficient VLSI structures for multiplying at clock rate"},{"key":"ref7","author":"browning","year":"0","journal-title":"Computation on a tree of processors"},{"key":"ref2","author":"bentley","year":"1979","journal-title":"a parallel algorithm for constructing minimum spanning trees"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802485"},{"key":"ref1","first-page":"307","article-title":"sorting networks and their applications","volume":"32","author":"batcher","year":"1968","journal-title":"Proc AFIPS SJCC"},{"key":"ref20","author":"nassimi","year":"1979","journal-title":"Parallel permutation and sorting algorithms and a new generalized-connection-network"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90131-4"},{"key":"ref21","author":"nath","year":"1982","journal-title":"Efficient VLSI networks and parallel algorithms based on them"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(80)90006-X"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1979.43"},{"key":"ref26","author":"savage","year":"1978","journal-title":"Fast efficient parallel algorithms for some graph problems"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223205"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35228\/01676279.pdf?arnumber=1676279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:40:06Z","timestamp":1638218406000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1676279\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,6]]},"references-count":33,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tc.1983.1676279","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[1983,6]]}}}