strongly universal hashing is pretty fast (2000)

by M Thorup, “Even
Venue:in Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms