Combinatorics of geometrically distributed random variables: Left-to-right maxima

Discrete Mathematics

Volumn 153, Issue 1-3, 1996, Pages 253-270

  Prodinger, Helmut ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001237445     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00141-I     Document Type: Article

References (17)

1. L. Devroye, Applications of the theory of records in the study of random trees, Acta Inform. 26 (1988) 123-130.
2. L. Devroye, A limit theory for random skip lists, Ann. Appl. Probab. 2 (1992) 597-609.
3. P. Flajolet, D. Gardy and L. Thimonier, Probabilistic languages and random allocations, Lecture Notes in Computer Science, Vol. 317 (Springer, New York, 1988) 239-253.
4. P. Flajolet and G.N. Martin, Probabilistic counting algorithms for data base applications, J. Comput. System Sci. 31 (1985) 182-209.
5. P. Flajolet and R. Sedgewick, Digital search trees revisited, SIAM J. Comput. 15 (1986) 748-767.
6. P. Flajolet and J. Vitter, Average-case analysis of algorithms and data structures, in: Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity (North-Holland, Amsterdam, 1990) 431-524.
7. R. Kemp, Fundamentals of the Average Case Analysis of Particular Algorithms (Wiley-Teubner, Stuttgart, 1982).
8. P. Kirschenhofer and H. Prodinger, On the analysis of probabilistic counting, Lecture Notes in Mathematics, Vol. 1452 (Springer, New York, 1990) 117-120.
9. P. Kirschenhofer and H. Prodinger, A result in order statistics related to probabilistic counting, Computing 51 (1993) 15-27.
10. P. Kirschenhofer, H. Prodinger and W. Szpankowski, How to count quickly and accurately: a unified analysis of probabilistic counting and other related problems, ICALP92, Lecture Notes in Computer Science, Vol. 623 (Springer, New York, 1992) 211-222.
11. D.E. Knuth, The Art of Computer Programming, Vol. 1 (Addison-Wesley, Reading, MA, 1968).
12. D.E. Knuth, The Art of Computer Programming, Vol. 3 (Addison-Wesley. Reading, MA, 1973).
13. M. Lothaire, Combinatorics on Words (Addison-Wesley, Reading, MA, 1982).
14. T. Papadakis, I. Munro and P. Poblete, Average search and update costs in skip lists, BIT 32 (1992) 316-332.
15. W. Pugh, Skip lists: a probabilistic alternative to balanced trees, Comm. ACM 33 (1990) 668-676.
16. R. Sedgewick, Mathematical analysis of combinatorial algorithms, in: G. Louchard and G. Latouche, eds., Probability Theory and Computer Science (Academic Press, New York, 1983) 125-205.
17. W. Szpankowski and V. Rego, Yet another application of a binomial recurrence: order statistics, Computing 43 (1990) 401-410.