CSDM Seminars
Computer Science/Discrete Mathematics Seminar I
Lasserre Hierarchy, Higher Eigenvalues, and Graph Partitioning
Series:
Computer Science/Discrete Mathematics
Venkat Guruswami
Carnegie Mellon University
Date & Time:
Mon, 02/20/2012 - 11:15 - 12:15
Location:
S-101 terms:
Computer Science/Discrete Mathematics Seminar II
Finding Needles in Exponential Haystacks
Series:
Computer Science/Discrete Mathematics
Joel Spencer
Courant Institute, NYU
Date & Time:
Tue, 02/21/2012 - 10:30 - 12:30
Location:
S-101 terms:
Computer Science/Discrete Mathematics Seminar I
An Additive Combinatorics Approach to the Log-Rank Conjecture in Communication Complexity
Series:
Computer Science/Discrete Mathematics
Noga Zewi
Technion
Date & Time:
Mon, 02/27/2012 - 11:15 - 12:15
Location:
S-101 terms:
Computer Science/Discrete Mathematics Seminar II
Complexity, Approximability, and Mechanism Design
Series:
Computer Science/Discrete Mathematics
Christos Papadimitriou
University of California at Berkeley
Date & Time:
Tue, 02/28/2012 - 10:30 - 12:30
Location:
S-101 terms:
Computer Science/Discrete Mathematics Seminar I
Computational Entropy
Series:
Computer Science/Discrete Mathematics
Salil Vadhan
Harvard University; Visiting Researcher Microsoft Research SVC; Visiting Scholar Stanford University
Date & Time:
Mon, 04/23/2012 - 11:15 - 12:15
Location:
S-101 terms:
Computer Science/Discrete Mathematics Seminar II
A Survey of Lower Bounds for the Resolution Proof System
Series:
Computer Science/Discrete Mathematics
Avi Wigderson
Herbert H. Maass Professor, School of Mathematics
Date & Time:
Tue, 01/31/2012 - 10:30 - 12:30
Location:
S-101 terms:
Computer Science/Discrete Mathematics Seminar II
Randomness Extraction: A Survey
Series:
Computer Science/Discrete Mathematics
David Zuckerman
University of Texas at Austin; Member, School of Mathematics
Date & Time:
Tue, 02/07/2012 - 10:30 - 12:30
Location:
S-101 terms:
Computer Science/Discrete Mathematics Seminar I
Graphlets: A Spectral Perspective for Graph Limits
Series:
Computer Science/Discrete Mathematics
Fan Chung
University of California at San Diego
Date & Time:
Mon, 02/06/2012 - 11:15 - 12:15
Location:
S-101 terms:
Computer Science/Discrete Mathematics Seminar II
A Tutorial on the Likely Worst-Case Complexities of NP-Complete Problems
Series:
Computer Science/Discrete Mathematics
Russell Impagliazzo
University of California, San Diego; Member, School of Mathematics
Date & Time:
Tue, 01/24/2012 - 10:30 - 12:30
Location:
S-101 terms:
Computer Science/Discrete Mathematics Seminar II
Time-Space Tradeoffs in Resolution: Superpolynomial Lower Bounds for Superlinear Space
Series:
Computer Science/Discrete Mathematics
Christopher Beck
Princeton University
Date & Time:
Tue, 12/13/2011 - 10:30 - 12:30
Location:
S-101 terms:
