[1] ANDREWS G. E.: The Theory of Partitions. Addison Wesley, 1976. MR 0557013 | Zbl 0371.10001

[2] FLAJOLET P.: Approximate counting: A detailed analysis. BIT 25 (1985), 113-134. MR 0785808 | Zbl 0562.68027

[3] FLAJOLET P., LABELLE G., LAFOREST L., SALVY B.: Hypergeometrics and the cost structure of quadtrees. Random Structures and Algorithms (1995) (To appear). MR 1369059 | Zbl 0834.68013

[4] FLAJOLET P., RICHMOND B.: Generalized digital trees and their difference-differential equations. Random Structures and Algorithms 5 (1992), 305-320. MR 1164843 | Zbl 0758.60015

[5] KIRSCHENHOFER P., PRODINGER H.: Approximate counting: An alternative approach. RAIRO Informatique Theorique et Applications 25 (1991), 43-48. MR 1104410 | Zbl 0732.68052

[6] KIRSCHENHOFER P., PRODINGER H.: A coin tossing algorithm for counting large numbers of events. Math. Slovaca 42 (1992), 531-545. MR 1202172 | Zbl 0764.68077

[7] PRODINGER H.: Hypothetic analyses: Approximate counting in the style of Knuth, path length in the style of Flajolet. Theoretical Computer Science 100 (1992), 243-251. MR 1171442