Even strongly universal hashing is pretty fast

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2000, Pages 496-497

  Thorup, Mikkel ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

UNIVERSAL HASHING;

ALGORITHMS; FUNCTIONS;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0033893253     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)