CSDM Seminars
MINI-WORKSHOP ON PSEUDORANDOMNESS
On Zaremba's Conjecture
Alex Kontorovich
Stony Brook University
Date & Time:
Fri, 04/22/2011 - 17:00 - 18:00
Location:
S-101
Note:
<a href="http://math.ias.edu/files/seminars/PseudorandomnessMiniWkshp.pdf">http://math.ias.edu/files/seminars/PseudorandomnessMiniWkshp.pdf</a> terms:
COMPUTER SCIENCE AND DISCRETE MATHEMATICS SEMINAR I
Quantum Fingerprints that Keep Secrets
Dmitry Gavinsky
NEC Research Laboratories
Date & Time:
Mon, 04/18/2011 - 11:15 - 12:15
Location:
S-101 terms:
COMPUTER SCIENCE AND DISCRETE MATHEMATICS SEMINAR II
Zero-One Rounding of Singular Vectors
Nikhil Srivastava
Member, School of Mathematics
Date & Time:
Tue, 04/05/2011 - 10:30 - 12:30
Location:
S-101 terms:
MINI-WORKSHOP ON PSEUDORANDOMNESS
The Correlation of Multiplicative Characters with Polynomials over Finite Fields
Swastik Kopparty
Member, School of Mathematics
Date & Time:
Fri, 04/22/2011 - 11:30 - 12:30
Location:
S-101
Note:
<a href="http://math.ias.edu/files/seminars/PseudorandomnessMiniWkshp.pdf">http://math.ias.edu/files/seminars/PseudorandomnessMiniWkshp.pdf</a> terms:
MINI-WORKSHOP ON PSEUDORANDOMNESS
The Polynomial Method and Applications From Finite Field Kakeya to Distinct Distances
Larry Guth
University of Toronto; Member, School of Mathematics
Date & Time:
Fri, 04/22/2011 - 14:30 - 15:30
Location:
S-101
Note:
<a href="http://math.ias.edu/files/seminars/PseudorandomnessMiniWkshp.pdf">http://math.ias.edu/files/seminars/PseudorandomnessMiniWkshp.pdf</a> terms:
MINI-WORKSHOP ON PSEUDORANDOMNESS
Monotone Expanders -- Constructions and Applications
Zeev Dvir
Princeton University; Member, School of Mathematics
Date & Time:
Fri, 04/22/2011 - 16:00 - 17:00
Location:
S-101
Note:
<a href="http://math.ias.edu/files/seminars/PseudorandomnessMiniWkshp.pdf">http://math.ias.edu/files/seminars/PseudorandomnessMiniWkshp.pdf</a> terms:
COMPUTER SCIENCE AND DISCRETE MATHEMATICS SEMINAR I
Learning and Testing k-Model Distributions
Rocco Servidio
Columbia University
Date & Time:
Mon, 04/25/2011 - 11:15 - 12:15
Location:
S-101 terms:
COMPUTER SCIENCE AND DISCRETE MATHEMATICS SEMINAR II
General Hardness Amplification of Predicates and Puzzles
Grant Schoenbeck
Princeton University
Date & Time:
Tue, 03/29/2011 - 10:30 - 12:30
Location:
S-101 terms:
COMPUTER SCIENCE AND DISCRETE MATHEMATICS SEMINAR I
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority
Ashwin Nayak
University of Waterloo
Date & Time:
Mon, 04/04/2011 - 11:15 - 12:15
Location:
S-101 terms:
COMPUTER SCIENCE AND DISCRETE MATHEMATICS SEMINAR I
Graph Sparsification by Edge-Connectivity and Random Spanning Trees
Nick Harvey
University of Waterloo
Date & Time:
Mon, 04/11/2011 - 11:15 - 12:15
Location:
S-101 terms:
