54 search results - page 2 / 11 » On the Analysis of Linear Probing Hashing |
ASIAN
2004
Springer
13 years 10 months ago
2004
Springer
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 ...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
ACSC
2009
IEEE
13 years 11 months ago
2009
IEEE
A hash table is a fundamental data structure in computer science that can offer rapid storage and retrieval of data. A leading implementation for string keys is the cacheconscious...