A coin tossing algorithm for counting large numbers of events
Peter Kirschenhofer; Helmut Prodinger
Mathematica Slovaca (1992)
- Volume: 42, Issue: 5, page 531-545
- ISSN: 0139-9918
Access Full Article
topHow to cite
topReferences
top- ANDREWS G. E., The Theory of Partitions, Addison Wesley, Reading-Mass, 1976. (1976) Zbl0371.10001MR0557013
- FLAJOLET P., Approximate counting: A detailed analysis, BIT 25 (1985), 113-134. (1985) Zbl0562.68027MR0785808
- FLAJOLET P., SEDGEWICK R., Digital search trees revisited, SIAM J. Comput. 15 (1986), 748-767. (1986) Zbl0611.68041MR0850421
- KIRSCHENHOFER P., PRODINGER H., Approximate counting: An alternative approach, RAIRO Inform. Théor. Appl. 25 (1991), 43-48. (1991) Zbl0732.68052MR1104410
- 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. (1987) MR1012963
- KNUTH D. E., The average time for carry propagation, Indag. Math. 40 (1978), 238 -242. (1978) Zbl0382.10035MR0497803
- MORRIS R., Counting large numbers of Events in small registers, Comm. ACM 21 (1978), 840-842. (1978) Zbl0386.68035
- NÖRLUND N. E., Vorlesungen über Differenzenrechnung, Chelsea, New York, 1954. (1954)
- 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. (1987) MR1012965
- SCHIMID U., Abzählprobleme der theoretischen Informatik, Diplomarbeit, TU, Wien, 1985. (1985)