 | 2002 |
| 10 |  | Robert T. Smythe,
J. A. Wellner:
Asymptotic analysis of (3, 2, 1)-shell sort.
Random Struct. Algorithms 21(1): 59-75 (2002) |
| 2001 |
| 9 |  | Robert T. Smythe,
J. Wellner:
Stochastic Analysis of Shell Sort.
Algorithmica 31(3): 442-457 (2001) |
| 8 |  | Robert T. Smythe:
The Boyer-Moore-Horspool heuristic with Markovian input.
Random Struct. Algorithms 18(2): 153-163 (2001) |
| 1998 |
| 7 |  | Hosam M. Mahmoud,
Robert T. Smythe:
Probabilistic Analysis of MULTIPLE QUICK SELECT.
Algorithmica 22(4): 569-584 (1998) |
| 1997 |
| 6 |  | Hosam M. Mahmoud,
Robert T. Smythe,
Mireille Régnier:
Analysis of Boyer-Moore-Horspool string-matching heuristic.
Random Struct. Algorithms 10(1-2): 169-186 (1997) |
| 1996 |
| 5 |  | Robert P. Dobrow,
Robert T. Smythe:
Poisson approximations for functionals of random trees.
Random Struct. Algorithms 9(1-2): 79-92 (1996) |
| 1995 |
| 4 |  | Hosam M. Mahmoud,
Reza Modarres,
Robert T. Smythe:
Analysis of Quickselect: An Algorithm for Order Statistics.
ITA 29(4): 255-276 (1995) |
| 3 |  | Hosam M. Mahmoud,
Robert T. Smythe:
Probabilistic Analysis of Bucket Recursive Trees.
Theor. Comput. Sci. 144(1&2): 221-249 (1995) |
| 1993 |
| 2 |  | Hosam M. Mahmoud,
Robert T. Smythe,
Jerzy Szymanski:
On the Structure of Random Plane-oriented Recursive Trees and Their Branches.
Random Struct. Algorithms 4(2): 151-176 (1993) |
| 1992 |
| 1 |  | Hosam M. Mahmoud,
Robert T. Smythe:
Asymptitic Hoint Normality of Outdegrees of Nodes in Random Recursive Trees.
Random Struct. Algorithms 3(3): 255-266 (1992) |