Geodesic
A coin tossing algorithm for counting large numbers of events
Mathematica slovaca, Tome 42 (1992) no. 5, pp. 531-545
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 68Q25 
@article{MASLO_1992_42_5_a1,
     author = {Kirschenhofer, Peter and Prodinger, Helmut},
     title = {A coin tossing algorithm for counting large numbers of events},
     journal = {Mathematica slovaca},
     pages = {531--545},
     year = {1992},
     volume = {42},
     number = {5},
     mrnumber = {1202172},
     zbl = {0764.68077},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1992_42_5_a1/}
}
TY  - JOUR
AU  - Kirschenhofer, Peter
AU  - Prodinger, Helmut
TI  - A coin tossing algorithm for counting large numbers of events
JO  - Mathematica slovaca
PY  - 1992
SP  - 531
EP  - 545
VL  - 42
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/MASLO_1992_42_5_a1/
LA  - en
ID  - MASLO_1992_42_5_a1
ER  - 
%0 Journal Article
%A Kirschenhofer, Peter
%A Prodinger, Helmut
%T A coin tossing algorithm for counting large numbers of events
%J Mathematica slovaca
%D 1992
%P 531-545
%V 42
%N 5
%U http://geodesic.mathdoc.fr/item/MASLO_1992_42_5_a1/
%G en
%F MASLO_1992_42_5_a1
Kirschenhofer, Peter; Prodinger, Helmut. A coin tossing algorithm for counting large numbers of events. Mathematica slovaca, Tome 42 (1992) no. 5, pp. 531-545. http://geodesic.mathdoc.fr/item/MASLO_1992_42_5_a1/

[1] ANDREWS G. E.: The Theory of Partitions. Addison Wesley, Reading-Mass, 1976. | MR | Zbl

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

[3] FLAJOLET P., SEDGEWICK R.: Digital search trees revisited. SIAM J. Comput. 15 (1986), 748-767. | MR | Zbl

[4] KIRSCHENHOFER P., PRODINGER H.: Approximate counting: An alternative approach. RAIRO Inform. Théor. Appl. 25 (1991), 43-48. | MR | Zbl

[5] KIRSCHENHOFER P., PRODINGER H., SCHOISSENGEIER J.: Zur Auswertung gewisser numerischer Rahen mit Hilfe modularer Funktionen. In: Zahlentheoretische Analysis II. Lecture Notes in Math 1262 (K. Hlawka, ed.), Springer, Berlin, 1987, pp. 108-110. | MR

[6] KNUTH D. E.: The average time for carry propagation. Indag. Math. 40 (1978), 238 -242. | MR | Zbl

[7] MORRIS R.: Counting large numbers of Events in small registers. Comm. ACM 21 (1978), 840-842. | Zbl

[8] NÖRLUND N. E.: Vorlesungen über Differenzenrechnung. Chelsea, New York, 1954.

[9] PRODINGER, H: Über längste 0-1-Folgen. In: Zahlentheoretische Analysis II. Lecture Notes in Math. 1262 (K. Hlawka, ed.), Springer, Berlin, 1987, pp. 124-133. | MR

[10] SCHIMID U.: Abzählprobleme der theoretischen Informatik. Diplomarbeit, TU, Wien, 1985.