A FAST ALGORITHM FOR COMPUTING ORDER-K FIBONACCI NUMBERS

被引：6
作者：
ER, MC
机构：
来源：
COMPUTER JOURNAL | 1983年 / 26卷 / 03期
关键词：
Compendex;
D O I：
10.1093/comjnl/26.3.224
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
7
引用
收藏
页码：224 / 227
页数：4
相关论文
共 7 条
[1]  
CONWAY R, 1979, INTRO PROGRAMMING
[2]  
Dijkstra E. W., 1976, DISCIPLINE PROGRAMMI
[3]   THE THEORY AND PRACTICE OF CONSTRUCTING AN OPTIMAL POLYPHASE SORT [J].
ER, MC ;
LOWDEN, BGT .
COMPUTER JOURNAL, 1982, 25 (01) :93-101
[4]   COMPUTING FIBONACCI NUMBERS (AND SIMILARLY DEFINED FUNCTIONS) IN LOG TIME [J].
GRIES, D ;
LEVIN, G .
INFORMATION PROCESSING LETTERS, 1980, 11 (02) :68-69
[5]   DERIVATION OF AN O(K2LOG N) ALGORITHM FOR COMPUTING ORDER-K FIBONACCI NUMBERS FROM THE O(K3LOG N) MATRIX MULTIPLICATION METHOD [J].
PETTOROSSI, A .
INFORMATION PROCESSING LETTERS, 1980, 11 (4-5) :172-179
[6]   AN O(LOG-N) ALGORITHM FOR COMPUTING THE NTH ELEMENT OF THE SOLUTION OF A DIFFERENCE EQUATION [J].
URBANEK, FJ .
INFORMATION PROCESSING LETTERS, 1980, 11 (02) :66-67
[7]   AN O(LOG N) ALGORITHM FOR COMPUTING GENERAL ORDER-K FIBONACCI NUMBERS [J].
WILSON, TC ;
SHORTT, J .
INFORMATION PROCESSING LETTERS, 1980, 10 (02) :68-75
1