Journal of the Iranian Statistical Society
Volume & Issue: Volume 3, Issue 2, November 2004
Number of Articles: 10
Connecting Yule Process, Bisection and Binary Search Tree via Martingales
Pages 89-116
Brigitte Chauvin; Alain Rouault
Profile and Height of Random Binary Search Trees
Pages 117-138
Michael Drmota
Compact Suffix Trees Resemble PATRICIA Tries: Limiting Distribution of the Depth
Pages 139-148
Philippe Jacquet; Bonita McVey; Wojciech Szpankowski
One-Sided Interval Trees
Pages 149-164
Svante Janson
P´olya-Type Urn Models with Multiple Drawings
Pages 165-173
Norman Johnson; Samuel Kotz; Hosam Mahmoud
On the Average Height of b-Balanced Ordered Trees
Pages 175-218
Rainer Kemp
Measuring Post–Quickselect Disorder
Pages 219-249
Alois Panholzer; Helmut Prodinger; Marko Riedel
Periodic Oscillations in the Analysis of Algorithms and Their Cancellations
Pages 251-270
Helmut Prodinger
QUICKSELECT Revisited
Pages 271-296
Uwe R¨osler
Probability Generating Functions for Sattolo’s Algorithm
Pages 297-308
Mark C. Wilson
)