BIBLIOGRAPHY 141
[21] C. C. Chang and C. Y. Lin. A perfect hashing schemes for mining association rules.
The Computer Journal, 48(2):168–179, 2005.
[22] C. C. Chang, C. Y. Lin, and H. Chou. Perfect hashing schemes for mining traversal
patterns. Journal of Fundamenta Informaticae, 70(3):185–202, 2006.
[23] B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal. The bloomier filter: An efficient data
structure for static support lookup tables. In Proceedings of the 15th annual ACM-
SIAM symposium on Discrete algorithms (SODA’04), pages 30–39, Philadelphia, PA,
USA, 2004. Society for Industrial and Applied Mathematics.
[24] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms.
MIT Press, second edition, 2001.
[25] Z. J. Czech, G. Havas, and B. S. Majewski. An optimal algorithm for generating
minimal perfect hash functions. Information Processing Letters, 43(5):257–264, 1992.
[26] Z. J. Czech, G. Havas, and B. S. Majewski. Fundamental study perfect hashing.
Theoretical Computer Science, 182:1–143, 1997.
[27] A. M. Daoud. Perfect hash functions for large web repositories. In G. Kotsis, D. Taniar,
S. Bressan, I. K. Ibrahim, and S. Mokhtar, editors, Proceedings of the 7th Interna-
tional Conference on Information Integration and Web Based Applications S ervices
(iiWAS’05), volume 196, pages 1053–1063. Austrian Computer Society, 2005.
[28] E. Demaine, F. Meyer auf der Heide, R. Pagh, and M. Pˇatra¸scu. De dictionariis
dynamicis pauco spatio utentibus. In Proceedings of the Latin American Symposium
on Theoretical Informatics (LATIN’06), pages 349–361, 2006.
[29] M. Dietzfelbinger and T. Hagerup. Simple minimal perfect hashing in less space. In
Proceedings of the 9th European Symposium on Algorithms (ESA’01), pages 109–120.
Springer LNCS vol. 2161, 2001.
[30] M. Dietzfelbinger and C. Weidling. Balanced allocation and dictionaries with tightly
packed constant size bins. In Proceedings of 32nd International Colloquium on Au-
tomata, Languages and Programming (ICALP’05), pages 166–178, 2005.
[31] M. Dietzfelbinger and P. Woelfel. Almost random graphs with simple hash functions.
In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
(STOC’03), pages 629–638, New York, NY, USA, 2003. ACM.