Electrical & Computer Engineering Faculty Publications
Document Type
Article
Publication Date
1-1-1999
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.
Publisher
Society for Industrial and Applied Mathematics
Publication Title
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
ISSN
0-89871-434-6
First Page
919
Last Page
920
Language (ISO)
English
Sponsorship
Society for Industrial and Applied Mathematics
Recommended Citation
Abdallah, Chaouki T.; Gregory L. Heileman; Bernard M. Moret; and Bradley J. Smith. "Dynamical system representation of open address hash functions." Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms (1999): 919-920. https://digitalrepository.unm.edu/ece_fsp/188
