20052006 seminars
Tuesday, July 11, 2006  The learnability of Quantum States Scott Aaronson (University of Waterloo) 
Tuesday, May 23, 2006  On Margulis' Normal Subgroup Theorem Tim Steger (IAS) 
Tuesday, May 16, 2006  Randomness Reduction in Some Results of Asympotic Geometric Analysis Shiri Artstein (IAS) 
Monday, May 15, 2006  New Connections Between Derandomization, WorstCase Complexity and AverageCase Complexity Danny Gutfreund (Harvard University) 
Tuesday, May 9, 2006  On the Minimal Density of Triangles in Graphs (continued) Alexander Razborov (IAS) 
Monday, May 8, 2006  Universal Graphs Michael Capalbo (DIMACS) 
Tuesday, May 2, 2006  Almost Normal Subgroups of Lattices George Willis (University of Newcastle) 
Tuesday, May 2, 2006  On the Minimal Density of Triangles in Graphs Alexander Razborov (IAS) 
Monday, May 1, 2006  Many Hamiltonian Cycles Jeff Kahn (Rutgers University) 
Tuesday, April 25, 2006  Relative Property T in Lie Groups and their Lattices Yves de Cornulier (École Normale Supérieure) 
Tuesday, April 25, 2006  Click here for details about DIMACS Workshop
No Seminar Due to DIMACS Workshop 
Monday, April 24, 2006  Click here for details about DIMACS Workshop
No Seminar Due to DIMACS Workshop 
Tuesday, April 18, 2006  Actions of Product Groups on Manifolds Alex Furman (University of Illinois at Chicago) 
Tuesday, April 18, 2006  Black Boxes, Inc. Avi Wigderson (IAS) 
Monday, April 17, 2006  Simultaneous Optimization and Fairness Ashish Goel (Stanford University) 
Tuesday, April 11, 2006  New Techniques in Online Game Playing Elad Hazan (Princeton University) 
Monday, April 10, 2006  Computational Hardness From Gaussian Isoperimetry: On Hardness of Graph Coloring, the Shape of Double Bubbles and Related Problems
Elchanan Mossel (University of California, Berkeley) 
Tuesday, April 4, 2006  Isospectrality and Commensurability Alan Reid (University of Texas, Austin) 
Tuesday, April 4, 2006  Periodic Orbits and Extractors Elon Lindenstrauss (Princeton University) 
Monday, April 3, 2006  The Arrangement Method for Linear Programming Vladlen Koltun (Stanford University) 
Tuesday, March 28, 2006  The Grothendieck Constant of an Expander Noga Alon (Tel Aviv University and IAS) 
Monday, March 27, 2006  The Cover Time of Random Walks on Random Graphs Alan Frieze (Carnegie Mellon University) 
Tuesday, March 21, 2006  Cartesian Products as Profinite Completions and Representation Growth of Groups Martin Kassabov (Cornell University) 
Tuesday, March 21, 2006  Linear Representations of the Automorphism Group of a Free Group Fritz Grunewald (IAS) 
Tuesday, March 21, 2006  Kazhdan's Property (T) for Linear Groups Over General Rings Yehuda Shalom (IAS) 
Tuesday, March 21, 2006  GolodShafarevich Groups with Property (T) and KacMoody Groups Mikhail Ershov (IAS) 
Monday, March 20, 2006  Relaxed TwoColoring of Cubic Graphs Tibor Szabo (ETH) 
Thursday, March 16, 2006  TimeSpace TradeOffs for Predecessor Search Mikkel Thorup (AT & T) 
Tuesday, March 14, 2006  Group Theoretic Algorithms For Fast matrix Multiplication Balazs Szedgedy (IAS) 
Monday, March 13, 2006  On the (Im)possibility of Basing OneWay Functions on NPHardness Adi Akavia (MIT) 
Tuesday, March 7, 2006  Asymptotics and Spectra of Cayley and Schreier Graphs of Branch Groups Zoran Sunik (Texas A & M) 
Tuesday, March 7, 2006  Strong Approximation in Random Towers of Graphs Yair Glasner (IAS) 
Monday, March 6, 2006  COMPUTER SCIENCE/DISCRETE MATH I
No seminar, due to talk of Christos Papadimitriou at Princeton University 
Tuesday, February 28, 2006  A Canonical Form for Automorphisms of Totally Disconnected Locally Compact Groups George Willis (University of Newcastle, NSW) 
Tuesday, February 28, 2006  Independent Transversals in Locally Sparse Graphs PoShen Loh (Princeton University) 
Monday, February 27, 2006  Hamilton Cycles in Expanding and Highly Connected Graphs Michael Krivelevich (Tel Aviv University) 
Thursday, February 23, 2006  The Jones Polynomial and Quantum Computation Dorit Aharonov (Hebrew University) 
Tuesday, February 21, 2006  Lattices of Minimum Covolume in Classical Chevalley Groups over $\mathbb F_q((t))$ Alireza SalehiGolsefidy (Yale University) 
Tuesday, February 21, 2006  Irrational Quadratic Forms II Gregory Margulis (IAS and Yale University) 
Monday, February 20, 2006  The Grothendieck Inequality Revisited Ron Blei (University of Connecticut) 
Tuesday, February 14, 2006  Generalized Harmonic Maps Superridity and Uniformly Convex Metric Spaces
Tsachik Gelander (Yale University) 
Tuesday, February 14, 2006  Quantum Computing and Finite Permutation Groups Aner Shalev (Hebrew University) 
Monday, February 13, 2006  Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity Joel Friedman (University of British Columbia) 
Friday, February 10, 2006  LIE GROUPS, REPRESENTATIONS AND DISCRETE MATHEMATICS CONFERENCE
Various 
Thursday, February 9, 2006  LIE GROUPS, REPRESENTATIONS AND DISCRETE MATHEMATICS CONFERENCE
Various 
Wednesday, February 8, 2006  LIE GROUPS, REPRESENTATIONS AND DISCRETE MATHEMATICS CONFERENCE
Various 
Tuesday, February 7, 2006  LIE GROUPS, REPRESENTATIONS AND DISCRETE MATHEMATICS CONFERENCE
Various 
Monday, February 6, 2006  COMPUTER SCIENCE/DISCRETE MATH 1

