| |
| 2004 | ||
|---|---|---|
| 3 | EE | Lars Holst: Logarithmic Combinatorial Structures: A Probabilistic Approach, by RichardcArratia, A. D. Barbour and Simon Tavaré. Combinatorics, Probability & Computing 37(6): 916-917 (2004) |
| 1996 | ||
| 2 | James Allen Fill, Lars Holst: On the distribution of search cost for the move-to-front rule. Random Struct. Algorithms 8(3): 179-186 (1996) | |
| 1995 | ||
| 1 | Lars Holst: The General Birthday Problem. Random Struct. Algorithms 6(2/3): 201-208 (1995) | |
| 1 | James Allen Fill | [2] |