DIMACS Mixer Series - October 4, 1999

Telcordia Technologies, Morristown, NJ

Preliminary Program:

12:15 - 12:30  Arrival (please be sure to RSVP to bkaplan@dimacs.rutgers.edu by Sept. 30, 
                        Telcordia security needs the names of all attendees in advance to 
                        allow them into the building)

12:30 -  1:15  Lunch

 1:15 -  1:55  Ronitt Rubinfeld, NEC Research Institute
               Understanding noisy data: the case of polynomials
 1:55 -  2:00  Questions


 2:00 -  2:15  Yuval Ishai, DIMACS, Rutgers University
               Improved Upper Bounds on Information-Theoretic Private Information Retrieval
 2:15 -  2:20  Questions


 2:20 -  2:35  John Iacono, Computer Science, Rutgers University
               The Distribution Sensitive Performance of Pairing Heaps
 2:35 -  2:40  Questions


 2:40 -  2:55  George Karakostas, Computer Science, Princeton University
               Approximation Schemes for Minimum Latency Problems
 2:55 -  3:00  Questions


 3:00 -  3:20  Coffee Break


 3:20 -  3:35  Dieter Van Melkebeek, DIMACS, Rutgers University
               Graph Isomorphism and Derandomization
 3:35 -  3:40  Questions


 3:40 -  4:20  Neil Sloane, AT&T Shannon Lab, Florham Park, NJ
               The Online Encyclopedia of Integer Sequences
 4:20 -  4:25  Questions