DIMACS Mixer Series, December 4, 2003
Fall Mixer III
Friend Center, Room 101, Princeton University, Princeton, NJ
Program:
11:10 - 11:15 Opening remarks
Sanjeev Arora, Princeton University
11:15 - 11:55 Computational functional genomics: getting from high-throughput
data to accurate information in biology
Olga Troyanosky, Princeton University
11:55 - 12:00 Discussion
12:00 - 1:00 Lunch
1:00 - 1:20 Crowding effects promote coexistence in the chemostat
Patrick Leenheer, Rutgers postdoc
1:20 - 1:25 Discussion
1:25 - 1:45 Counting/Enumerating Spanning Trees in (di-) Graph
Xuerong Yong, DIMACS postdoc
1:45 - 1:50 Discussion
1:50 - 2:10 Tight Examples for the Erdos-Selfridge Theorem in
Positional Game Theory
Eric Sundberg, Rutgers grad student
2:10 - 2:15 Discussion
2:15 - 2:35 Tumbleweeds and the Extra Edge Paradox
Klay Kruzcek, Rutgers grad student
2:35 - 2:40 Discussion
2:40 - 3:15 Break
3:15 - 3:45 The structure of claw-free graphs
Maria Chudnovsky, Princeton/Clay Mathematics Institute/IAS
3:45 - 3:50 Discussion
3:50 - 4:10 Quantum Algorithms
Sean Hallgren, NEC Labs
4:10 - 4:15 Discussion
4:15 - 4:20 Any closing remarks
Document last modified on November 26, 2003.