![]() | ![]() |
| 2003 | ||
|---|---|---|
| 5 | Robert P. Dobrow, James Allen Fill: Speeding up the FMMR perfect sampling algorithm: A case study revisited. Random Struct. Algorithms 23(4): 434-452 (2003) | |
| 1999 | ||
| 4 | Robert P. Dobrow, James Allen Fill: Total Path Length For Random Recursive Trees. Combinatorics, Probability & Computing 8(4): 317-333 (1999) | |
| 1997 | ||
| 3 | James Allen Fill, Robert P. Dobrow: The Number of m-ary Search Trees on n Keys. Combinatorics, Probability & Computing 6(4): 435-453 (1997) | |
| 1996 | ||
| 2 | Robert P. Dobrow, James Allen Fill: Multiway trees of Maximum and Minimum Probability under the Random Permutation Model. Combinatorics, Probability & Computing 5: 351-371 (1996) | |
| 1 | Robert P. Dobrow, Robert T. Smythe: Poisson approximations for functionals of random trees. Random Struct. Algorithms 9(1-2): 79-92 (1996) | |
| 1 | James Allen Fill | [2] [3] [4] [5] |
| 2 | Robert T. Smythe | [1] |
Colors in the list of coauthors
Last update Tue May 29 01:28:40 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page