Dispersing Hash functions
From MaRDI portal
Publication:3055765
DOI10.1002/RSA.20257zbMATH Open1200.94051OpenAlexW4250816705MaRDI QIDQ3055765FDOQ3055765
Authors: Rasmus Pagh
Publication date: 9 November 2010
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20257
Recommendations
- Deterministic coupon collection and better strong dispersers
- Tiny families of functions with random properties: A quality-size trade-off for hashing
- Tiny families of functions with random properties: a quality-size trade-off for hashing (preliminary version)
- Balls and bins: smaller hash families and faster evaluation
- scientific article; zbMATH DE number 1263224
Cites Work
- Universal classes of hash functions
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Constructing Efficient Dictionaries in Close to Sorting Time
- Balls and bins: A study in negative dependence
- The ๐^{๐กโ} prime is greater than ๐(ln๐+lnln๐-1) for ๐โฅ2
- Should Tables Be Sorted?
- Deterministic sorting in O(nloglogn) time and linear space
- Title not available (Why is that?)
- Title not available (Why is that?)
- Low redundancy in static dictionaries with constant query time
- Lossless condensers, unbalanced expanders, and extractors
- Extracting all the randomness and reducing the error in Trevisan's extractors
- Non-expansive hashing
- Implicit $O(1)$ Probe Search
Cited In (3)
This page was built for publication: Dispersing Hash functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055765)