Lars Holst

According to our database, Lars Holst authored at least 8 papers between 1981 and 2015.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2015

Runs in coin tossing: a general approach for deriving distributions for functionals.

Lars Holst, Takis Konstantopoulos

J. Appl. Probab., 2015

2013

Probabilistic Proofs of Euler Identities.

Lars Holst

J. Appl. Probab., 2013

2012

A Proof of Euler's Infinite Product for the Sine.

Lars Holst

Am. Math. Mon., 2012

2011

On the expected longest length probe sequence for hashing with separate chaining.

Pedro Reviriego, Lars Holst, Juan Antonio Maestro

J. Discrete Algorithms, 2011

2004

Logarithmic Combinatorial Structures: A Probabilistic Approach, by RichardcArratia, A. D. Barbour and Simon Tavaré.

Lars Holst

Comb. Probab. Comput., 2004

1996

On the distribution of search cost for the move-to-front rule.

James Allen Fill, Lars Holst

Random Struct. Algorithms, 1996

1995

The General Birthday Problem.

Lars Holst

Random Struct. Algorithms, 1995

1981

On Numbers Related to Partitions of Unlike Objects and Occupancy Problems.

Lars Holst

Eur. J. Comb., 1981