Bounds for c-Ideal Hashing
- 21 September 2023
- book chapter
- Published by Springer Nature
- p. 205-220
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Pairwise Independence and DerandomizationFoundations and Trends® in Theoretical Computer Science, 2006
- Perfect Hash Families: Probabilistic Methods and Explicit ConstructionsJournal of Combinatorial Theory, Series A, 2000
- Balls and bins: A study in negative dependenceRandom Structures & Algorithms, 1998
- The Spatial Complexity of Oblivious k-Probe Hash FunctionsSIAM Journal on Computing, 1990
- Fredman–Komlós bounds and information theorySIAM Journal on Algebraic Discrete Methods, 1986
- On the Size of Separating Systems and Families of Perfect Hash FunctionsSIAM Journal on Algebraic Discrete Methods, 1984
- Scatter storage techniquesCommunications of the ACM, 1983
- Expected Length of the Longest Probe Sequence in Hash Code SearchingJournal of the ACM, 1981
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- Scatter storage techniquesCommunications of the ACM, 1968