| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| 4 |      | Pedro Reviriego, Lars Holst, Juan Antonio Maestro: On the expected longest length probe sequence for hashing with separate chaining. J. Discrete Algorithms 9(3): 307-312 (2011) |
| 2004 | ||
| 3 | | Lars Holst: Logarithmic Combinatorial Structures: A Probabilistic Approach, by RichardcArratia, A. D. Barbour and Simon Tavaré. Combinatorics, Probability & Computing 13(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] |
| 2 | Juan Antonio Maestro | [4] |
| 3 | Pedro Reviriego | [4] |
Colors in the list of coauthors
Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page