Minimal perfect hashing

被引:0
|
作者
Pescio, C
机构
来源
DR DOBBS JOURNAL | 1996年 / 21卷 / 07期
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:101 / +
页数:5
相关论文
共 50 条
  • [1] Blooming Trees for Minimal Perfect Hashing
    Antichi, Gianni
    Ficara, Domenico
    Giordano, Stefano
    Procissi, Gregorio
    Vitucci, Fabio
    GLOBECOM 2008 - 2008 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, 2008,
  • [2] A practical minimal perfect Hashing method
    Botelho, FC
    Kohayakawa, Y
    Ziviani, N
    EXPERIMENTAL AND EFFICIENT ALGORITHMS, PROCEEDINGS, 2005, 3503 : 488 - 500
  • [4] Tight Bounds for Monotone Minimal Perfect Hashing
    Assadi, Sepehr
    Farach-Colton, Martin
    Kuszmaul, William
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 456 - 476
  • [5] THE STUDY OF AN ORDERED MINIMAL PERFECT HASHING SCHEME
    CHANG, CC
    COMMUNICATIONS OF THE ACM, 1984, 27 (04) : 384 - 387
  • [6] MINIMAL PERFECT HASHING IN POLYNOMIAL-TIME
    WINTERS, VG
    BIT, 1990, 30 (02): : 235 - 244
  • [7] IP lookup using Minimal Perfect Hashing
    Hang, Yuanyuan
    Xu, Mingwei
    Chen, Penghan
    Wang, Ning
    2016 IEEE/ACM 24TH INTERNATIONAL SYMPOSIUM ON QUALITY OF SERVICE (IWQOS), 2016,
  • [8] MINIMAL PERFECT HASHING FOR LARGE SETS OF DATA
    WINTERS, VG
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 468 : 275 - 284
  • [9] THE STUDY OF AN ORDERED MINIMAL PERFECT HASHING SCHEME
    MILLER, BA
    COMMUNICATIONS OF THE ACM, 1986, 29 (10) : 1001 - 1001
  • [10] THE STUDY OF AN ORDERED MINIMAL PERFECT HASHING SCHEME
    WHEELER, ES
    COMMUNICATIONS OF THE ACM, 1984, 27 (11) : 1156 - 1156