On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications

Annual Symposium on Foundations of Computer Science (Proceedings)

Volumn , Issue , 1989, Pages 20-25

  Siegel, Alan ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY--COMPUTABILITY AND DECIDABILITY; COMPUTER SYSTEMS PROGRAMMING--MULTIPROCESSING PROGRAMS;

DOUBLE HASHING; HASH FUNCTIONS; OMEGA NETWORKS; PARALLEL ALGORITHMS;

COMPUTER PROGRAMMING;

EID: 0024768554     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.1989.63450     Document Type: Conference Paper

References (21)