An O(k2log(n/k)) Algorithm for Computing Generalized Order-k Fibonacci Numbers with Linear Space

DOI10.1080/02522667.1988.10698935zbMath0665.10007OpenAlexW2320374922MaRDI QIDQ3816136

M. C. Er

Publication date: 1988

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1988.10698935

zbMATH Keywords

algorithmsFibonacci numbersgeneralized order-k Fibonacci seriesmerging of stringspolyphase sort of \((k+1)\) tape drives

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Recurrences (11B37)

Cites Work

• A presentation of the Fibonacci algorithm
• An O(log n) algorithm for computing general order-k Fibonacci numbers
• Computing Fibonacci numbers (and similarly defined functions) in log time
• An \(O(\log n)\) algorithm for computing the \(n\)th element of the solution of a difference equation
• An interative program to calculate Fibonacci numbers in O(log n) arithmetic operations
• Derivation of an \(O(k^ 2\log n)\) algorithm for computing order-k Fibonacci numbers from the \(O(k^ 3\log n)\) matrix multiplication method
• A Fast Algorithm for Computing Order-K Fibonacci Numbers
• Fast Computation of Fibonacci Numbers and Their Sums
• A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers

This page was built for publication: An O(k²log(n/k)) Algorithm for Computing Generalized Order-k Fibonacci Numbers with Linear Space