Dissertation

On Risks of Using a High Performance Hashing Scheme with Common Universal Classes

Thomas Jansen and Ulf Schellbach. Theoretical analysis of a mutation-based evolutionary algorithm for a tracking problem in the lattice. H.-G. Beyer, U.-M. O'Reilly, D.V. Arnold, W. Banzhaf, C. Blum,E.W. Bonabeau, E. Cantu Paz, D. Dasgupta, K. Deb, J.A. Foster, E.D.de~Jong, H. Lipson, X. Llora, S. Mancoridis, M. Pelikan, G.R. Raidl, T. Soule, A. Tyrrell, J.-P. Watson, E. Zitzler (Eds.): Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2005). ACM Press, pages 841-848

Martin Dietzfelbinger and Ulf Schellbach.  On Risks of Using Cuckoo Hashing with Simple Universal Hash Classes. In Proc. 20th ACM-SIAM Symp. on Discrete Algorithms (SODA '09), pages 795-804, 2009.  (Best Paper Award der TU Ilmenau in der Kategorie "Mathematik und Naturwissenschaften")

Martin Dietzfelbinger and Ulf Schellbach: Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes. In  Proc. 35th Conf. on Current Trends in Theory and Practice of Computer Science (SofSem '09), pages 217-228, 2009.