Dispersing hash functions

DOI10.1002/rsa.20257zbMath1200.94051OpenAlexW4250816705MaRDI QIDQ3055765

Rasmus Pagh

Publication date: 9 November 2010

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20257

zbMATH Keywords

derandomizationhashingextractors

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• Universal classes of hash functions
• Non-expansive hashing
• Lossless condensers, unbalanced expanders, and extractors
• Low Redundancy in Static Dictionaries with Constant Query Time
• Constructing Efficient Dictionaries in Close to Sorting Time
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Should Tables Be Sorted?
• Implicit $O(1)$ Probe Search
• The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
• Balls and bins: A study in negative dependence
• Deterministic sorting in O(nloglogn) time and linear space
• Extracting all the randomness and reducing the error in Trevisan's extractors

This page was built for publication: Dispersing hash functions