| |
Spring 2003 Archive |
|
|
| Date |
Speaker |
Host |
Location |
January
17 |
Andrew
Goldberg, Microsoft Research
Title: On Memory-Bound
Functions for Fighting Spam |
Daniel Sleator
Avrim Blum |
|
| January
24 |
Alper Yildirim,
State University of New York, Stony Brook
Tile: Computing
Core-Sets and Approximate Smallest Enclosing HyperSpheres in
High Dimensions
|
GSIA |
GSIA
153
3:30 |
January
31 |
Xinming Liu,
GSIA, Carnegie Mellon University
A
Polynomial Algorithm for Recognizing Perfect Graphs |
GSIA |
GSIA
152
3:30 |
| February
7 |
Herbert
Edelsbrunner, Duke University
Title: Bio-Geometric
Modeling
Short
Bio |
Guy Blelloch |
NSH
3305
3:30 |
| February
14 |
Bernard Chazelle,
Princeton University & NEC
Title: Nonmonotonicity
in Geometric Searching
|
Daniel Sleator |
Wean
7220
3:30 |
February
21 |
Daniel Bienstock,
Columbia University
Title Subset
Algebra Lifting Algorithms for 0-1 Integer Programming
|
GSIA |
GSIA
152
3:30 |
February
21 |
Tim Roughgarden,
Cornell University
Title: Selfish
Routing and the Price of Anarchy |
Special Aladdin
Lunch talk |
WeH
4623
12:00 |
February
26 |
John Hooker,
GSIA, Carnegie Mellon University
Title: Resolution-Based
Dynamic Search |
GSIA,
logic
seminar |
Old Student
Center, 201
12:45 |
| February
28 |
Dan
Gusfield, UC Davis
Title: Combinatorial
Approaches to Haplotyping
|
Russell Schwartz - Biological
Sciences |
NS 3305
3:30 |
February
28 |
Chek Beng
Chua, Cornell University
On
The Polynomial-Representability Of Homogeneous Cones By Positive
Definite Cones And A New Primal-Dual Algorithm For Semi-Definite
Programming |
math colloquium |
Wean,
7500
4:30
|
March
7 |
Santosh Vempala,
Department of Mathematics, MIT
Title: Random
Walks and Geometric Algorithms |
Avrim Blum |
Wean
7220
3:30 |
March
14 |
Seth Pettie
Title: A new all-pairs
shortest path algorithm for real-weighted graphs |
Guy Blelloch |
Wean
7220
3:30 |
March
21 |
Jeff Linderoth,
Lehigh University
Title: TBA
|
GSIA |
GSIA
152
3:30 |
March
21 |
Amitabh
Sinha
Title: Approximation
algorithms for logistic network design
|
(Thesis proposal
for Ph.D) |
Cooper
Auditorium, GSIA
11:00 |
March
31 |
Lisa Fleischer,
Carnegie Mellon (GSIA)
Title: Approximating
Optimal Control of Fluid Networks |
|
Wean
4625
2:30pm |
April
4 |
Kent Andersen,
GSIA, Carnegie Mellon University
Title: Intersection Cuts, Split Cuts and Mixed Integer Gomory
Cuts
|
GSIA |
GSIA
152
3:30 |
April
11 |
Jason
Hartline, University of Washington
Title: Competitive
and Envy-free Auctions via Consensus |
Avrim Blum |
Wean
4625
1:30 |
April
18 |
Matthias
Ruhl, MIT
Title: Searching
in Peer-to-Peer Networks |
Danny Sleator |
Wean
7220
3:30 |
April
25 |
Michael Perregaard
Title: TBD
|
GSIA |
GSIA
152
3:30 |
May 2 |
Giacomo Zambelli
GSIA, Carnegie Mellon University
TBA
|
GSIA |
GSIA
152
3:30 |
| |
 The
Joint ALADDIN/Theory/Operations Research Seminar
GSIA
Operations Research Seminar
Archive
See also the Seminars
on Algorithms and Complexity page
|
CENTER
Carnegie
Mellon 
The Joint ALADDIN/Theory/Operations
Research Seminar 
Aladdin
