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.

Note: Theory Lunch takes place every Wednesday except the 4th Wednesday of each month

Fall 2001 Schedule

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

Sept. 4, Tuesday,
Wean Hall 4623
Mor Harchol-Balter Task Assignment with Unknown Duration
Sept. 12, Wednesday Ke Yang New Ideas from CRYPTO'01 -- parallel coin-toss and key establishment using human-password only.
Sept. 19, Wednesday Ke Yang Parallel coin-tossing (part 2)
Sept. 26, Wednesday - (no Theory Lunch -> 4th Wednesday of the month)
Oct. 3, Wednesday Shuchi Chawla Algorithmic Mechanism Design
Oct. 10, Wednesday Martin Zinkevich Learning in Games
Oct. 17, Wednesday - (no Theory Lunch -> FOCS 2001)
Oct. 24, Wednesday Jochen Könemann "Approximating Directed Multicuts" by J. Cheriyan, H. Karloff, Y. Rabani (FOCS 2001)
Oct. 31, Wednesday Maverick Woo Efficient Finger Search Using Eager Walk
Nov. 7, Wednesday Shuchi Chawla Algorithmic Mechanism Design (part 2)
Nov. 14, Wednesday Luis von Ahn What is Steganography?
Nov. 21, Wednesday - (no Theory Lunch -> Thanksgiving Break)
Nov. 28, Wednesday - (no Theory Lunch -> 4th Wednesday of the month)
Dec. 5, Wednesday Ted Wong Verifiable Secret Redistribution
Dec. 12, Wednesday Rocco Servedio, Harvard University Quantum Versus Classical Learning

Previous Seminar Series

last update: Nov. 11, 2001 maintained by Bartosz Przydatek (