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 4623 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.

Spring 2003 Schedule

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

TIME SPEAKER TITLE
January 22, Wednesday Shuchi Chawla Payoffs in Location Games
January 29, Wednesday Maverick Woo SODA Bites
February 5, Wednesday Nikhil Bansal Data Streaming Algorithms
February 12, Wednesday Abraham Flaxman Modelling The Web Graph
February 19 Wednesday Anupam Gupta Designing networks without knowing the traffic matrix
February 26, Wednesday Ke Yang Universal Composability
March 5, Wednesday
No Speaker
No Theory Lunch
March 12, Wednesday Benoit Hudson Dynamic Delauney Triangulations
March 19, Wednesday Daniel Blandford Compact Representations of Separable Graphs
March 26, Wednesday
Spring Break
Spring Break
April 2, Wednesday David Cardoze Optimal algorithm for minimum edge cardinality cut surface
April 9, Wednesday Ke Yang Statistical Query Sampling and NMR Quantum Computing
April 16, Wednesday Charlie Garrod Locating Sources to Meet Flow Demands in Undirected Networks
April 23, Wednesday Konstantin Andreev Designing Overlay Multicast Networks for Streaming
April 30, Wednesday Kedar Dhamdhere Approximating Arbitrary Metrics by Tree Metics
May 7, Wednesday Bartosz Przydatek Sensor Networks and Interactive Proofs

Previous Seminar Series

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