Deprecated : The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456 Theory Lunch
Theory Lunch
If you are not on the mailing list, click here Once a week, the Berkeley theory community gets together,
socializes, has lunch, and then listens to an informal blackboard presentation on
open questions, new results, old results worth not forgetting, or whatever is fit to entertain a crowd of theoreticians.
At the theory lunch, we do not believe in
using slides, waiting until the end to ask questions, or stopping the speaker when he or she runs out of
time (we may, however, set the room on fire if the talk runs late).
Fall 2007 Schedule
Wednesdays, noon, Wozniak Lounge (4th floor, Soda
Hall ), unless otherwise
specified
Spring 2007 Schedule
May 2 (last theory lunch of Spring'07), Nisheeth Vishnoi
on integrality gaps for sparsest cut
April 25, Sergey Yekhanin on
locally decodable codes
April 18, Luca Trevisan on
proving unsatisfiability of random ksat formulas
April 11, Jayanth Kannan on
new routing protocols
April 4, Costis Daskalakis
on decoding error-correcting codes via linear programming
March 28, no lunch
March 21, Jacob Abernethy on
experts algorithms, random sampling, and approximating the permanent
March 14, no lunch
March 12, (in 410 Hearst Mining Building )
Christos Papadimitriou on theory at Berkeley and Lorenzo Orecchia on expert
algorithms
March 7, Grant Schoenebeck
on integrality gaps for Lovasz-Schrijver relaxations
February 28, Konstantin
and Yuri Makarychev on
near-optimal algorithms for maximum constraint satisfaction problems
February 21, Elchanan Mossel
on asymptotics of games
February 14, Umesh Vazirani
on D-wave's "quantum computer"
February 7, Albert Atserias on distinguishing SAT from polynomial-size circuits
January 31, Dick Karp on noisy binary search
January 24, Robert Špalek on how negative weights make adversaries stronger
Fall 2006 Schedule
November 29, Kamalika Chaudhuri on a clustering problem
November 22, no lunch
November 15, Sandu Popescu on non-local correlations and communication complexity
November 8, Alexandra Kolla on honest-verifier zero knowledge
November 1, Omid Etesami on ad auctions and market equilibrium
October 25, Ravi Kannan on sampling in large matrices and tensors
October 18, Iordanis Kerenidis on the one-way communication complexity of the Boolean Hidden Matching problem
October 11, Nikhil Devanur on the bidirected cut relaxation of Minimum Steiner Tree
October 4, Mani Narayanan on a tractable graph matching problem
September 27 Costis Daskalakis on reconstructing phylogenies from minimum
information
September 20 Henry Lin on network decompositions and the power of choice in Polya
urns
September 13 Ben Reichardt on fault tolerance in quantum computation
September 6, Dick Karp on sorting partial orders