Dispersing hash functions
From MaRDI portal
Publication:3055765
DOI10.1002/rsa.20257zbMath1200.94051MaRDI QIDQ3055765
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
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