dblp.uni-trier.dewww.uni-trier.de

Robert T. Smythe

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2002
10EERobert T. Smythe, J. A. Wellner: Asymptotic analysis of (3, 2, 1)-shell sort. Random Struct. Algorithms 21(1): 59-75 (2002)
2001
9EERobert 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
7EEHosam 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)
3EEHosam 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)

Coauthor Index

1Robert P. Dobrow [5]
2Hosam M. Mahmoud [1] [2] [3] [4] [6] [7]
3Reza Modarres [4]
4Mireille Régnier [6]
5Jerzy Szymanski [2]
6J. Wellner [9]
7J. A. Wellner [10]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)