Uniform hashing in constant time and linear space

DOI10.1145/780542.780633MaRDI QIDQ3581259zbMATH OpenOpenAlexFDO

Authors Anna Östlin, Rasmus Pagh

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)

Recommendations

• Uniform Hashing in Constant Time and Optimal Space
• scientific article; zbMATH DE number 177800
• Simple and Space-Efficient Minimal Perfect Hash Functions
• scientific article; zbMATH DE number 6351507
• On Universal Classes of Extremely Random Constant-Time Hash Functions

Cited in

(13)

• Unique permutation hashing
• Algorithms for projecting points to give the most uniform distribution with applications to hashing
• Balanced allocation and dictionaries with tightly packed constant size bins
• Derandomized constructions of \(k\)-wise (almost) independent permutations
• A unified approach to linear probing hashing with buckets
• Tight Bounds for Hashing Block Sources
• Uniform Hashing in Constant Time and Optimal Space
• scientific article; zbMATH DE number 177800 (Why is no real title available?)
• Linear hashing is awesome
• scientific article; zbMATH DE number 1445340 (Why is no real title available?)
• Algorithmic aspects in speech recognition
• Optimal non-adaptive cell probe dictionaries and hashing
• Layered hashing algorithm for real-time systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581259)