DIMACS Mixer Series - September 21, 2001

AT&T Labs - Research, Florham Park, New Jersey

12:15 - 1:00     Lunch

1:00 - 1:40      Mikkel Thorup, DIMACS member, AT&T Labs
                 Compact Oracles for Reachability and Approximate Distances
                 in Planar Digraphs

1:40 - 1:45      Questions

1:45 - 2:05      Ofer Melnik, DIMACS-AT&T Labs Postdoc
                 Relationships in High-Dimensional Classifiers

2:05 - 2:10      Questions

2:10 - 2:30      Detlef Ronneburger, Graduate Student, Rutgers 
                 Relationships between Komogorov Complexity
                 and Circuit Complexity and some consequences

2:30 - 2:35      Questions

2:35 - 2:55      Coffee break

2:55 - 3:15      Gabriela Alexe, Graduate Student, Rutgers
                 Consensus Algorithms for the Generation of All
                 Maximal Bicliques 

3:15 - 3:20      Questions

3:20 - 4:00      Emina Soljanin, DIMACS member, Bell Labs
                 Writing Sequences on the Plane

4:00 - 4:05      Questions