Doctoral Theses, Supervisor:

1. Ron Y. Pinter, Routability and Its Impact on Placement Algorithms for Integrated Circuits, August 1982. (Cosupervised by Ronald L. Rivest.)

2. Sandeep N. Bhatt, The Complexity of Graph Layout and Channel Routing for VLSI, January 1984.

3. Andrew V. Goldberg, Efficient Graph Algorithms for Sequential and Parallel Computers, February 1987.

4. F. Miller Maley, Single-Layer Wire Routing, August 1987.

5. Serge A. Plotkin, Graph-Theoretic Techniques for Parallel, Distributed, and Sequential Computation, August 1988.

6. Guy E. Blelloch, Scan Primitives and Parallel Vector Models, September 1988.

7. Bruce M. Maggs, Locality in Parallel Computation, September 1989.

8. Ronald I. Greenberg, Efficient Interconnection Schemes for VLSI and Parallel Computation, September 1989.

9. Cynthia A. Phillips, Theoretical and Experimental Analyses of Parallel Combinatorial Algorithms, October 1989.

10. Shlomo Kipnis, Organization of Systems with Bussed Interconnections, August 1990.

11. James K. Park, The Monge Array: An Abstraction and Its Applications, May 1991.

12. Alexander T. Ishii, Timing Verification of Level-Clocked Circuits, October 1991.

13. Thomas H. Cormen, Virtual Memory for Data Parallel Computing, September 1992.

14. Marios C. Papaefthymiou, Timing Optimization of VLSI and Parallel Systems, August 1993.

15. Bradley C. Kuszmaul, Synchronized MIMD Computation, May 1994.

16. Sivan Toledo, Quantitative Performance Modeling of Scientific Computations and Creating Locality in Numerical Algorithms, May 1995.

17. Robert D. Blumofe, Executing Multithreaded Programs Efficiently, September 1995.

18. Christopher F. Joerg, Cilk: A System for Parallel Multithreaded Computing, January 1996.

19. Keith H. Randall, Cilk: Efficient Multithreaded Computing, May 1998.

20. Matteo Frigo, Portable High-Performance Programs, June 1999.

    bsphack @writeauxout\newlabelphdundone0esphack bsphack @writeauxout\newlabelphddone0esphack