DIMACS Mixer Series - September 22, 1999

DIMACS Center, Rutgers University, Piscataway, NJ

Preliminary Program:

12:30-1:15	Lunch

1:15-1:55       Lance Fortnow,  NEC Research    
                "Optimal Proof Systems and Sparse Sets" 
1:55-2.00       Questions

2.00-2.15       Ee-Chien Chang, DIMACS
                "Foveation Techniques and Scheduling Issues in Visualization of Large Images"
2.15-2.20       Questions

2:20-2:35       Bernardo Abrego, Dept. of Mathematics, Rutgers University
                "Structural Results for Planar sets with many similar subsets"
2:35-3:00       Questions

2:40-2:55       Christophe Long, Dept. of Mathematics, Rutgers University
                "An Improved Bound for Frankl's Conjecture"
2:55-3:00       Questions

3:00-3:20       Coffee Break

3:20-4:00       Jaroslav Nesetril, DIMATIA
                "Good Characterization for Coloring Problems"
4:00-4:05       Questions

4:05-4:20       Myongsu Choe, DIMACS, Rutgers University
                "Global Internet Simulation"
4:20-4:25       Questions

4:25-5:05       Sivaram Rajagopalan, Telcordia Technologies
                "Self-configuring Systems"
5:05-5:10       Questions

Document last modified on September 15, 1999.