Previous |  Up |  Next

Article

Title: Approximate counting via Euler transform (English)
Author: Prodinger, Helmut
Language: English
Journal: Mathematica Slovaca
ISSN: 0139-9918
Volume: 44
Issue: 5
Year: 1994
Pages: 569-574
.
Category: math
.
MSC: 11B68
MSC: 33D15
idZBL: Zbl 0823.11005
idMR: MR1338429
.
Date available: 2009-09-25T11:01:55Z
Last updated: 2012-08-01
Stable URL: http://hdl.handle.net/10338.dmlcz/136629
.
Reference: [1] ANDREWS G. E.: The Theory of Partitions.Addison Wesley, 1976. Zbl 0371.10001, MR 0557013
Reference: [2] FLAJOLET P.: Approximate counting: A detailed analysis.BIT 25 (1985), 113-134. Zbl 0562.68027, MR 0785808
Reference: [3] FLAJOLET P., LABELLE G., LAFOREST L., SALVY B.: Hypergeometrics and the cost structure of quadtrees.Random Structures and Algorithms (1995) (To appear). Zbl 0834.68013, MR 1369059
Reference: [4] FLAJOLET P., RICHMOND B.: Generalized digital trees and their difference-differential equations.Random Structures and Algorithms 5 (1992), 305-320. Zbl 0758.60015, MR 1164843
Reference: [5] KIRSCHENHOFER P., PRODINGER H.: Approximate counting: An alternative approach.RAIRO Informatique Theorique et Applications 25 (1991), 43-48. Zbl 0732.68052, MR 1104410
Reference: [6] KIRSCHENHOFER P., PRODINGER H.: A coin tossing algorithm for counting large numbers of events.Math. Slovaca 42 (1992), 531-545. Zbl 0764.68077, MR 1202172
Reference: [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
.

Files

Files Size Format View
MathSlov_44-1994-5_8.pdf 593.8Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo