REUs, ALADDIN Center

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. More information about the programs held during the summers of 2002 and 2003 .

REU Summer 2004

The ALADDIN REU Summer 2004 program is scheduled to begin on Tuesday, June 1, 2004. The REU Symposia will begin on Tuesday, July 27th, and continue through mid-August More info for the complete and details.

REUs for Summer 2004

Algorithms for Dynamic Point Location with Good Practical Performance
A Bezier-Based Approach to Unstructured Moving Meshes
Evaluation of Algorithms for the List Update Problem
Exploring PLS-Completeness of Simple Stochastic Game (or Stable Circuit Problem)
Fast and Compact Data Structures
The Game of NimG (Nim on Graphs)
Random Graph Models of Large Real-World Networks
Solving Partial Differential Equations Numerically
Traceable Anonymity

REU Faceboard 2002-2004