Abstract
In this paper, several minimal perfect hashing function generating methods are examined. One of them, the mincycle method by Sager is evaluated by the Monte Carlo method. The results are represented in graphs and tables.
Recommended Citation
Hou, Pao-Po and Sager, Thomas J., "A Monte Carlo Analysis of the Mincycle Algorithm for Generating Minimal Perfect Hash Functions" (1985). Computer Science Technical Reports. 6.
https://scholarsmine.mst.edu/comsci_techreports/6
Department(s)
Computer Science
Report Number
CSc-85-3
Document Type
Technical Report
Document Version
Final Version
File Type
text
Language(s)
English
Rights
© 1985 University of Missouri--Rolla, All rights reserved.
Publication Date
01 Jul 1985
