New Bounds for Perfect Hashing via Information Theory
- 1 November 1988
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 9 (6) , 523-530
- https://doi.org/10.1016/s0195-6698(88)80048-9
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- 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