Raimund Seidel
E 1 3, Room 409
+49 (681) 302-4513 rseidel at cs.uni-saarland.de
Mo, Fr 11:00-12:00
Topics
Hashing is a powerful idea with applications ranging from data structures to cryptography. Although the idea is simple, its perfect realization has proven surprisingly difficult and seems to require a non-trivial mix of randomness and determinism. It is still a very active area of research. In this doctoral privatissimum we will various research papers on this subject.
Time & Date
A first, organizing meeting will be on Monday, April 22nd, 12:15, Bld. E1 3, Rm. 415.