One-sided variations on interval trees

Journal of Applied Probability

Volumn 40, Issue 3, 2003, Pages 654-670

  Itoh, Yoshiaki ^a   Mahmoud, Hosam M ^b  

^a INSTITUTE OF STATISTICAL MATHEMATICS   (Japan)

^b GEORGE WASHINGTON UNIVERSITY   (United States)

Author keywords

Delayed differential equation; Half scale differential equation; Limit distribution; Random graph; Tauberian theorem; Tree

Indexed keywords

EID: 0242676835     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1059060894     Document Type: Article

References (13)

1. DEVROYE, L. (1986). A note on the height of binary search trees. J. Assoc. Comput. Mach. 33, 489-498.
2. FELLER, W. (1971). Theory of Probability and Its Applications, Vol. 2, 2nd edn. John Wiley, New York.
3. FILL, J., MAHMOUD, H. AND SZPANKOWSKI, W. (1996). On the distribution for the duration of a randomized leader election algorithm. Ann. Appl. Prob. 6, 1260-1283.
4. HARARY, F. AND PALMER, E. M. (1973), Graphical Enumeration. Academic Press, New York.
5. MAGNUS, W., OBERHETTINGER, F. AND SONI, R. (1966). Formulas and Theorems for the Special Functions of Mathematical Physics. Springer, New York.
6. MAHMOUD, H. (1992). Evolution of Random Search Trees. John Wiley, New York.
7. MAHMOUD, H. (2003). One-sided variations on binary search trees. To appear in Ann. Inst. Statist. Math.
8. NEININGER, R. AND RÜSCHENDORF, L. (2003). On the contraction method with degenerate limit equation. Unpublished manuscript.
9. PRODINGER, H. (1993). How to select a loser. Discrete Math. 120, 149-159.
10. RÉNYI, A. (1958). On a one-dimensional random space-filling problem. Pub. Math. Inst. Hangar. Acad. Sci. 3, 109-127.
11. RIORDAN, J. (1968). Combinatorial Identities. John Wiley, New York.
12. RÖSLER, U. (1991). A limit theorem for 'quicksort'. RAIRO Inf. Théor. Appl. 25, 85-100.
13. SIBUYA, M. AND ITOH, Y. (1987). Random sequential bisection and its associated binary tree. Ann. Inst. Statist. Math. 39, 69-84.