Author Index
C
  • Chauvin, Brigitte Connecting Yule Process, Bisection and Binary Search Tree via Martingales [Volume 3, Issue 2, 2004, Pages 89-116]
D
  • Drmota, Michael Profile and Height of Random Binary Search Trees [Volume 3, Issue 2, 2004, Pages 117-138]
J
  • Jacquet, Philippe Compact Suffix Trees Resemble PATRICIA Tries: Limiting Distribution of the Depth [Volume 3, Issue 2, 2004, Pages 139-148]
  • Janson, Svante One-Sided Interval Trees [Volume 3, Issue 2, 2004, Pages 149-164]
  • Johnson, Norman P´olya-Type Urn Models with Multiple Drawings [Volume 3, Issue 2, 2004, Pages 165-173]
K
  • Kemp, Rainer On the Average Height of b-Balanced Ordered Trees [Volume 3, Issue 2, 2004, Pages 175-218]
  • Kotz, Samuel P´olya-Type Urn Models with Multiple Drawings [Volume 3, Issue 2, 2004, Pages 165-173]
M
  • Mahmoud, Hosam P´olya-Type Urn Models with Multiple Drawings [Volume 3, Issue 2, 2004, Pages 165-173]
  • McVey, Bonita Compact Suffix Trees Resemble PATRICIA Tries: Limiting Distribution of the Depth [Volume 3, Issue 2, 2004, Pages 139-148]
  • Muralidharan, K‎. A Conditional Test for Exponentiality Against Weibull DFR Alternatives Based on Censored‎ ‎Samples [Volume 3, Issue 1, 2004, Pages 69-81]
P
  • Panholzer, Alois Measuring Post–Quickselect Disorder [Volume 3, Issue 2, 2004, Pages 219-249]
  • Prakasa Rao, B‎. ‎L‎. ‎S‎. Moment Inequalities for Supremum of Empirical Processes of‎ ‎U-Statistic Structure and Application to Density Estimation [Volume 3, Issue 1, 2004, Pages 59-68]
  • Prodinger, Helmut Measuring Post–Quickselect Disorder [Volume 3, Issue 2, 2004, Pages 219-249]
  • Prodinger, Helmut Periodic Oscillations in the Analysis of Algorithms and Their Cancellations [Volume 3, Issue 2, 2004, Pages 251-270]
R
  • Riedel, Marko Measuring Post–Quickselect Disorder [Volume 3, Issue 2, 2004, Pages 219-249]
  • Rosychuk, Rhonda J. Parameter Identifiability Issues in a‎ ‎Latent Ma‎- ‎rkov Model for Misclassified Binary Responses [Volume 3, Issue 1, 2004, Pages 39-57]
  • Rouault, Alain Connecting Yule Process, Bisection and Binary Search Tree via Martingales [Volume 3, Issue 2, 2004, Pages 89-116]
  • R¨osler, Uwe QUICKSELECT Revisited [Volume 3, Issue 2, 2004, Pages 271-296]
S
  • Shanubhogue, Ashok A Conditional Test for Exponentiality Against Weibull DFR Alternatives Based on Censored‎ ‎Samples [Volume 3, Issue 1, 2004, Pages 69-81]
  • Singpurwalla, Nozer D‎. When Can Finite Testing Ensure Infinite Trustworthiness? [Volume 3, Issue 1, 2004, Pages 1-37]
  • Szpankowski, Wojciech Compact Suffix Trees Resemble PATRICIA Tries: Limiting Distribution of the Depth [Volume 3, Issue 2, 2004, Pages 139-148]
T
  • Thompson, ‎Mary E. Parameter Identifiability Issues in a‎ ‎Latent Ma‎- ‎rkov Model for Misclassified Binary Responses [Volume 3, Issue 1, 2004, Pages 39-57]
W
  • Wilson, Mark C. Probability Generating Functions for Sattolo’s Algorithm [Volume 3, Issue 2, 2004, Pages 297-308]
  • Wilson, Philip When Can Finite Testing Ensure Infinite Trustworthiness? [Volume 3, Issue 1, 2004, Pages 1-37]