Ulf Schellbach

According to our database, Ulf Schellbach authored at least 5 papers between 2005 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2010

Analysis of Algorithms.

Heiner Ackermann, Heiko Röglin, Ulf Schellbach, Nils Schweer

Proceedings of the Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar], 2010

2009

On risks of using a high performance hashing scheme with common universal classes.

Ulf Schellbach

PhD thesis, 2009

Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes.

Martin Dietzfelbinger, Ulf Schellbach

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

On risks of using cuckoo hashing with simple universal hash classes.

Martin Dietzfelbinger, Ulf Schellbach

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2005

Theoretical analysis of a mutation-based evolutionary algorithm for a tracking problem in the lattice.

Thomas Jansen, Ulf Schellbach

Proceedings of the Genetic and Evolutionary Computation Conference, 2005