Polynomial hash functions are reliable

This publication has 22 references indexed in Scilit:

• A new universal class of hash functions and dynamic hashing in real time
  Published by Springer Nature ,2005
• Towards a theory of nearly constant time parallel algorithms
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• A complexity theory of efficient parallel algorithms
  Theoretical Computer Science, 1990
• On the power of two-point based sampling
  Journal of Complexity, 1989
• A fast and simple randomized parallel algorithm for the maximal independent set problem
  Journal of Algorithms, 1986
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
  SIAM Journal on Computing, 1986
• Two results on tables
  Information Processing Letters, 1986
• Parallel hashing---an efficient implementation of shared memory
  Published by Association for Computing Machinery (ACM) ,1986
• Storing a Sparse Table with 0 (1) Worst Case Access Time
  Journal of the ACM, 1984
• On a Set of Almost Deterministic $k$-Independent Random Variables
  The Annals of Probability, 1974