### DIMACS Mixer Series - October 9, 2001

#### NEC Research, Princeton, New Jersey

12:15 - 1:00 Lunch
1:00 - 1:40 Mario Szegedy, DIMACS member, Rutgers
Computing Boolean Functions from Multiple
Faulty Copies of Input Bits
1:40 - 1:45 Questions
1:45 - 2:05 Kobbi Nissim, DIMACS-NECI Postdoctoral Fellow
Communication complexity and Secure Function Evaluation
2:05 - 2:10 Questions
2:10 - 2:30 Michal Koucky, Rutgers Graduate Student
Universal Exploration Sequences
2:30 - 2:35 Questions
2:35 - 2:55 Coffee break
2:55 - 3:15 Venkatesh Srinivasan, DIMACS-Institute for Advanced Study
Postdoctoral Fellow
On the Advantage Over a Random Assignment
3:15 - 3:20 Questions
3:20 - 3:40 Anthony Wirth, Princeton Graduate Student
Informational Complexity and the Direct Sum Problem
for Simultaneous Message Complexity
3:40 - 3:45 Questions
3:45 - 4:25 Carl Pomerance, DIMACS member, Bell Labs
Carmichael's Function
4:25 - 4:30 Questions

Document last modified on October 8, 2001.