Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Dynamical System Representation of Open Address Hash Functions Gregory L. Heileman
 

Summary: Dynamical System Representation of Open Address Hash Functions
Gregory L. Heileman

Chaouki T. Abdallah

Bernard M. E. Moret

Bradley J. Smith

heileman@eece.unm.edu chaouki@eece.unm.edu moret@cs.unm.edu bsmith@eece.unm.edu
Department of Electrical and Computer Engineering

Department of Computer Science

University of New Mexico, Albuquerque, NM 87131
Introduction. Number theory and probabilistic analyses have typically been used to justify the use of
various probing strategies for open address hashing. For example, Guibas and Szemeredi [1], and later
Lueker and Molodowitch [3], have shown that double hashing offers a good approximation to uniform
hashing if the hash function is assumed to select table entries with equal probability. In this paper we use
an analysis based on nonlinear dynamical systems theory to provide a similar result, without making any

  

Source: Abdallah, Chaouki T- Electrical and Computer Engineering Department, University of New Mexico

 

Collections: Engineering