Sciweavers

ASIAN
2004
Springer
69views Algorithms» more  ASIAN 2004»
14 years 5 months ago
Using Optimal Golomb Rulers for Minimizing Collisions in Closed Hashing
Abstract. We give conditions for hash table probing which minimize the expected number of collisions. A probing algorithm is determined by a sequence of numbers denoting jumps for ...
Lars Lundberg, Håkan Lennerstad, Kamilla Klo...