{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T07:45:01Z","timestamp":1748245501219},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1980,8,1]],"date-time":"1980-08-01T00:00:00Z","timestamp":333936000000},"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":[[1980,8]]},"DOI":"10.1016\/0020-0190(80)90034-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"46-48","source":"Crossref","is-referenced-by-count":58,"title":["On the area of binary tree layouts"],"prefix":"10.1016","volume":"11","author":[{"given":"R.P.","family":"Brent","sequence":"first","affiliation":[]},{"given":"H.T.","family":"Kung","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(80)90034-4_BIB1","first-page":"257","article-title":"A tree machine for searching problems","author":"Bentley","year":"1979","journal-title":"Proc. IEEE 1979 International Conference on Parallel Processing"},{"key":"10.1016\/0020-0190(80)90034-4_BIB2","series-title":"Problems in Euclidean Space: Application of Convexity","author":"Eggleston","year":"1957"},{"key":"10.1016\/0020-0190(80)90034-4_BIB3","series-title":"Proc. Conference on Very Large Scale Integration: Architecture, Design, Fabrication","first-page":"65","article-title":"Let's design algorithms for VLSI systems","author":"Kung","year":"1979"},{"key":"10.1016\/0020-0190(80)90034-4_BIB4","series-title":"Introduction to VLSI Systems","author":"Mead","year":"1980"},{"issue":"2","key":"10.1016\/0020-0190(80)90034-4_BIB5","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1109\/JSSC.1979.1051197","article-title":"Cost and performance of VLSI computing structures","volume":"14","author":"Mead","year":"1979","journal-title":"IEEE J. Solid State Circuits"},{"key":"10.1016\/0020-0190(80)90034-4_BIB6","series-title":"A highly concurrent tree machine for database applications","author":"Song","year":"1980"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019080900344?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019080900344?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:51:01Z","timestamp":1555087861000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019080900344"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,8]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,8]]}},"alternative-id":["0020019080900344"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(80)90034-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1980,8]]}}}