@article{MASLO_1994_44_5_a7,
author = {Prodinger, Helmut},
title = {Approximate counting via {Euler} transform},
journal = {Mathematica slovaca},
pages = {569--574},
year = {1994},
volume = {44},
number = {5},
mrnumber = {1338429},
zbl = {0823.11005},
language = {en},
url = {http://geodesic.mathdoc.fr/item/MASLO_1994_44_5_a7/}
}
Prodinger, Helmut. Approximate counting via Euler transform. Mathematica slovaca, Tome 44 (1994) no. 5, pp. 569-574. http://geodesic.mathdoc.fr/item/MASLO_1994_44_5_a7/
[1] ANDREWS G. E.: The Theory of Partitions. Addison Wesley, 1976. | MR | Zbl
[2] FLAJOLET P.: Approximate counting: A detailed analysis. BIT 25 (1985), 113-134. | MR | Zbl
[3] FLAJOLET P., LABELLE G., LAFOREST L., SALVY B.: Hypergeometrics and the cost structure of quadtrees. Random Structures and Algorithms (1995) (To appear). | MR | Zbl
[4] FLAJOLET P., RICHMOND B.: Generalized digital trees and their difference-differential equations. Random Structures and Algorithms 5 (1992), 305-320. | MR | Zbl
[5] KIRSCHENHOFER P., PRODINGER H.: Approximate counting: An alternative approach. RAIRO Informatique Theorique et Applications 25 (1991), 43-48. | MR | Zbl
[6] KIRSCHENHOFER P., PRODINGER H.: A coin tossing algorithm for counting large numbers of events. Math. Slovaca 42 (1992), 531-545. | MR | Zbl
[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