ALADDIN
CENTER Carnegie Mellon UniversityCarnegie Mellon Computer Science DepartmentSchool of Computer Science
Schedule
The Joint ALADDIN/Theory/Operations Research Seminar
Aladdin
About
News and Events
Calendar
People
PROBEs
Workshops
Papers
Education
Seminars
Courses
Related Activities
Corporate
Related Links
Intranet
Contact
 
Captcha
REUs
Outreach Roadshow
 

Spring 2004Archive

   
Date
Speaker
Host
Location
June 3
Thursday
Sean Hallgren, NEC Research, Princeton
Fast Quantum Algorithms for Computing the Unit Group and Class Group of a Number Field
Anupam Gupta
Wean 7316
3:00pm
April 23
Friday
Philip Klein, Brown University
Multiple-source shortest paths in planar graphs in O(n log n) time
Danny Sleator
Wean 7220
3:30pm
April 16
Friday
S. Muthu Muthukrishnan, Rutgers Univ
What is hot, what is not; what is new, what is next?
R. Ravi
Wean 7220
3:30pm
April 13
Tuesday
Vijay Saraswat, IBM TJ Watson
The Emergence of Systems Biology
David Cardoze
Wean Hall 7220
10:00 a.m
April 9
Friday
Sanjeev Arora, Princeton University
Expander flows and a sqrt{log n}-approximation for graph expansion/sparsest cut
Web Structure
and Algorithms
Workshop
Newell Simon Hall
room 3305
3:00pm
March 19
Friday
Dimitris Achlioptas, Microsoft Research
A New Look at the Second Moment Method
Alan Frieze Wean 7220
1:00pm

March 5
Friday

Yuval Rabani, Technion and Cornell University
Low Distortion Maps between Point Sets
R. Ravi
Wean 4623
3:30pm
Feb 27
Friday
Michael Kearns, University of Pennsylvania
Network Models for Game Theory and Economics

Avrim Blum

Wean 4623
3:30pm
Feb 13
Friday
(45 min)
Eran Halperin
Visiting Post-doc from Princeton
Tight lower bounds for the asymmetric k-center problem
Danny Sleator
Wean 7220
3:30pm

The Joint ALADDIN/Theory/Operations Research Seminar
Seminars on Algorithms and Complexity
Archives

 

 

 

This material is based upon work supported by National Science Foundation under Grant No. 0122581.
Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the
National Science Foundation