Abstract
This paper demonstrates how a broad collection of hash function families can be expressed as dynamical systems. We then show that this representation can be useful for analysis. In particular, we provide an analysis which proves that a widely-used family of double hash functions will transform any initial distribution of keys into the uniform distribution over the table space.
Original language | English (US) |
---|---|
Pages | S919-S920 |
State | Published - 1999 |
Externally published | Yes |
Event | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA Duration: Jan 17 1999 → Jan 19 1999 |
Other
Other | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms |
---|---|
City | Baltimore, MD, USA |
Period | 1/17/99 → 1/19/99 |
ASJC Scopus subject areas
- Software
- General Mathematics