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.

Spring 2004 Schedule

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

TIME SPEAKER TITLE
January 21, Wednesday Benoit Hudson Cajun SODA
January 28, Wednesday Adam Wierman A Unified Framework For Modeling TCP Variants
February 4, Wednesday Jason Hartline On Seller Optimal Envy-Free Pricing
February 11, Wednesday Ke Yang Fairness Computation
February 18, Wednesday Adi Shamir A New Class of Stream Ciphers
February 25, Wednesday Shuchi Chawla Approximation Algorithms for Clustering and Path-Planning Problems
March 3, Wednesday Hubert Chan Approximating the Cut Norm of a Real Matrix
March 10, Wednesday
No Theory Lunch
No Theory Lunch
March 17, Wednesday Nick Hopper How to reveal a secret crush, negotiate a bribe, and more...
March 24, Wednesday Maria Florina Balcan Approximating Kernels with Low-Dimensional Projections
March 31, Wednesday Nick Hopper A Theory of Steganography
April 7, Wednesday Yiannis Koutis Three theorems in spectral graph theory
April 14, Wednesday
No Theory Lunch
No Theory Lunch
April 21, Wednesday Peter Richter Lower Bounds for Graph Embeddings and Combinatorial Preconditioners
April 28, Wednesday Shuchi Chawla From Idiosyncratic to Stereotypical: Toward Privacy in Public Databases
May 5, Wednesday Andris Ambainis Quantum walks and their applications in quantum algorithms

Previous Seminar Series

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