Guy E. Blelloch Professor Department of Computer Science Carnegie Mellon University Email: blelloch at cs dot cmu dot edu Phone: (412) 268-6245 Fax: (412) 268-5576 Office: 7125 Wean Hall Other Contact Information

Research:

I'm co-director of the ALADDIN Center for the study of algorithms.

My research has largely been in the interaction of Algorithms and Programming Languages.
Here is some of my more recent research.

Adaptive Computation. The idea is to keep track of dependencies while executing an algorithm so that you can go back, change history, and propagate the change to the output.
Data Structures for Graph Compression. We look at how to represent graphs with a small number of bits while still allowing efficient queries on the graphs.
Algorithms for Multiprocessor Garbage Collection. The goal here is to bound the wait time for a GC while also bounding the memory required.
Purely Functional Algorithms. We are interested in purely functional (side effect free) algorithms for various problems; most notably algorithms in computational geometry.

Thread Scheduling
Parallel Algorithms (Delaunay Triangulation, Treaps, Sorting, Graph Connectivity, List Ranking)
The NESL Language
Provably Efficient Language Implementations
Other: Pipelining with Futures, Multibank Memory Systems.

Most of the research has been done under the umbrella of the ALADDIN center and as part of the Sangria project.
Earlier work was done as part of the PSCICO and Scandal projects.

You can try our animations of parallel algorithms. These were written in NESL and converted to JAVA using our NESL-to-Java-applet translator.
You can also try our Pittsburgh map and restaurant database. The interface is terribly primitive compared to e.g. mapquest, but this was the first of the map interfaces available on the web.

Teaching:

15-853: Algorithms in the Real World (Fall 07)
15-492: Parallel Algorithms (Fall 07)
15-499: Algorithms and Applications (Spring 03)
15-451: Algorithms (Spring 02)
15-213: Introduction to Computer Systems (Spring 00)
15-850: Algorithms for Indexing and Searching (Spring 99)
15-849(C): Parallel Computing (Fall 98)

If you are within CMU CS you can try my Side Bar.