LoboVault Home
 

Dynamical system representation of open address hash functions

LoboVault

Please use this identifier to cite or link to this item: http://hdl.handle.net/1928/20333

Dynamical system representation of open address hash functions

Show full item record

Title: Dynamical system representation of open address hash functions
Author: Abdallah, Chaouki T.; Heileman, Gregory L.; Moret, Bernard M. E.; Smith, Bradley J.
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.
Date: 1999-01-01
Publisher: Society for Industrial and Applied Mathematics
Citation: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, 919-920
URI: http://hdl.handle.net/1928/20333
ISBN: 0-89871-434-6

Files in this item

Files Size Format View
Abdallah et al ... address hash functions.pdf 212.5Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record

UNM Libraries

Search LoboVault


Advanced Search

Browse

My Account