DATE

SPEAKER

TITLE
(link to
abstracts)

Notes

Jan 24

Balazs Szegedy

Grouptheoretic Algorithms for Matrix Multiplication


Jan 25

Liam Roditty

Developments in Dynamic Graph Algorithms

Note NonStandard Date and Location; 2:00 on Wednesday in Hill 482

Jan 31



Organizer is away at a conference

Feb 7

Eric Allender

Grid Graph Reachability Problems


Feb 14

Guy Kortsarz

Rare approximation ratios


Feb 21

Mario Szegedy

What are the languages that have bounded
kwise communication complexity?


Feb 28



Organizer is away at a conference

Mar 7

Paolo Ferragina

Compressing and indexing strings and labeled trees


Mar 14



No talk: Spring Break

Mar 21

Lisa Hellerstein

Minimization of DNF Formulas Given a Truth Table


Mar 28

Giovanni Di Crescenzo

Asynchronous Perfectly Secure Communication over OneTime Pads


Apr 4

Christian Sohler

Simple coresets for clustering problems

Note NonStandard Location: CoRE 301 (CoRE A)

Apr 11

Chee Yap

Theory of Real Computation According to EGC


Apr 18

Ge (Frank) Xia

On the Subexponential Time (In)Computability of Some NPhard
problems


Apr 25



No talk, due to DIMACS
Conference on Probabilistic Combinatorics & Algorithms:
a Conference in Honor of Joel Spencer's 60th Birthday

May 2

Marius Zimand

Extractors via constructions of cryptographic pseudorandom generators

Last Seminar for Spring 06
