The number of distinct values in a geometrically distributed sample

European Journal of Combinatorics

Volumn 27, Issue 7, 2006, Pages 1059-1081

  Archibald, Margaret ^a   Knopfmacher, Arnold ^a   Prodinger, Helmut ^b  

^a UNIVERSITY OF THE WITWATERSRAND   (South Africa)

^b STELLENBOSCH UNIVERSITY   (South Africa)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33747765834     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2006.06.007     Document Type: Article

References (23)

1. Abramowitz M., and Stegun I.A. Handbook of Mathematical Functions (1970), Dover, New York
2. Bai Z.-D., Hwang H.-K., and Liang W.-Q. Normal approximations of the number of records in geometrically distributed random variables. Random Structures Algorithms 13 (1998) 319-334
3. Devroye L. A limit theory for random skip lists. Ann. Appl. Probab. 2 (1992) 597-609
4. Flajolet P., and Martin G.N. Probabilistic counting algorithms for data base applications. J. Comp. Syst. Sci. 31 (1985) 182-209
5. Flajolet P., and Sedgewick R. Mellin transforms and asymptotics: Finite differences and Rice's integrals. Theoret. Comput. Sci. 144 (1995) 101-124 Special volume on mathematical analysis of algorithms
6. Graham R.L., Knuth D.E., and Patashnik O. Concrete Mathematics (1994), Addison-Wesley
7. Kirschenhofer P., and Prodinger H. b-tries: A paradigm for the application of numbertheoretic methods in the analysis of algorithms. Contributions to General Algebra vol. 6 (1988), Hölder-Pichler-Tempsky-Teubner 141-153
8. Kirschenhofer P., and Prodinger H. On the Analysis of Probabilistic Counting. In: Hlawka E., and Tichy R.F. (Eds). Lecture Notes in Mathematics vol. 1452 (1990) 117-120
9. Kirschenhofer P., and Prodinger H. A result in order statistics related to probabilistic counting. Computing 51 (1993) 15-27
10. Kirschenhofer P., Prodinger H., and Szpankowski W. Multidimensional digital searching and some new parameters in tries. Internat. J. Found. Comput. Sci. 4 (1993) 69-84
11. Knopfmacher A., and Prodinger H. Combinatorics of geometrically distributed random variables: Value and position of the rth left-to-right maximum. Discrete Math. 226 (2001) 255-267
12. Louchard G., and Prodinger H. Ascending runs of sequences of geometrically distributed random variables: A probabilistic analysis. Theoret. Comput. Sci. 304 (2003) 59-86
13. Papadakis T., Munro I., and Poblete P. Average search and update costs in skip lists. BIT 32 (1992) 316-332
14. Prodinger H. Combinatorial problems related to geometrically distributed random variables. Séminaire Lotharingien de Combinatoire (Gerolfingen, 1993). Prépubl. Inst. Rech. Math. Av. vol. 1993/34 (1993), Univ. Louis Pasteur, Strasbourg 87-95
15. Prodinger H. Combinatorics of geometrically distributed random variables: Left-to-right maxima. Discrete Math. 153 (1996) 253-270
16. Prodinger H. Combinatorics of geometrically distributed random variables: New q-tangent and q-secant numbers. Int. J. Math. Math. Sci. 24 (2000)
17. Prodinger H. Combinatorics of geometrically distributed random variables: Inversions and a parameter of Knuth. Ann. Comb. 5 (2001)
18. Prodinger H. Compositions and Patricia tries: No fluctuations in the variance!. SODA (2004)
19. Pugh W. Skip lists: A probabilistic alternative to balanced trees. Commun. ACM 33 (1990) 668-676
20. Sedgewick R., and Flajolet P. An Introduction to the Analysis of Algorithms (1996), Addison-Wesley
21. Szpankowski W. Average Case Analysis of Algorithms on Sequences (2001), John Wiley and Sons, New York
22. Szpankowski W., and Rego V. Yet another application of a binomial recurrence: Order statistics. Computing 43 (1990) 401-410
23. Whittaker E.T., and Watson G.N. A Course in Modern Analysis. fourth ed. (1927), Cambridge University Press reprinted 1973