{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:10:26Z","timestamp":1759626626362,"version":"build-2065373602"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,11,9]],"date-time":"1999-11-09T00:00:00Z","timestamp":942105600000},"content-version":"vor","delay-in-days":677,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0304-3975(97)00181-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"245-248","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Addition in log2n + O(1) steps on average a simple analysis"],"prefix":"10.1016","volume":"191","author":[{"given":"Richard","family":"Beigel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bill","family":"Gasarch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louxin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00181-3_BIB1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/T-C.1973.223748","article-title":"Some new results on average worst case carry","volume":"C-22","author":"Briley","year":"1973","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(97)00181-3_BIB2","series-title":"Institute for Advanced Studies, Report","article-title":"Preliminary discussion of the logical design of an electronic computing instrument","author":"Burks","year":"1946"},{"year":"1990","series-title":"Introduction to Algorithms","author":"Cormen","key":"10.1016\/S0304-3975(97)00181-3_BIB3"},{"year":"1979","series-title":"Computer Arithmetic: Principles, Architecture, and Design","author":"Hwang","key":"10.1016\/S0304-3975(97)00181-3_BIB4"},{"year":"1997","series-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li","key":"10.1016\/S0304-3975(97)00181-3_BIB5"},{"issue":"8","key":"10.1016\/S0304-3975(97)00181-3_BIB6","first-page":"725","article-title":"How to add fast-on average","volume":"102","author":"Schay","year":"1995","journal-title":"Amer. Math. Monthly"},{"year":"1985","series-title":"Computer Number Systems and Arithmetic","author":"Scott","key":"10.1016\/S0304-3975(97)00181-3_BIB7"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001813?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001813?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:45:36Z","timestamp":1759625136000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597001813"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0304397597001813"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00181-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1998,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Addition in log2n + O(1) steps on average a simple analysis","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(97)00181-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}