Improved algorithms for the calculation of Fibonacci numbers

DOI10.1080/09720529.2008.10698170MaRDI QIDQ3512197zbMATH OpenOpenAlexFDO

Authors E. Foundas, Christos Lytras, Constantinos Patsakis

Publication date 11 July 2008

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30)

Recommendations

• A fast algorithm for computing large Fibonacci numbers
• Fast Computation of Fibonacci Numbers and Their Sums
• scientific article; zbMATH DE number 977919
• scientific article; zbMATH DE number 1807669
• scientific article; zbMATH DE number 895342
• scientific article; zbMATH DE number 6034
• Acceleration of extended Fibonacci sequences
• Publication:4940995
• scientific article; zbMATH DE number 4193774
• Publication:4936062

Cites work

• A presentation of the Fibonacci algorithm
• Computing Fibonacci numbers (and similarly defined functions) in log time

Cited in

(6)

• Tumble, a fast simple iteration algorithm for Fibonacci
• A fast algorithm for computing large Fibonacci numbers
• Fast Computation of Fibonacci Numbers and Their Sums
• A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers
• scientific article; zbMATH DE number 977919 (Why is no real title available?)
• scientific article; zbMATH DE number 6034 (Why is no real title available?)

This page was built for publication: Improved algorithms for the calculation of Fibonacci numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512197)