Algorithms and Complexity Spring 2006
For more information on this series please see http://theory.csail.mit.edu/~madhu/algcompsem.html
Amir Shpilka , Technion
New constructions of epsilon-biased generators
Date: February 16 2006
Time: 4:00PM to 5:15AM
Location: 32-G575
Nick Harvey , MIT CSAIL
Randomized Algebraic Algorithms for Matroid and Matching Problems
Date: February 23 2006
Time: 4:00PM to 5:15PM
Location: 32-G575
Sofya Raskhodnikova , Weizmann Institute
Sublinear Algorithms for String Compressibility and the Distribution Support Size
Date: March 16 2006
Time: 4:00PM to 5:15PM
Location: 32-G575
Nicole Immorlica , Microsoft Research
Monopoly Pricing, Profit Extraction and Popping Balloons
Date: April 6 2006
Time: 5:15PM to 6:30PM
Location: 32-G575
Seth Pettie , Max Planck Institute
Low-distortion Graph Spanners
Date: April 13 2006
Time: 4:00PM to 5:15AM
Location: 32-G575
Mihai Patrascu , MIT CSAIL
Data Structures and Cell Probe Complexity
Date: April 20 2006
Time: 4:00PM to 5:15PM
Location: 32-G575
Jon Kelner , MIT
A Randomized Polynomial-Time Simplex Algorithm for Linear Programming
Date: May 4 2006
Time: 4:00PM to 5:15PM
Location: 32-G575
Dieter van Melkebeek , U. Wisconsin
Time Hierarchies for Semantic Models of Computation
Date: May 11 2006
Time: 4:00PM to 5:15PM
Location: 32-G575
Milena Mihail , Georgia Tech.
Algorithmic Performance in Complex Networks
Date: May 18 2006
Time: 4:00PM to 5:15PM
Location: 32-G575
For more information on this series please see http://theory.csail.mit.edu/~madhu/algcompsem.html
Back to Previous Series List
Back to Event Calendar
