Yale Discrete Mathematics and Theoretical Computer Science Seminar
Archive of talks from Spring '06

ARCHIVES: Abstracts of talks from previous semesters

Spring 2006 talks schedule

• Monday, Febrary 6 at 1:15 in LOM 201
  Jonathan Kelner, M.I.T.
  
  • A Randomized Polynomial-Time Simplex Algorithm for Linear Programming

• Monday, February 13 at 1:15 in LOM 201
  Marcos Kiwi, Universidad de Chile
  
  • Length of Longest Common Subsequences of Random Words over Large Alphabets

• Monday, February 20 at 1:15 in LOM 201
  S. (Muthu) Muthukrishnan, Rutgers
  
  • Algorithmic Theory of Sparse Approximation Problems

• Monday, February 27 at 1:15 in LOM 201
  Sudipto Guha, University of Pennsylvania
  
  • Sublinear Algorithms for Distributions and Random Order Streams

• Mondays, March 6, 13: spring break, no seminar.

• Monday, March 20: Cowles Foundation Workshop on Optimization.
  

• Monday, March 27 at 1:15 in LOM 201
  Salil Vadhan, Harvard University
  
  • The Complexity of Zero Knowledge

• Monday, April 3 at 1:15 in LOM 201
  Petros Drineas, Rensselaer Polytechnic Institute
  
  • Approximation of a matrix with sub-matrices : Algorithms and Applications

• Monday, April 10 at 1:15 in LOM 201
  Elliot Anshelevich, Princeton
  
  • The Price of Stability for Network Design

• Monday, April 17 at 1:15 in LOM 201
  Claire Kenyon, Brown University
  
  • Oblivious Medians via Online Bidding

• Monday, April 24 at 1:15 in LOM 201
  Jin-Yi Cai, University of Wisconsin - Madison
  
  • Some results on matchcircuit computations and holographic algorithms.

• Monday, May 1 at 1:15 in AKW 200
  Luis Rademacher, MIT
  
  • Dispersion of Mass and the Complexity of Randomized Algorithms