The Exponential Hash Function

ACM Journal of Experimental Algorithmics

Volumn 2, Issue , 1997, Pages 3-

  Smith, Bradley J ^a   Heileman, Gregory L ^a   Abdallah, Chaouki ^a  

^a MSC01 1070   (United States)

Author keywords

Algorithms; Chaos; dynamic dictionary ADT; dynamical systems theory; exponential hashing; Lyapunov exponent; number theory

Indexed keywords

EID: 84858546221     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/264216.264221     Document Type: Article

References (7)

1. Heileman, G. L. 1996. Data Structures, Algorithms and Object-oriented Programming. McGraw-Hill, New York, NY.
2. Heileman, G. L., Abdallah, C., Hush, D. R., and Baglio, S. 1993. Chaotic probe strategies in open address hashing. In Proceedings of International Symposium on Nonlinear Theory and its Applications, pp. 1183-1188.
3. Knuth, D. E. 1973. The Art of Computer Programming, Volume 3. Addison-Wesley Publishing Co.
4. Peitgen, H.-O., Jürgens, H., and Saupe, D. 1992. Chaos and Fractals: New Frontiers of Science. Springer-Verlag, New York.
5. Peterson, W. W. 1957. Addressing for random access storage. IBM Journal of Research and Development 1, 2, 130-146.
6. Shannon, C. E. 1948. A mathematical theory of communication. Bell Systems Technical Journal 27, 379-423.
7. Stinson, D. 1995. Cryptography Theory and Practice. CRC Press, Boca Raton, FL.