Date:    Monday Feb 15, 4:30pm
Speaker: Matthew Devos

Abstract:
I will discuss hash functions, and in particular families of perfect hash 
functions.  The first part of my talk will consist of some results from a 
paper by Yao (81) which will serve to introduce the subject.  Then I will 
move on to an information theory result of Fredman and Komlos (84) which 
can be used to get bounds on the sizes of families of perfect hash functions.