Monday, February 6, 2006  LIE GROUPS, REPRESENTATIONS AND DISCRETE MATHEMATICS CONFERENCE
Various 
Tuesday, January 31, 2006  Paley Graphs and the Combinatorial Topology of the Bruhat Decomposition Ron Livnč (IAS) 
Tuesday, January 31, 2006  Cryptography and the P vs NP Question Andrej Bogdanov (IAS) 
Monday, January 30, 2006  From Trees to General Graphs: Counting Independent Sets up to the Tree Threshold Dror Weitz (DIMACS) 
Tuesday, January 24, 2006  The Classification of Finite Simple Groups: Aspects of the Second Generation Proof Inna Korchagina (University of Birmingham) 
Tuesday, January 24, 2006  Random Discrete Matrices: A Survey Van Vu (IAS) 
Monday, January 23, 2006  Dispersion of Mass and the Complexity of Randomized Algorithms Santosh Vempala (MIT) 
Tuesday, January 17, 2006  Linear Representations and Arithmeticity of Lattices in Products of Trees Shahar Mozes (IAS) 
Tuesday, January 17, 2006  Szemeredi's Regularity Lemma and Compactness Balazs Szegedy (IAS) 
Monday, January 16, 2006  Internal Conflict in a Computational System Adi Livnat (Princeton University) 
Tuesday, December 20, 2005  Normal Subgroups of the Multiplicative Group of a Finite Dimensional Division Algebra, and Valuations Andrei S. Rapinchuk (IAS) 
Tuesday, December 20, 2005  Ramanujan Complexes of any Affine Type Donald Cartwright (University of Sydney) 
Tuesday, December 13, 2005  Hanoi Tower Groups, their Spectra and Growth of Diameters of Schreier Graphs Rostislav Grigorchuk (Texas A & M) 
Tuesday, December 13, 2005  Dependent Random Choice and Extremal Problems Benny Sudakov (Princeton University and IAS) 
Monday, December 12, 2005  From Combinatorial Patterns to Strongly Correlated Networks States in Population Neural Code Elad Schneidman (Princeton University) 
Tuesday, December 6, 2005  Around Property (T) Andrzej Zuk (IAS) 
Tuesday, December 6, 2005  Coding Theory: Survey of Recent Progress and Open Questions Madhu Sudan (MIT) 
Monday, December 5, 2005  Rational Secure Computation and Ideal Mechanism Design Silvio Micali (MIT) 
Wednesday, November 30, 2005  Uniform Kazhdan Groups Denis Osin (City College, New York) 
Tuesday, November 29, 2005  Szemeredi's Regularity Lemma in Analysis Balazs Szegedy (IAS) 
Monday, November 28, 2005  Almost Orthogonal Linear Codes are Locally Testable Tali Kaufman (MIT) 
Tuesday, November 22, 2005  The Comparison Between KacMoody and Arithmetic Groups Bertrand Remy (Lyon) 
Tuesday, November 22, 2005  Euclidean Embeddings of Finite Metric Spaces: Distortion and Expansion James Lee (IAS) 
Monday, November 21, 2005  NO SEMINAR

