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

How to cite

top

Kirschenhofer, Peter, and Prodinger, Helmut. "A coin tossing algorithm for counting large numbers of events." Mathematica Slovaca 42.5 (1992): 531-545. <http://eudml.org/doc/31515>.

@article{Kirschenhofer1992,
author = {Kirschenhofer, Peter, Prodinger, Helmut},
journal = {Mathematica Slovaca},
keywords = {asymptotic expansions; probabilistic algorithm},
language = {eng},
number = {5},
pages = {531-545},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {A coin tossing algorithm for counting large numbers of events},
url = {http://eudml.org/doc/31515},
volume = {42},
year = {1992},
}

TY - JOUR
AU - Kirschenhofer, Peter
AU - Prodinger, Helmut
TI - A coin tossing algorithm for counting large numbers of events
JO - Mathematica Slovaca
PY - 1992
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 42
IS - 5
SP - 531
EP - 545
LA - eng
KW - asymptotic expansions; probabilistic algorithm
UR - http://eudml.org/doc/31515
ER -

References

top
  1. ANDREWS G. E., The Theory of Partitions, Addison Wesley, Reading-Mass, 1976. (1976) Zbl0371.10001MR0557013
  2. FLAJOLET P., Approximate counting: A detailed analysis, BIT 25 (1985), 113-134. (1985) Zbl0562.68027MR0785808
  3. FLAJOLET P., SEDGEWICK R., Digital search trees revisited, SIAM J. Comput. 15 (1986), 748-767. (1986) Zbl0611.68041MR0850421
  4. KIRSCHENHOFER P., PRODINGER H., Approximate counting: An alternative approach, RAIRO Inform. Théor. Appl. 25 (1991), 43-48. (1991) Zbl0732.68052MR1104410
  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. (1987) MR1012963
  6. KNUTH D. E., The average time for carry propagation, Indag. Math. 40 (1978), 238 -242. (1978) Zbl0382.10035MR0497803
  7. MORRIS R., Counting large numbers of Events in small registers, Comm. ACM 21 (1978), 840-842. (1978) Zbl0386.68035
  8. NÖRLUND N. E., Vorlesungen über Differenzenrechnung, Chelsea, New York, 1954. (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. (1987) MR1012965
  10. SCHIMID U., Abzählprobleme der theoretischen Informatik, Diplomarbeit, TU, Wien, 1985. (1985) 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.