Analysis of an algorithm to construct Fibonacci partitions
Prodinger, Helmut
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 18 (1984), p. 387-394 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1984-01-01
@article{ITA_1984__18_4_387_0,
     author = {Prodinger, Helmut},
     title = {Analysis of an algorithm to construct Fibonacci partitions},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {18},
     year = {1984},
     pages = {387-394},
     mrnumber = {775840},
     zbl = {0562.05006},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1984__18_4_387_0}
}

Prodinger, Helmut. Analysis of an algorithm to construct Fibonacci partitions. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 18 (1984) pp. 387-394. http://gdmltest.u-ga.fr/item/ITA_1984__18_4_387_0/

1. N. G. De Bruijn, Asymptotic methods in Analysis, North-Holland, Amsterdam, 1958. | Zbl 0082.04202

2. L. Comtet, Advanced Combinatorics, Reidel, Dordrecht-Holland, 1974. | MR 460128 | Zbl 0283.05001

3. H. Prodinger, On the Number of Fibonacci Partitions of a Set, The Fibonacci Quarterly, Vol. 19, 1981, pp. 463-466. | MR 644710 | Zbl 0475.05009

4. J. Riordan, Combinatorial Identifies, Wiley, New York, 1968. | MR 231725 | Zbl 0194.00502

5. G.-C. Rota, The Number of Partitions of a Set, American Math. Monthly, Vol.71, 1964, | MR 161805 | Zbl 0121.01803

reprinted in G.-C. Rota : Finite Operator Calculus, Academic Press, New York, 1975. | MR 379213