Phase transition for parking blocks, Brownian excursion and coalescence

Philippe Chassaing (1) , Guy Louchard (2)

1 IECN - Institut Élie Cartan de Nancy
2 ULB - Département d'Informatique [Bruxelles]

In this paper, we consider hashing with linear probing for a hashing table with m places, n items (n < m), and l = m

Mots clés: Hashing with linear probing; parking; Brownian excursion; empirical processes; coalescence

Domaines: Probabilités [math.PR]; Algorithme et structure de données [cs.DS]

Philippe Chassaing, Guy Louchard. Phase transition for parking blocks, Brownian excursion and coalescence. Random Structures and Algorithms, 2002, 21, pp.76-119. ⟨hal-00003777⟩