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).
Spring 2007 Schedule
Wednesdays, noon, Wozniak Lounge (4th floor, Soda
Hall ), unless otherwise
specified
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
Spring 2006 Schedule
May 10, Miklos Santha on efficient
testing of groups
May 3, Robi Krauthgamer on
algorithms in negatively curved spaces
April 26, Dieter van Melkebeek
on hierarchies for semantic models of computation
April 19, Tom Hayes
on eigenvalues, Dobrushin uniqueness, and randomly coloring planar graphs
April 12, Shafi Goldwasser
on obfuscation
April 5, Bjorn Poonen
on Hilbert's 10th problem over the rationals
March 29, Spring Break March 22, Eric Friedman
on the geometry of chomp
March 15, Eva Tardos on collusion in congestion games
March 13 12:30, 410 Hearst Mining Building [note unusual
day, time and place] , Kamalika Chaudhuri
on bounded-degree MST
March 8, Hoeteck Wee on
finding Pessiland
March 1, Luca Trevisan
on Gowers uniformity, influence
of variables, and probabilistically checkable proofs
February 22, Satish Rao
on embedding expanders into graphs
February 15, Gadiel Seroussi on universal types and simulation
of individual sequences
February 8, Vijay Vazirani
on resource allocation markets (see papers here
and here )
February 1, Christos
Papadimitriou
on PPAD