Carnegie Mellon University, School of Computer Science

Theory Lunch

Theory Lunch is an informal seminar run by Algorithms and Complexity Theory Group on Wednesdays, noon till 1pm, in 7220 Wean Hall (unless otherwise specified). 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.

Fall 2003 Schedule

(Wednesdays noon-1:00pm, 7220 Wean Hall)

TIME SPEAKER TITLE
September 10, Wednesday Maverick Woo Understanding Combinatorial Preconditioners
September 17, Wednesday Abraham Flaxman Embracing the giant component
September 24, Wednesday Adam Wierman Classifying scheduling policies with respect to unfairness
October 1, Wednesday Nikhil Bansal (in Wean 4623) Packing Rectangles into Bins
October 8, Wednesday
No Theory Lunch
No Theory Lunch
October 15, Wednesday Kedar Dhamdhere Approximating minimum average distortion of non-contracting embeddings
October 22, Wednesday Ryan Williams New Exact Algorithms For Some Optimization Problems
October 29, Wednesday Maverick Woo FOCS Tidbits
November 5, Wednesday
No Theory Lunch
No Theory Lunch
November 12, Wednesday Shuchi Chawla Algorithms for Path-Planning Problems
November 19, Wednesday Amitabh Sinha Approximation Algorithms for Stochastic Optimization
November 26, Wednesday Takayuki Osagami Analysis of Cycle Stealing with Switching Cost
December 3, Wednesday
No Theory Lunch
No Theory Lunch
December 10, Wednesday Umut Acar Dynamizing Static Algorithms

Previous Seminar Series

maintained by Luis von Ahn (biglou@cs.cmu.edu)