Bounds for \(c\)-ideal hashing
From MaRDI portal
Publication:6546593
DOI10.1007/978-3-031-43587-4_15MaRDI QIDQ6546593
Publication date: 29 May 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Universal classes of hash functions
- Perfect hash families: Probabilistic methods and explicit constructions
- Beating Fredman-Komlós for perfect \(k\)-hashing
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- On the Size of Separating Systems and Families of Perfect Hash Functions
- A Remark on Stirling's Formula
- The Spatial Complexity of Oblivious k-Probe Hash Functions
- Pairwise Independence and Derandomization
- Fredman–Komlós bounds and information theory
- Efficient randomized pattern-matching algorithms
- Expected Length of the Longest Probe Sequence in Hash Code Searching
- Balls and bins: A study in negative dependence
- Algorithms and Data Structures
- Algorithmen und Datenstrukturen
This page was built for publication: Bounds for \(c\)-ideal hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546593)
