1. Belazzougui, D., Botelho, F.C., Dietzfelbinger, M.: Hash, displace, and compress. Computer Research Repository (2009)
2. Lecture Notes in Computer Science;F.C. Botelho,2007
3. Chazelle, B., Kilian, J., Rubinfeld, R., Tal, A.: The bloomier filter: An efficient data structure for static support lookup tables. In: Proc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 30–39. SIAM, Philadelphia (2004)
4. Dietzel, L.: Speicherplatzeffiziente perfekte Hashfunktionen. Master’s thesis, Technische Universität Ilmenau (Novmber 2005) (in German)
5. Lecture Notes in Computer Science;M. Dietzfelbinger,2007