Friday, November 18, 2005  LIE GROUPS, REPRESENTATIONS AND DISCRETE MATHEMATICS WORKSHOP
various speakers 
Thursday, November 17, 2005  LIE GROUPS, REPRESENTATIONS AND DISCRETE MATHEMATICS WORKSHOP
various speakers 
Wednesday, November 16, 2005  LIE GROUPS, REPRESENTATIONS AND DISCRETE MATHEMATICS WORKSHOP
various speakers 
Tuesday, November 15, 2005  NO SEMINAR

Tuesday, November 15, 2005  LIE GROUPS, REPRESENTATIONS AND DISCRETE MATHEMATICS WORKSHOP
various speakers 
Monday, November 14, 2005  NO SEMINAR

Monday, November 14, 2005  LIE GROUPS, REPRESENTATIONS AND DISCRETE MATHEMATICS WORKSHOP
various speakers 
Tuesday, November 8, 2005  Spectra of Laplacians of Buildings Tim Steger (IAS) 
Tuesday, November 8, 2005  Expander Graphs on the Symmetric Groups, Part II Eyal Rozenman (IAS) 
Monday, November 7, 2005  NearOptimal Algorithms for Unique Games Yuri Makarychev (Princeton University) 
Tuesday, November 1, 2005  Buildings and the Spectra of their Laplacians Tim Steger (IAS) 
Tuesday, November 1, 2005  Expander Graphs on the Symmetric Groups Eyal Rozenman (IAS) 
Monday, October 31, 2005  Quantum Information and the PCP Theorem Ran Raz (Weizmann Institute of Science, Israel) 
Friday, October 28, 2005  Hyperbolic Polynomials and Van der Waerden/SchrijverValiant like Conjectures Leonid Gurvits (Los Alamos National Laboratory) 
Tuesday, October 25, 2005  NO SEMINAR

Monday, October 24, 2005  No Seminar Due to FOCS

Friday, October 21, 2005  Combinatorics of Simplicial Complexes
Gil Kalai (Hebrew University and Yale University) 
Tuesday, October 18, 2005  NO SEMINAR

Monday, October 17, 2005  Embeddings of Earthmover Metrics Assaf Naor (Microsoft Research) 
Tuesday, October 11, 2005  From Ramanujan Graphs to Ramanujan Complexes Alex Lubotzky (IAS) 
Tuesday, October 11, 2005  Why and Which Expanders? Avi Wigderson (IAS) 
Monday, October 10, 2005  Randomness Extractors for a Constant Number Independent Sources of Polynomial MinEntropy Anup Rao (University of Texas, Austin) 
Tuesday, October 4, 2005  NO SEMINAR

Monday, October 3, 2005  Szemeredi's Regularity Lemma Revisited Terry Tao (University of California, Los Angeles) 
Tuesday, September 27, 2005  Property Tau and the Product Replacement Algorithm Alex Lubotzky (IAS) 
Monday, September 26, 2005  Expanders, Lfunctions, and the Elliptic Curve Discrete Logarithm Problem Stephen D. Miller (Hebrew University and Rutgers University) 
Monday, September 19, 2005  COMPUTER SCIENCE/DISCRETE MATH, I
NO SEMINAR 
Monday, September 12, 2005  Locally Decodable Codes with 2 Queries and Polynomial Identity Testing for Depth 3 Circuits Zeev Dvir (Weizmann Institute of Science, Israel) 