{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T07:32:57Z","timestamp":1648625577403},"reference-count":9,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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 Sciences"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1016\/0020-0255(94)90047-7","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"39-49","source":"Crossref","is-referenced-by-count":1,"title":["Recursive binary tree layout mixing"],"prefix":"10.1016","volume":"77","author":[{"given":"Sourav","family":"Bhattacharya","sequence":"first","affiliation":[]},{"given":"Wei-Tek","family":"Tsai","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(94)90047-7_BIB1","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0020-0190(80)90034-4","article-title":"On the area of binary tree layouts","volume":"11","author":"Brent","year":"1980","journal-title":"Information Processing Letters"},{"key":"10.1016\/0020-0255(94)90047-7_BIB2","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1109\/TC.1987.5009532","article-title":"Efficient embeddings of binary trees in VLSI arrays","volume":"C-36","author":"Gordon","year":"1987","journal-title":"IEEE Trans. on Computers"},{"key":"10.1016\/0020-0255(94)90047-7_BIB3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0020-0190(87)90045-7","article-title":"Optimal three-dimensional layouts of complete binary trees","volume":"26","author":"Gupta","year":"1987","journal-title":"Information Processing Letters"},{"key":"10.1016\/0020-0255(94)90047-7_BIB4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1109\/TC.1981.1675772","article-title":"The binary tree as an interconnection network: Applications to multiprocessor systems and VLSI","volume":"C-30","author":"Horowitz","year":"1981","journal-title":"IEEE Trans. on Computers"},{"key":"10.1016\/0020-0255(94)90047-7_BIB5","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1109\/12.2192","article-title":"A reconfiguration scheme for yield enhancement of large area binary tree architectures","volume":"37","author":"Howells","year":"1988","journal-title":"IEEE Trans. on Computers"},{"key":"10.1016\/0020-0255(94)90047-7_BIB6","series-title":"Proc. 13th Annual Int'l. Symp. Computer Architecture","first-page":"49","article-title":"Memory requirements for balanced computer architectures","author":"Kung","year":"1986"},{"key":"10.1016\/0020-0255(94)90047-7_BIB7","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/BF01762128","article-title":"Optimal VLSI graph embeddings in variable aspect ratio rectangles","volume":"3","author":"Czerwinski","year":"1988","journal-title":"Algorithmica"},{"issue":"9","key":"10.1016\/0020-0255(94)90047-7_BIB8","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1109\/TC.1985.1676640","article-title":"An efficient unsorted VLSI dictionary machine","volume":"C-34","author":"Somani","year":"1985","journal-title":"IEEE Trans. on Computers"},{"key":"10.1016\/0020-0255(94)90047-7_BIB9","series-title":"Proc. Int'l. Conf. on Parallel Processing","first-page":"170","article-title":"On area efficient and fault tolerant tree embedding in VLSI","author":"Youn","year":"1987"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025594900477?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025594900477?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:51:21Z","timestamp":1552917081000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025594900477"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":9,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0020025594900477"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(94)90047-7","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}