{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T19:53:44Z","timestamp":1648929224721},"reference-count":4,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,4,1]],"date-time":"1989-04-01T00:00:00Z","timestamp":607392000000},"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":8873,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1989,4]]},"DOI":"10.1016\/0304-3975(89)90102-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"119-124","source":"Crossref","is-referenced-by-count":3,"title":["On the number of arithmetical operations for finding Fibonacci numbers"],"prefix":"10.1016","volume":"64","author":[{"given":"Marco","family":"Protasi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Talamo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90102-3_BIB1","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1137\/0214007","article-title":"An efficient formula for linear recurrences","volume":"14","author":"Fiduccia","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90102-3_BIB2","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0020-0190(80)90003-4","article-title":"Computing Fibonacci numbers (and similarly defined functions) in log time","volume":"11","author":"Gries","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(89)90102-3_BIB3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0020-0190(84)90099-1","article-title":"A presentation of the Fibonacci algorithm","volume":"19","author":"Martin","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(89)90102-3_BIB4","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0020-0190(80)90002-2","article-title":"An O(log n) algorithm for computing the nth element of the solution of a difference equation","volume":"11","author":"Urbanek","year":"1980","journal-title":"Inform. Process. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901023?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901023?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:55:28Z","timestamp":1555127728000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589901023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,4]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,4]]}},"alternative-id":["0304397589901023"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90102-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,4]]}}}