ON THE SIZE OF SEPARATING SYSTEMS AND FAMILIES OF PERFECT HASH FUNCTIONS

被引:124
|
作者
FREDMAN, ML
KOMLOS, J
机构
来源
关键词
D O I
10.1137/0605009
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:61 / 68
页数:8
相关论文
共 50 条
  • [21] A sequence approach to linear perfect hash families
    Barwick, Susan G.
    Jackson, Wen-Ai
    DESIGNS CODES AND CRYPTOGRAPHY, 2007, 45 (01) : 95 - 121
  • [22] Some recursive constructions for perfect hash families
    Atici, M
    Magliveras, SS
    Stinson, DR
    Wei, WD
    JOURNAL OF COMBINATORIAL DESIGNS, 1996, 4 (05) : 353 - 363
  • [23] A sequence approach to linear perfect hash families
    Susan G. Barwick
    Wen-Ai Jackson
    Designs, Codes and Cryptography, 2007, 45 : 95 - 121
  • [24] Some intriguing upper bounds for separating hash families
    Gennian Ge
    Chong Shangguan
    Xin Wang
    Science China Mathematics, 2019, 62 : 269 - 282
  • [25] Some intriguing upper bounds for separating hash families
    Ge, Gennian
    Shangguan, Chong
    Wang, Xin
    SCIENCE CHINA-MATHEMATICS, 2019, 62 (02) : 269 - 282
  • [26] Some intriguing upper bounds for separating hash families
    Gennian Ge
    Chong Shangguan
    Xin Wang
    Science China Mathematics, 2019, 62 (02) : 269 - 282
  • [27] Hash and displace: Efficient evaluation of minimal perfect hash functions
    Pagh, R
    ALGORITHMS AND DATA STRUCTURES, 1999, 1663 : 49 - 54
  • [28] UNIFORMLY SEPARATING FAMILIES OF FUNCTIONS
    STERNFELD, Y
    ISRAEL JOURNAL OF MATHEMATICS, 1978, 29 (01) : 61 - 91
  • [29] Constructions of 2-cover-free families and related separating hash families
    Li, P. C.
    van Rees, G. H. J.
    Wei, R.
    JOURNAL OF COMBINATORIAL DESIGNS, 2006, 14 (06) : 423 - 440
  • [30] Constructing Perfect Hash Families Using a Greedy Algorithm
    Colbourn, Charles J.
    CODING AND CRYPTOLOGY, 2008, 4 : 109 - 118