{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:15:10Z","timestamp":1649189710631},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9635,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1987,3]]},"DOI":"10.1016\/0890-5401(87)90034-4","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T15:34:26Z","timestamp":1103211266000},"page":"270-282","source":"Crossref","is-referenced-by-count":10,"title":["Area-time optimal division for T = \u03a9((log n)1 + \u03b5)"],"prefix":"10.1016","volume":"72","author":[{"given":"K.","family":"Mehlhorn","sequence":"first","affiliation":[]},{"given":"F.P.","family":"Preparata","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(87)90034-4_BIB1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0167-9260(84)90020-8","article-title":"AT2-optimal VLSI integer division and integer square rooting","volume":"2","author":"Mehlhorn","year":"1984","journal-title":"Integration"},{"key":"10.1016\/0890-5401(87)90034-4_BIB2","series-title":"Proceedings, IEEE 24th Found. of Comput. Sci.","first-page":"138","article-title":"Logarithmic depth circuits for algebraic functions","author":"Reif","year":"1983"},{"key":"10.1016\/0890-5401(87)90034-4_BIB3","series-title":"Proceedings, IEEE 25th Found. of Comput. Sci.","first-page":"1","article-title":"Log depth circuits for division and related problems","author":"Beame","year":"1984"},{"key":"10.1016\/0890-5401(87)90034-4_BIB4","series-title":"VLSI 83","article-title":"Recursive implementation of optimal time VLSI integer multipliers","author":"Luk","year":"1983"},{"key":"10.1016\/0890-5401(87)90034-4_BIB5","author":"Spaniol","year":"1976"},{"key":"10.1016\/0890-5401(87)90034-4_BIB6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0019-9958(83)80061-8","article-title":"AT2-optimal VLSI integer multiplier with minimum computation time","volume":"58","author":"Mehlhorn","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(87)90034-4_BIB7","volume":"Vol. 2","author":"Knuth","year":"1981"},{"key":"10.1016\/0890-5401(87)90034-4_BIB8","unstructured":"Leighton, F. T. (1985), personal communication, May."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540187900344?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540187900344?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:26:12Z","timestamp":1548879972000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540187900344"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,3]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,3]]}},"alternative-id":["0890540187900344"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(87)90034-4","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1987,3]]}}}