88 citations · 92 across the 5 of their papers we have counts for
1 paper · 1 filter
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…