{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T15:49:37Z","timestamp":1649173777302},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,10,1]],"date-time":"1987-10-01T00:00:00Z","timestamp":560044800000},"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":[[1987,10]]},"DOI":"10.1016\/0020-0190(87)90045-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"99-104","source":"Crossref","is-referenced-by-count":8,"title":["Optimal three-dimensional layouts of complete binary trees"],"prefix":"10.1016","volume":"26","author":[{"given":"Ajay K.","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Susanne E.","family":"Hambrusch","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(87)90045-7_BIB1","first-page":"186","article-title":"Multi-layer grid embeddings","author":"Aggarwal","year":"1985","journal-title":"27th Ann. Symp. on Foundations of Computer Science"},{"issue":"1","key":"10.1016\/0020-0190(87)90045-7_BIB2","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":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(87)90045-7_BIB3","article-title":"Optimal VLSI graph embeddings in variable aspect ratio rectangles","author":"Czerwinski","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(87)90045-7_BIB4","first-page":"270","article-title":"Area-efficient graph layouts (for VLSI)","author":"Leiserson","year":"1980","journal-title":"22nd Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(87)90045-7_BIB5","first-page":"633","article-title":"Automatic generation of three-dimensional circuit layouts","author":"Leighton","year":"1983","journal-title":"Proc. IEEE Internat. Conf. on Computer Design"},{"issue":"3","key":"10.1016\/0020-0190(87)90045-7_BIB6","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1137\/0215057","article-title":"Three-dimensional circuit layouts","volume":"15","author":"Leighton","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(87)90045-7_BIB7","first-page":"293","article-title":"Bounds on minimax edge length for complete binary trees","author":"Paterson","year":"1981","journal-title":"Proc. 13th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(87)90045-7_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01744565","article-title":"Optimal three-dimensional VLSI layouts","volume":"16","author":"Preparata","year":"1983","journal-title":"Math. Systems Theory"},{"issue":"3","key":"10.1016\/0020-0190(87)90045-7_BIB9","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1145\/2402.322384","article-title":"Three-dimensional VLSI: A case study","volume":"30","author":"Rosenberg","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0190(87)90045-7_BIB10","series-title":"Ph.D. Thesis","article-title":"A complexity theory for VLSI","author":"Thompson","year":"1980"},{"key":"10.1016\/0020-0190(87)90045-7_BIB11","series-title":"Computational Aspects of VLSI","author":"Ullman","year":"1984"},{"issue":"2","key":"10.1016\/0020-0190(87)90045-7_BIB12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","article-title":"Universality considerations in VLSI circuits","volume":"C-30","author":"Valiant","year":"1981","journal-title":"IEEE Trans. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087900457?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087900457?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:59:04Z","timestamp":1555088344000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087900457"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,10]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,10]]}},"alternative-id":["0020019087900457"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90045-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,10]]}}}