Reducing the Storage Requirements of a Perfect Hash Function.

@article{DBLP:journals/tkde/FeliceM98,
  author    = {Paolino Di Felice and
               Ugo Madama},
  title     = {Reducing the Storage Requirements of a Perfect Hash Function},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {10},
  number    = {6},
  year      = {1998},
  pages     = {1005-1007},
  ee        = {db/journals/tkde/FeliceM98.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1998 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

Online Edition: IEEE Computer Society DL

References

[1]

Marshall D. Brain, Alan L. Tharp: Using Tries to Eliminate Pattern Collisions in Perfect Hashing. IEEE Trans. Knowl. Data Eng. 6(2): 239-247(1994) BibTeX

[2]

Marshall D. Brain, Alan L. Tharp: Perfect hashing using sparse matrix packing. Inf. Syst. 15(3): 281-290(1990) BibTeX

[3]

Zbigniew J. Czech, George Havas, Bohdan S. Majewski: An Optimal Algorithm for Generating Minimal Perfect Hash Functions. Inf. Process. Lett. 43(5): 257-264(1992) BibTeX

[4]

...