CALENDAR FOR SPRING 2006
Monday 2/6, 2:30. Vitaly Feldman, Harvard University:
Hardness of Approximate Two-level Logic Minimization and PAC
Learning with Membership Queries
WEDNESDAY 2/15, 2:30. Shaili Jain, Harvard University:
Restricted Strip Covering and the Sensor Cover Problem
Monday 2/20, 2:30. No seminar (Presidents' Day)
THURSDAY 2/23, 4:00, Maxwell Dworkin G125,
CS Colloquim. Alon Rosen,
Center for Research on Computation and Society,
Harvard University: Concurrent Non-Malleable Commitments
FRIDAY 2/24, Refreshments at 10:45, talk at 11, Maxwell Dworkin 319. Jonathan Kelner, MIT:
A Randomized Polynomial-Time Simplex Algorithm for Linear Programming
Monday 2/27 2:30. Emanuele Viola,
On Probabilistic Time versus Alternating Time
Monday 3/6 TBD
WEDNESDAY 3/8, 12pm-1:00pm, Maxwell Dworkin ,
CRCS Privacy & Security Lunch Seminar. Yehuda Lindell.
Monday 3/13 2:30. Elad Hazan, Princeton University
New Techniques in Online Convex Optimization and their
Monday 3/20. No seminar (PhD open house)
WEDNESDAY 3/22, 12pm-1:00pm, Maxwell Dworkin ,
CRCS Privacy & Security Lunch Seminar. Adam
Monday 3/27. No seminar (Spring break)
Monday 4/3 2:30. Eynat Rafalin, Tufts University
Algorithms and Analysis of Depth Functions using Computational Geometry
THURSDAY 4/6, 4:00, Maxwell Dworkin G125,
CS Colloquim. David Karger, MIT.
Why everyone should be their own database administrator, UI designer,
application developer, and web site builder, and how they can.
MONDAY 4/10, 4:00, Maxwell Dworkin G125,
CS Colloquim. Vijay Vazirani, Georgia Tech.
New Market Models and Algorithms.
Monday 4/17 No TOC seminar
Monday 4/24, 2:30, MD 319. John Byers, Boston University
Flow Allocation Games: Pricing, Equilibria
and Fast Convergence
THURSDAY 4/27, 4:00, Maxwell Dworkin G125,
CS Colloquim. Maurice Herlihy, Brown.
Seriously: new directions in multiprocessor synchronization.
Monday 5/1 Ph.D. Defenses of Minh Nguyen (9 AM) and Emanuele Viola (11 AM). Both in MD119.
Monday 5/8, 2:30, MD 319. Michael Mitzenmacher, Harvard
Beyond Bloom Filters: Approximate Representations of
State Machines (and a New Construction for Counting Bloom Filters)
Monday 5/15, 2:30, MD 319. Subhash Khot, Georgia Tech.
New Results for Learning Noisy Parities and Halfspaces
Monday 6/5, 2:30, MD 319. Grant Schoenebeck, UC Berkeley.
The Computational Complexity of Nash Equilibria in Concisely
Monday 6/12, 2:30, MD 319. Alex Healy, Harvard University.
Randomness-Efficient Sampling within NC^1