Theory Seminar
2003-2004
Academic Year



September 22, 2003 Theory of Computing Seminar
Managing Network Insecurity
Sandeep Bhatt, Telcordia Technologies
October 17, 2003 Theory of Computing Seminar
Ramanujan Graphs
Peter Sarnak, Courant-NYU and Princeton University
November 13, 2003 J. Barkley Rosser Memorial Lecture
Games and Networks
Christos Papadimitriou, University of California at Berkeley
November 14, 2003 Theory of Computing Seminar
Nash equilibria and complexity
Christos Papadimitriou, University of California at Berkeley
January 6, 2004 Theory of Computing Seminar
Applications of Fermat's Two Squares Theorem in Information Technology
Klaus Huber, University of Illinois and Deutsche Telekom
2:30 pm, 2310 CS
February 17, 2004 Theory of Computing Seminar
Point Counting on Picard Curves
Mark Bauer, University of Calgary
12:15 pm, 5331 CS
February 23, 2004 Theory of Computing Seminar
Sublinear Geometric Algorithms
Avner Magen, University of Toronto
4:00 pm, 1221 CS
March 8, 2004 Theory of Computing Seminar
Shannon Sampling, Learning Theory and Reconstructing Functions from Point Values
Stephen Smale, Toyota Technical Institute at Chicago and University of California at Berkeley
4:00 pm, B239 Van Vleck
April 5, 2004 Theory of Computing Seminar
Approximating metrics by simpler metrics: Why and how?
Kunal Talwar, University of California at Berkeley
4:00 pm, 1221 CS
April 13, 2004 UW Madison Annual Hilldale Lecture
Computers as Puzzle Solvers: The Challenge of Efficient Search
Richard Karp, University of California at Berkeley
4:00 pm, 1100 Grainger
April 14, 2004 Theory of Computing Seminar
Global Synchronization in Sensornets
Richard Karp, University of California at Berkeley
2:00 pm, 2310 CS
April 15, 2004 Theory of Computing Seminar
Metric Clustering
Claire Kenyon, Ecole Polytechnique at Paris, France
4:00 pm, 1221 CS
July 26, 2004 Theory of Computing Seminar
Top-down Analysis of Path Compression
Raimund Seidel, Saarland University
2:30 pm, 2310 CS
   
 
top of page