CENTER Carnegie Mellon UniversityCarnegie Mellon Computer Science DepartmentSchool of Computer Science
Lamps of ALADDIN Annual Project Review
Related Activities
Outreach Roadshow

Carnegie Mellon University, Pittsburgh, PA
Newell Simon Hall 3305
May 24th, 2004

The Lamps of ALADDIN Annual Project Review is a one-day workshop in which students will present their recent research results, or outline ongoing work. The primary purpose of the review is to inform other students and faculty of research that is going on as part of ALADDIN and associated projects. The talks will be conference length (about 20 minutes) and should be aimed for a general theory audience. We plan to have enough time to include ample discussion. Lunch and refreshments will be served.

Organizing Committee:
Guy Blelloch, Carnegie Mellon University
R. Ravi, Carnegie Mellon University


Monday, May 24th
8.30 am Continental Breakfast
9.00 am Luis von Ahn, Carnegie Mellon University
The ESP Game (abstract) (presentation ppt)
9.20 am Abie Flaxman, Carnegie Mellon University
Two stage stochastic programming on average: Minimum Spanning Trees (abstract) (presentation pdf)
9.40 am Ryan Williams, Carnegie Mellon University
k-Anonymity (abstract) (presentation pdf)
10.00 am Mugizi Robert Rwebangira, Carnegie Mellon University
Semi-Supervised Learning Using Randomized Mincuts (abstract) (presentation ppt)
10.20 am Break
11.00 am Umut Acar, Carnegie Mellon University
Self-Adjusting Computation (abstract) (presentation ppt)
11.20 am Renato Werneck, Princeton University
Self-Adjusting Top Trees (abstract) (presentation pdf)
11.40 am Loukas Georgiadis, Princeton University
Finding Dominators in Flowgraphs: A Linear-Time Algorithm and an Experimental Study (abstract) (presentation ppt)
12.00 noon Lunch
1.30 pm Srinath Sridhar, Carnegie Mellon University
Evaluation of the Haplotype Motif Model using the Principle of Minimum Description (abstract) (presentation ppt)
1.50 pm Kedar Dhamdhere, Carnegie Mellon University
Approximating additive distortion of metric embeddings (abstract) (presentation pdf)
2.10 pm Taka Osogami, Carnegie Mellon University
Recursive dimensionality reduction for the analysis of multiserver scheduling policies (abstract) (presentation ppt)
2.30 pm Peter Richter, Carnegie Mellon University
Lower Bounds for Graph Embeddings and Combinatorial Preconditioners (abstract) (presentation pdf)
2.50 pm Break
3.20 pm Todd Phillips, Carnegie Mellon University
A Bezier-Based Approach to Unstructured Moving Meshes (abstract) (presentation pdf)
3.40 pm David Cardoze (Postdoc), Carnegie Mellon University
Topological Representations for Meshes (abstract) (presentation pdf)
4.00 pm Konstantin Andreev, Carnegie Mellon University
Balanced Graph Partitioning (abstract) (presentation ppt)
4.20 pm Discussion
Ideas for Future PROBEs

Read the Abstracts



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