Analysis of an algorithm to construct Fibonacci partitions
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1984)
- Volume: 18, Issue: 4, page 387-394
- ISSN: 0988-3754
Access Full Article
topHow to cite
topReferences
top- 1. N. G. DE BRUIJN, Asymptotic methods in Analysis, North-Holland, Amsterdam, 1958. Zbl0082.04202
- 2. L. COMTET, Advanced Combinatorics, Reidel, Dordrecht-Holland, 1974. Zbl0283.05001MR460128
- 3. H. PRODINGER, On the Number of Fibonacci Partitions of a Set, The Fibonacci Quarterly, Vol. 19, 1981, pp. 463-466. Zbl0475.05009MR644710
- 4. J. RIORDAN, Combinatorial Identifies, Wiley, New York, 1968. Zbl0194.00502MR231725
- 5. G.-C. ROTA, The Number of Partitions of a Set, American Math. Monthly, Vol.71, 1964, Zbl0121.01803MR161805
- reprinted in G.-C. Rota : Finite Operator Calculus, Academic Press, New York, 1975. MR379213