ALADDIN
CENTER Carnegie Mellon UniversityCarnegie Mellon Computer Science DepartmentSchool of Computer Science
Schedules
The Joint ALADDIN/Theory/Operations Research Seminar
Aladdin
About
Calendar
People
PROBEs
Workshops
Papers
Education
Related Activities
Corporate
Contact
 
Captcha
Outreach Roadshow
 
Fall 2002 Archive
   
Date
Speaker
Host
Location
August 23
Michael Mitzenmacher Dept. of Computer Science, Harvard University
Title: New Directions in Balls and Bins Problems
Alan Frieze
Wean
4623
September 13
Luis Zuluaga, Carnegie Mellon University
Polynomial Optimization
GSIA
GSIA 153
3:30
September 20
Ronitt Rubinfeld, NEC Research Institute
What can we do in sublinear time
Daniel Sleator
Wean7220
3:30
September 27

Alex Kesselman, Dept. of Computer Science, Tel-Aviv University
Title: Competitive Analysis of Buffer Management Policies for QoS Switches

Avrim Blum
Wean7220
3:30
September 27
Asaf Levin, Tel Aviv University, Israel
Approximation Algorithms for the Metric Minimum Shallow Steiner Tree Problem
GSIA
GSIA 153
3:30
October 4

Kavita Ramanan, Lucent Technologies, Bell Labs
Title: Large Deviations and Optimality of a Scheduling Discipline.

Mor Harchol-Balter
Wean7220
3:30
October 11
Maria Chudnovsky, Princeton University
Title: The Strong Perfect Graph Theorem
GSIA
GSIA 153
3:30
October 14
Baruch Awerbuch, John Hopkins
Title: Truth-telling Online Auctions of Network Resources
Avrim Blum
Wean7220
1:30
October 18
Jochen Konemann, GSIA, Carnegie Mellon University
Title: TBA
GSIA
GSIA 153
3:30
October 25
Cid Carvalho De Souza, University of Campinas, Brazil
Title: TBA
GSIA
GSIA 153
3:30
October 25
Dawn Xiadong Song, Carnegie Mellon University
Title: Searching on Encrypted Data
Danny Sleator
Wean 7220
3:30
November 1
Cliff Smyth, Carnegie Mellon University
Title: The Hardness of $3$-Uniform Hypergraph Coloring
Alan Frieze
Wean7220
3:30
November 1
Jose Figueira,
University of Coimbra, Portugal
A multiple criteria utility based approach for sorting alternatives into pre-defined categories
GSIA
GSIA 153
3:30
November 6
Renata Sotirov
University of Klagenfurt, Austria
Why a Bundle Method for the Quadratic Assignment Problem?
GSIA
117 Mervis Hall, University of Pittsburgh
1:00
November 8
Michael Langberg
Title: Graphs with tiny vector chromatic numbers and huge chromatic numbers
R. Ravi
Wean 7220
3:30
November 12
Michael Shalmon, University of Quebec
Title: Sample path decompositions and queueing analysis via LCFS-PR applied to teletraffic multiplexing
Mor Harchol-Balter
Wean 8220
12:00 pm
November 22
Naveen Garg , IIT Delhi and Max-Planck Institute, Germany
Title: TBA
GSIA
GSIA 153
3:30
November 22
Ismael Regis de Farias,
Visiting Professor,
Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
GSIA
GSIA 153
3:30
December 6
Avi Wigderson
Expander graphs - where Combinatorics and Albegra compete and cooperate
Manuel Blum
Wean 5409
3:30
December 13
John Kubiatowicz, Computer Science Division, University of California at Berkeley
Title:OceanStore: Toward Global Scale, Self-Repairing, Secure, and Persistent Storage
Bruce Maggs
Wean 7220
3:30
 

 

The Joint ALADDIN/Theory/Operations Research Seminar
see archives
See also the Seminars on Algorithms and Complexity page

 

 

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