DATE
|
SPEAKER
|
TITLE (link to
abstracts)
|
WHEN I am AWAY
|
Jan 26
|
Ourselves
|
Discuss the seminar and goals
|
|
Feb 2
|
Muthukrishnan
|
Comparing Biological
Sequences
with Segment Rearrangements
|
|
| Feb 9 |
Cliff Stein
|
Scheduling an industrial
production
facility: Applying theory in practice.
|
|
Feb 16
|
Graham Cormode
|
How hard are computer
games?
|
Talk at EPFL, Switzerland
|
Feb 23
|
Navin Goyal
|
A parallel search game
related
to data structure lower bounds
|
|
Mar 1
|
Hairong Zhao
|
Fault tolerant spanners
and
their applications.
|
|
Mar 8
|
Christian Sohler
|
Estimating the weight of
Euclidean
minimum spanning tree in a data stream
|
Infocom 04
|
Mar 15
|
|
SPRING BREAK: NO TALK
|
|
Mar 22
|
Amit Chakrabarti
|
Tight bounds for the
approximate
nearest neighbor search
|
Room 433 (not 431)
|
Mar 29
|
Andris Ambainis
|
Quantum walks and their
applications
in quantum algorithms
|
|
Apr 5
|
|
Student talks.
|
LATIN 04.
|
Apr 12
|
Subhash Khot
|
BCH codes, augmented
tensor
products and hardness of the
shortest vector problem in lattices
|
|
Apr 19
|
Rajeev Alur
|
Current directions in
algorithmic software verification
|
|
Apr 26
|
Steve Skiena
|
Sequence assembly for
high
throughput technologies.
|
|
May 3
|
Sampath Kannan
|
Streaming algorithms for
graph problems.
|
Room 433 (not 431)
|