On Numbers Related to Partitions of Unlike Objects and Occupancy Problems. - Lars Holst (Eur. J. Comb., 1981)

The General Birthday Problem. - Lars Holst (Random Struct. Algorithms, 1995)

On the distribution of search cost for the move-to-front rule. - James Allen Fill; Lars Holst (Random Struct. Algorithms, 1996)

Logarithmic Combinatorial Structures: A Probabilistic Approach, by RichardcArratia, A. D. Barbour and Simon Tavaré. - Lars Holst (Comb. Probab. Comput., 2004)

On the expected longest length probe sequence for hashing with separate chaining. - Pedro Reviriego; Lars Holst; Juan Antonio Maestro (J. Discrete Algorithms, 2011)

A Proof of Euler's Infinite Product for the Sine. - Lars Holst (Am. Math. Mon., 2012)

Probabilistic Proofs of Euler Identities. - Lars Holst (J. Appl. Probab., 2013)

Runs in coin tossing: a general approach for deriving distributions for functionals. - Lars Holst; Takis Konstantopoulos (J. Appl. Probab., 2015)