1 paper
Philippe Chassaing, Guy Louchard
In this paper, we consider hashing with linear probing for a hashing table with m places, n items (n < m), and l = m<n empty places. For a non computer science-minded reader, we sh…