Combined Calendar of Seminars on Algorithms and Complexity
The Joint ALADDIN/Theory/Operations
Friday, 3:30 - 5:00pm, Wean Hall 7220 (unless otherwise noted)
This seminar series typically features invited speakers on topics of interest to the CS theory community.
Wednesday, 12:00 - 1:00pm, Newell Simon Hall 1507 (unless otherwise noted)
Theory Lunch is an informal seminar run by Algorithms
and Complexity Theory Group. It is open to faculty, graduate
and undergraduate students interested in theoretical aspects of
Computer Science. The meetings have various forms: talks on recently
completed results, joint reading of an interesting paper, presentations
of current work in progress and exciting open problems, etc.
Algorithms, Combinatorics and Optimization
Thursday, 4:00 - 5:30pm, Physical Plant Building 300
The ACO Seminar is sponsored by the ACO
Program which is an interdisciplinary Ph.D program administered
jointly by the Tepper School of Business (Operations
Research group) and the Computer Science Department (Algorithms
and Complexity group).
Operations Research Seminar
Friday, 2:00pm, Tepper School of Business (location varies)