An O(k2log(n/k)) Algorithm for Computing Generalized Order-k Fibonacci Numbers with Linear Space
From MaRDI portal
Publication:3816136
DOI10.1080/02522667.1988.10698935zbMATH Open0665.10007OpenAlexW2320374922MaRDI QIDQ3816136FDOQ3816136
Authors: 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
Recommendations
- On the order-\(m\) generalized Fibonacci \(k\)-numbers
- On the computing of the generalized order-\(k\) Pell numbers in log time
- scientific article; zbMATH DE number 3857295
- The generalized order-\(k\) Fibonacci-Pell sequence by matrix methods
- On the generalized order-\(k\) Fibonacci and Lucas numbers
algorithmsFibonacci numbersgeneralized order-k Fibonacci seriesmerging of stringspolyphase sort of \((k+1)\) tape drives
Cites Work
- A presentation of the Fibonacci algorithm
- 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
- An O(log n) algorithm for computing general 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
Cited In (2)
This page was built for publication: An O(k2log(n/k)) Algorithm for Computing Generalized Order-k Fibonacci Numbers with Linear Space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3816136)
