Sciweavers

STOC
2003
ACM
178views Algorithms» more  STOC 2003»
15 years 23 days ago
Uniform hashing in constant time and linear space
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...
Anna Östlin, Rasmus Pagh