| |
| 2005 | ||
|---|---|---|
| 3 | EE | Tamás F. Móri: The Maximum Degree of the Barabasi-Albert Random Tree. Combinatorics, Probability & Computing 14(3): 339-348 (2005) |
| 1993 | ||
| 2 | Tamás F. Móri: How Much Homogeneous Can the Appearing Pattern Be? Random Struct. Algorithms 4(1): 59-70 (1993) | |
| 1992 | ||
| 1 | Tamás F. Móri: Maximum Waiting Times are Asymptotically Independent. Combinatorics, Probability & Computing 1: 251-264 (1992) | |