{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T16:29:10Z","timestamp":1649003350898},"reference-count":4,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,7,1]],"date-time":"1983-07-01T00:00:00Z","timestamp":425865600000},"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":[[1983,7]]},"DOI":"10.1016\/0020-0190(83)90082-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"1-5","source":"Crossref","is-referenced-by-count":6,"title":["Computing sums of order-k Fibonacci numbers in log time"],"prefix":"10.1016","volume":"17","author":[{"given":"M.C.","family":"Er","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0020-0190(83)90082-0_BIB1","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."},{"issue":"4,5","key":"10.1016\/0020-0190(83)90082-0_BIB2","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/0020-0190(80)90045-9","article-title":"Derivation of an O(k2 log n) algorithm for computing order-k Fibonacci numbers from the O(k3 log n) matrix multiplication method","volume":"11","author":"Pettorossi","year":"1980","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/0020-0190(83)90082-0_BIB3","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."},{"issue":"2","key":"10.1016\/0020-0190(83)90082-0_BIB4","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0020-0190(80)90076-9","article-title":"An O(log n) algorithm for computing general order-k Fibonacci numbers","volume":"10","author":"Wilson","year":"1980","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900820?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900820?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:56:28Z","timestamp":1555088188000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019083900820"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,7]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,7]]}},"alternative-id":["0020019083900820"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(83)90082-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1983,7]]}}}