High Speed Hashing for Integers and Strings

Indexing for rapid random access memory systems

A. I. Dumey · 1956

Earlier work this paper cites.

Universal classes of hash functions

J. Carter and M. Wegman · 1979

Earlier work this paper cites.

New hash functions and their use in authentication and set equality

M. Wegman and J. Carter · 1981

Earlier work this paper cites.

Polynomial hash functions are reliable (extended abstract)

M. Dietzfelbinger, J. Gil, Y. Matias, and N. Pippenger · 1992

Earlier work this paper cites.

Randomized Algorithms

R. Motwani and P. Raghavan · 1995

Cited alongside, same era.

Universal hashing and k k -wise independent random variables via integer arithmetic without primes

M. Dietzfelbinger · 1996

Cited alongside, same era.

A reliable randomized algorithm for the closest-pair problem

M. Dietzfelbinger, T. Hagerup, J. Katajainen, and M. Penttonen · 1997

Cited alongside, same era.

UMAC: fast and secure message authentication

J. Black, S. Halevi, H. Krawczyk, T. Krovetz, and P. Rogaway · 1999

Cited alongside, same era.

Trajectory sampling with unreliable reporting

N. G. Duffield and M. Grossglauser · 2008

Later among the works it cites.

Introduction to algorithms

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein · 2009

Later among the works it cites.

Fast and powerful hashing using tabulation (research highlight)

Original

M. Thorup · 2017

Closest in time.