Uniform hashing in constant time and linear space

DOI10.1145/780542.780633zbMath1192.68231OpenAlexW2164322063MaRDI QIDQ3581259

Rasmus Pagh, Anna Östlin

Publication date: 16 August 2010

Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/780542.780633

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (2)

Balanced allocation and dictionaries with tightly packed constant size bins ⋮ Derandomized constructions of \(k\)-wise (almost) independent permutations

This page was built for publication: Uniform hashing in constant time and linear space