The Center for **AL**gorithm **AD**aptation **D**issemination
and **IN**tegration (**ALADDIN**) at Carnegie Mellon University
was established in September 2001 for the study of algorithms and their
applications. It is funded through the NSF ITR program and is
a collaboration among several departments at Carnegie Mellon,
industrial partners, and Princeton University.

The primary goal of the ALADDIN Center is to
improve the process of incorporating powerful algorithms into
application domains.

Towards this goal, the Center:

- Supports a sequence of PROBEs
(
**PROB**lem-Oriented **E**xplorations). Each **PROBE**
explores how algorithms can be more effectively applied in a
specific domain. Each PROBE lasts for one (or possibly) two
years.
- Supports various educational
activities including workshops for college teachers and
developing new courses on algorithms.
- Develops a web resource on algorithms.

Overview of ALADDIN PROBEs and Results (pdf)

Carnegie Mellon has a strong and diverse group in Algorithms
and Complexity Theory. The goals of the group are, broadly
speaking, to provide a mathematical understanding of fundamental
issues in Computer Science, and to use this understanding to produce
better algorithms, protocols, and systems. Research interests
include data structures, algorithm design, complexity theory,
parallel algorithms and languages, machine learning theory, cryptography
and security, on-line algorithms and scientific computing. Our
Algorithms and Complexity group maintains strong ties to other
areas, such as computer systems, programming languages, and artificial
intelligence, and we welcome students who have a combination of
theoretical and application-oriented research interests.