Analysis of a splitting process arising in probabilistic counting and other related algorithms

Random Structures and Algorithms

Volumn 9, Issue 4, 1996, Pages 379-401

  Kirschenhofer, Peter ^a   Prodinger, Helmut ^b   Szpankowski, Wojciech ^c  

^a Montanuniversity Leoben ^*  (Austria)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^c Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030490374     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199612)9:4<379::AID-RSA3>3.3.CO;2-I     Document Type: Article

References (37)

1. M. Abramowitz and I. Stegun, Eds., Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, Wiley, New York, 1972.
2. D. Aldous, Probability Approximations via the Poisson Clumping Heuristic, Springer-Verlag, New York, 1989.
3. C. Anderson, Extreme value theory for a class of discrete distributions with applications to some stochastic processes. J. Appl. Probab., 7, 99-113 (1970).
4. G. Brassard and P. Bratley, Algorithmics. Theory and Practice, Prentice-Hall, Englewood Cliffs, NJ, 1988.
5. B. Davies, Integral Transforms and Their Applications, Springer-Verlag, New York, 1978.
6. G. Doetsch, Handbuch der Laplace Transformation, Birkhäuser, Basel, 1955, Vol. 1-3.
7. J. Fill, H. Mahmoud, and W. Szpankowski, On the distribution for the duration of a randomized leader election algorithm, Ann. Appl. Probab., to appear.
8. P. Flajolet and G. N. Martin, Probabilistic counting algorithms for data base applications, J. Comput. Syst. Sci., 31, 182-209 (1985).
9. P. Flajolet, M. Régnier, and D. Sotteau, Algebraic methods for trie statistics, Ann. Discrete Math., 25, 145-188 (1985).
10. P. Flajolet and N. Saheb, The complexity of generating an exponentially distributed variate, J. Alg., 7, 463-488 (1986).
11. P. Flajolet and B. Richmond, Generalized digital trees and their difference-differential equations, Random Struct. Alg., 3, 305-320 (1992).
12. P. Flajolet, X. Gourdon, and P. Dumas, Mellin transforms and asymptotics: harmonic sums, Theor. Comput. Sci., 144, 3-58 (1995).
13. P. Flajolet, P. Jacquet, and W. Szpankowski, Mellin transform of a complex variable: a simple extension, preprint, 1995.
14. P. Grabner, Searching for losers, Random Struct. Alg., 4, 99-110 (1993).
15. A. Greenberg, P. Flajolet, and R. Ladner, Estimating the multiplicities of conflicts to speed their resolution in multiple access channels, J. ACM, 34, 289-325 (1987).
16. P. Henrici, Applied and Computational Complex Analysis, Wiley, New York, 1977, Vol 2.
17. P. Jacquet and M. Régnier, Trie partitioning process: limiting distributions, in Lecture Notes in Computer Science 214, Springer-Verlag, New York, 1986, pp. 196-210.
18. P. Jacquet and W. Szpankowski, Ultimate characterizations of the burst response of an interval searching algorithm: a study of a functional equation, SIAM J. Comput., 18, 777-791 (1989).
19. P. Jacquet and W. Szpankowski, Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees, Theor. Comput. Sci., 144, 161-197 (1995).
20. P. Jacquet and W. Szpankowski, Analytical depoissonization and its applications, preprint, 1996.
21. J. F. C. Kingman, Subadditive processes, in Ecole d'Eté de Probabilités de Saint-Flour V-1975, Lecture Notes in Mathematics 539, Springer-Verlag, Berlin, 1976.
22. P. Kirschenhofer and H. Prodinger, On the analysis of probabilistic counting, Lecture Notes in Mathematics 1452, E. Hlawka and R. Tichy, Eds., Springer-Verlag, Berlin, 1990, pp. 117-120.
23. P. Kirschenhofer and H. Prodinger, On some applications of formulaæ of Ramanujan in the analysis of algorithms, Mathematika, 38, 14-33 (1991).
24. P. Kirschenhofer and H. Prodinger, Approximate counting: an alternative approach, Inf. Théor. Appl., 25, 43-48 (1991).
25. P. Kirschenhofer and H. Prodinger, A result in order statistics related to probabilistic counting, Computing, 51, 15-27 (1993).
26. P. Kirschenhofer, H. Prodinger and W. Szpankowski, How to count quickly and accurately: a unified analysis of probabilistic counting and other related problems, International Conference on Automata, Languages, and Programming (ICALP'92), Vienna, Lecture Notes in Computer Science 623, W. Kuich, Ed., Springer-Verlag, Berlin, 1992, pp. 211-222.
27. D. Knuth, The Art of Computer Programming: Fundamental Algorithms, Addison-Wesley, Reading, MA, 1973, Vol. 1.
28. D. E. Knuth, The Art of Computer Programming: Sorting and Searching, Addison-Wesley, Reading, MA, 1973, Vol. 3.
29. R. Morris, Counting large numbers of events in small registers, Commun. ACM, 21, 840-842 (1978).
30. B. Pittel and H. Rubin, How many random questions are necessary to identify n distinct objects?, J. Combinat. Theor. Ser. A, 55, 292-312 (1990).
31. H. Prodinger, How to select a loser, Discrete Math., 120, 149-159 (1993).
32. B. Rais, P. Jacquet, and W. Szpankowski, Limiting distribution for the depth in Patricia tries, SIAM J. Discrete Math., 6, 197-213 (1993).
33. M. Régnier and P. Jacquet, Normal limiting distribution of the size of tries, Proc. Performance '87, North-Holland, Amsterdam, 1987, pp. 209-223,
34. U. Schmid, The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects, International Conference on Automata, Languages, and Programming (ICALP'92), Vienna, Lecture Notes in Computer Science 623, W. Kuich, Ed., Springer-Verlag, Berlin, 1992, pp. 223-234.
35. W. Szpankowski, Solution of a linear recurrence equation arising in the analysis of some algorithms, SIAM J. Alg. Discrete Methods, 8, 233-250 (1987).
36. W. Szpankowski, Patricia tries again revisited, J. ACM, 37, 691-711 (1990).
37. W. Szpankowski and V. Rego, Yet another application of a binomial recurrence. Order statistics, Computing, 43, 401-410 (1990).