CENTER Carnegie Mellon UniversityCarnegie Mellon Computer Science DepartmentSchool of Computer Science
Research Experience for Undergraduates
Related Activities
Outreach Roadshow

Researching novel and important interactions between algorithmic theory and practice, the ALADDIN Center PROBEs (PROBlem-oriented Explorations) are of great interest and quite accessible to students. Many of these projects lend themselves naturally to undergraduate research. The ALADDIN Center is supporting seven undergraduate students this summer, working in teams with graduate students and guided by ALADDIN faculty, on a variety research projects (initiated and led by ALADDIN graduate students). The first month is spent exploring the literature and becoming familiar with the topic. During the second and third months, the students formulate the main questions, embark on the research, and implement code, then write up and present the results. All participants meet weekly to discuss their research progress, problems, and successes. At the end of the summer, a mini-symposium is held in which each student presents their work in a moderated session and has the results published on the ALADDIN web site. Information about the programs held during the past summers of 2002 and 2003 can be found at: REU Symposium 2002, REU 2003, and REU 2004.

REU Summer 2005 Schedule
Thank you to all of our REU students for making this another excellent summer!

REU Symposia Symposia Schedule and Presentations
The REU Symposia were held on August 2, 9, 16, 18, and 23.

REU Projects for Summer 2005
Covert Multi-Party Computation
Dynamic and Kinetic Algorithms for 3d Convex Hull
Using Games to Solve Problems that Computers Cannot Yet Solve: Collecting Common Sense Knowledge Using Variants of the Game TABOO
Using Games to Solve Problems that Computers Cannot Yet Solve: Improving Accessibility of the Web
Using Games to Solve Problems that Computers Cannot Yet Solve: Locating Objects in Images
Understanding the Complexity of Distances in the Internet, and the Performance of New Routing Protocols
Certification Infrastructure for Trust-Free Grid Computing
Algorithms for Halplotype-Based Association Studies
Proof Planning for Theorem Provers

REU Faceboard 2002-2004


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