Charles E. Leiserson

Professor of Computer Science and Engineering

Massachusetts Institute of Technology

Summary

Charles E. Leiserson received the B.S. degree in computer science and mathematics from Yale University, New Haven, Connecticut, in 1975 and the Ph.D. degree in computer science from Carnegie Mellon University, Pittsburgh, Pennsylvania, in 1981. In 1981, he joined the faculty of the Massachusetts Institute of Technology, Cambridge, Massachusetts. He currently holds the position of Professor of Computer Science and Engineering in the MIT Department of Electrical Engineering and Computer Science and is a Margaret MacVicar Faculty Fellow. He leads the Supercomputing Technologies (SuperTech) research group and is member of the Theory of Computation research group in the MIT Computer Science and Artificial Intelligence Laboratory. Prof. Leiserson's research centers on developing theoretical principles of parallel and distributed computing, especially as they relate to engineering reality. Prof. Leiserson pioneered the development of VLSI theory and has written many papers on VLSI algorithms, graph layout, and computer-aided design. His contributions include the divide-and-conquer method of graph layout and the ``retiming'' method for optimizing digital circuitry. Prof. Leiserson has been a leader in the development of parallel computing. As a graduate student at Carnegie Mellon, he wrote the first paper on ``systolic'' architectures with his advisor H.T. Kung. While Corporate Fellow of Thinking Machines Corporation, he designed and led the implementation of the network architecture for the Connection Machine Model CM-5 Supercomputer, which incorporated the ``fat-tree'' interconnection network he developed at MIT. Prof. Leiserson has designed and engineered many parallel algorithms, including ones for matrix linear algebra, graph algorithms, optimization, and sorting. Of particular note, he introduced the notion of ``cache-oblivious'' algorithms, which exploit a hierarchy of processor caches efficiently without any tuning of cache-dependent parameters. Prof. Leiserson's academic work has won many other awards. His Ph.D. dissertation, Area-Efficient VLSI Computation, which deals with the design of systolic systems and with the problem of determining the VLSI area of a graph, won the ACM Doctoral Dissertation Award in 1982, as well as the Fannie and John Hertz Foundation Doctoral Thesis Prize. In 1985 he received a Presidential Young Investigator Award from the National Science Foundation. His textbook, Introduction to Algorithms, coauthored with Ronald L. Rivest, and Thomas H. Cormen, was named Best 1990 Professional and Scholarly Book in Computer Science and Data Processing by the Association of American Publishers. The textbook, now in its third edition with an additional coauthor, Clifford Stein, has been the leading textbook on computer algorithms for many years and is the most cited publication in computer science, according to CiteSeerX. Prof. Leiserson's publications are cited over 10,000 times in the literature, also according to CiteSeerX. Prof. Leiserson is a member of the ACM, IEEE, and SIAM. In 1995-6, he was Shaw Visiting Professor in the Department of Information Systems and Computer Science at the National University of Singapore. He is past Computer Science Program Chair for the Singapore-MIT Alliance, a distance-education initiative in which students in Singapore take MIT classes. He held an Adjunct Professorship at the National University of Singapore for many years; was Director of System Architecture, Director of Research, and Network Architect at Akamai Technologies, Inc. of Cambridge, Massachusetts; and was founder and CTO of Cilk Arts, Inc. of Burlington, Massachusetts, before the company was bought by Intel Corporation. A dedicated teacher, Prof. Leiserson has directly supervised 22 Ph.D. students and over 50 Master's and Bachelor's students.

Charles E. Leiserson received the B.S. degree in computer science and mathematics from Yale University, New Haven, Connecticut, in 1975 and the Ph.D. degree in computer science from Carnegie Mellon University, Pittsburgh, Pennsylvania, in 1981. In 1981, he joined the faculty of the Massachusetts Institute of Technology, Cambridge, Massachusetts. He currently holds the position of Professor of Computer Science and Engineering in the MIT Department of Electrical Engineering and Computer Science and is a Margaret MacVicar Faculty Fellow. He leads the Supercomputing Technologies (SuperTech) research group and is member of the Theory of Computation research group in the MIT Computer Science and Artificial Intelligence Laboratory. Prof. Leiserson's research centers on developing theoretical principles of parallel and distributed computing, especially as they relate to engineering reality. Prof. Leiserson pioneered the development of VLSI theory and has written many papers on VLSI algorithms, graph layout, and computer-aided design. His contributions include the divide-and-conquer method of graph layout and the ``retiming'' method for optimizing digital circuitry. Prof. Leiserson has been a leader in the development of parallel computing. As a graduate student at Carnegie Mellon, he wrote the first paper on ``systolic'' architectures with his advisor H.T. Kung. While Corporate Fellow of Thinking Machines Corporation, he designed and led the implementation of the network architecture for the Connection Machine Model CM-5 Supercomputer, which incorporated the ``fat-tree'' interconnection network he developed at MIT. Prof. Leiserson has designed and engineered many parallel algorithms, including ones for matrix linear algebra, graph algorithms, optimization, and sorting. Of particular note, he introduced the notion of ``cache-oblivious'' algorithms, which exploit a hierarchy of processor caches efficiently without any tuning of cache-dependent parameters. Prof. Leiserson's academic work has won many other awards. His Ph.D. dissertation, Area-Efficient VLSI Computation, which deals with the design of systolic systems and with the problem of determining the VLSI area of a graph, won the ACM Doctoral Dissertation Award in 1982, as well as the Fannie and John Hertz Foundation Doctoral Thesis Prize. In 1985 he received a Presidential Young Investigator Award from the National Science Foundation. His textbook, Introduction to Algorithms, coauthored with Ronald L. Rivest, and Thomas H. Cormen, was named Best 1990 Professional and Scholarly Book in Computer Science and Data Processing by the Association of American Publishers. The textbook, now in its third edition with an additional coauthor, Clifford Stein, has been the leading textbook on computer algorithms for many years and is the most cited publication in computer science, according to CiteSeerX. Prof. Leiserson's publications are cited over 10,000 times in the literature, also according to CiteSeerX. Prof. Leiserson is a member of the ACM, IEEE, and SIAM. In 1995-6, he was Shaw Visiting Professor in the Department of Information Systems and Computer Science at the National University of Singapore. He is past Computer Science Program Chair for the Singapore-MIT Alliance, a distance-education initiative in which students in Singapore take MIT classes. He held an Adjunct Professorship at the National University of Singapore for many years; was Director of System Architecture, Director of Research, and Network Architect at Akamai Technologies, Inc. of Cambridge, Massachusetts; and was founder and CTO of Cilk Arts, Inc. of Burlington, Massachusetts, before the company was bought by Intel Corporation. A dedicated teacher, Prof. Leiserson has directly supervised 22 Ph.D. students and over 50 Master's and Bachelor's students.

Current Institution | Massachusetts Institute of Technology |

Current School | School of Engineering |

Department | Electrical Engineering and Computer Science |

Disciplines | Physical Sciences: Computer Science: AlgorithmsPhysical Sciences: Engineering: Electrical Engineering |

Geographical Focus | Americas |

Birthday | November 10,1953 |

Address | The Stata Center, 32-G768 32 Vassar Street Cambridge Massachusetts 02139 United States Phone: 617-253-5833 |

Profile viewed 2479 times

- Richard B. Adler Scholar, MIT EECS Department (1991)

Publication Summary

**PublicationsBooks**

- Charles E. Leiserson, Area-Efficient VLSI Computation, ACM Doctoral Dissertation Award Series, The MIT Press, Cambridge, Massachusetts, 1983. (Won the ACM award for best Ph.D. thesis in computer science for the 1981-1982 academic year, as well as the John and Fannie Hertz Foundation award for best Ph.D. thesis in 1981.)
- Charles E. Leiserson, editor, Advanced Research in VLSI, The MIT Press, Cambridge, Massachusetts, 1986.
- Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, Introduction to Algorithms, The MIT Press and McGraw-Hill, 1990. Chosen by the Association of American Publishers as the Best 1990 Professional and Scholarly Book in Computer Science and Data Processing. Translated into eight languages.
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, Introduction to Algorithms, second edition, The MIT Press and McGraw-Hill, 2001.

**Papers in Refereed Journals**

- Charles E. Leiserson and James B. Saxe, ``Optimizing synchronous systems,'' Journal of VLSI and Computer Systems, Vol. 1, No. 1, Spring 1983, pp. 41-67. An early version appears in the Twenty-Second Annual Symposium on Foundations of Computer Science, IEEE Computer Society, November 1981, pp. 23-36.
- Charles E. Leiserson and Ron Y. Pinter, ``Optimal placement for river routing,'' SIAM Journal on Computing, Vol. 12, No. 3, August 1983, pp. 447-462. An early version appears in CMU Conference on VLSI Systems and Computations, Pittsburgh, Pennsylvania, October 1981, pp. 126-142.
- Sandeep N. Bhatt and Charles E. Leiserson, ``How to assemble tree machines,'' Advances in Computing Research, Vol. 2, 1984, pp. 95-114. An early version appears in the Fourteenth Annual ACM Symposium on Theory of Computing, San Francisco, California, ACM Special Interest Group for Automata and Computability Theory, May 1982, pp. 77-84.
- Benny Chor, Charles E. Leiserson, Ronald L. Rivest, and James Shearer, ``An application of number theory to the organization of raster-graphics memory,'' JACM, Vol. 33, No. 1, January 1986, pp. 86-104. An early version by the first three authors appears in the Twenty-Third Annual Symposium on Foundations of Computer Science, Chicago, Illinois, IEEE Computer Society, November 1982, pp. 92-99.
- Tom Leighton and Charles E. Leiserson, ``Wafer-scale integration of systolic arrays,'' IEEE Transactions on Computers, Vol. C-34, No. 5, May 1985, pp. 448-461. An early version appears in the Twenty-Third Annual Symposium on Foundations of Computer Science, Chicago, Illinois, IEEE Computer Society, November 1982, pp. 297-311.
- Charles E. Leiserson, ``Fat-trees: universal networks for hardware-efficient supercomputing,'' IEEE Transactions on Computers, Vol. C-34, No. 10, October 1985, pp. 892-901. An early version appears in the 1985 International Conference on Parallel Processing, St. Charles, Illinois, IEEE Computer Society Press, August 1985, pp. 393-402. (Received Best Presentation Award at the conference.)
- Ronald I. Greenberg and Charles E. Leiserson, ``Randomized routing on fat-trees,'' Advances in Computing Research, Vol. 5, JAI Press, Inc., 1989, pp. 345-374. An early version appears in Twenty-Sixth Annual Symposium on Foundations of Computer Science, Portland, Oregon, IEEE Computer Society, October 1985, pp. 241-249.
- Charles E. Leiserson and James B. Saxe, ``A mixed-integer linear programming problem which is efficiently solvable,'' Journal of Algorithms, Vol. 9, 1988, pp. 114-128. An early version appears in Twenty-First Annual Allerton Conference on Communication, Control, and Computing, Department of Electrical Engineering and the Coordinated Science Laboratory of the University of Illinois at Urbana-Champaign, Allerton House, Monticello, Illinois, October 1983, pp. 204-213.
- Charles E. Leiserson and Bruce M. Maggs, ``Communication-efficient parallel algorithms for distributed random-access machines,'' Algorithmica, Vol. 3, 1988, pp. 53-77. An early version appears as ``Communication-efficient parallel graph algorithms,'' in 1986 International Conference on Parallel Processing, St. Charles, Illinois, August 1986, 861-868. (Received Most Original Paper Award at the conference.)
- Ronald I. Greenberg and Charles E. Leiserson, ``A compact layout for the three-dimensional tree of meshes,'' Applied Mathematics Letters, Vol. 1, No. 2, 1988, pp. 171-176.
- Joe Kilian, Shlomo Kipnis, and Charles E. Leiserson, ``The organization of permutation architectures with bused interconnections,'' IEEE Transactions on Computers, Vol. 39, No. 11, November 1990, pp. 1346-1358. An early version appears in Twenty-Eighth Annual Symposium on Foundations of Computer Science, Syracuse, New York, IEEE Computer Society, October 1987, pp. 305-315.
- Thomas H. Cormen and Charles E. Leiserson, ``A hyperconcentrator switch for routing bit-serial messages,'' Journal of Parallel and Distributed Computing, Vol. 10, 1990, pp. 193-204. An early version appears in 1986 International Conference on Parallel Processing, St. Charles, Illinois, August 1986, pp. 721-728. (Received Best Presentation Award at the conference.)
- Charles E. Leiserson and James B. Saxe, ``Retiming synchronous circuitry,'' Algorithmica, Vol. 6, 1991, pp. 5-35.
- Charles E. Leiserson, Zahi S. Abuhamdeh, David C. Douglas, Carl R. Feynman, Mahesh N. Ganmukhi, Jeffrey V. Hill, W. Daniel Hillis, Bradley C. Kuszmaul, Margaret A. St. Pierre, David S. Wells, Monica C. Wong, Shaw-Wen Yang, and Robert Zak, ``The network architecture of the Connection Machine CM-5,'' Journal of Parallel and Distributed Computing, Vol. 33, No. 2, March 15, 1996, pp. 145-158. An early version appears in the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, San Diego, California, July 1992, pp. 272-285.
- Robert D. Blumofe and Charles E. Leiserson, ``Space-efficient scheduling of multithreaded computations,'' SIAM Journal on Computing, Vol. 7, No. 1, February 1998, pp. 202-229. An early version appears in Proceedings of the 25th Symposium on Theory of Computing, ACM, San Diego, California, May, 1993, pp. 362-371.
- Robert D. Blumofe and Charles E. Leiserson, ``Scheduling multithreaded computations by work stealing,'' Journal of the ACM, Vol. 46, No. 5, September 1999, pp. 720-748. An early version appears in the Thirty-Fifth Annual Symposium on Foundations of Computer Science, IEEE Computer Society, November 1994, pp. 356-368.
- Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, and Yuli Zhou, ``Cilk: An efficient multithreaded runtime system,'' Journal of Parallel and Distributed Computing, Vol. 37, No. 1, August 1996, pp. 55-69. An early version appears in the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, July 1995, pp. 207-216.
- Alexander T. Ishii, Charles E. Leiserson, and Marios Papaefthymiou, ``Optimizing two-phase, level-clocked circuitry,'' Journal of the ACM, Vol. 44, No. 1, January 1997, pp. 148-199. An early version appears in the Brown/MIT Conference on Advanced Research in VLSI and Parallel Systems, Providence, Rhode Island, March 1992, pp. 245-264.
- Charles E. Leiserson and Keith H. Randall, ``Parallel algorithms for the circuit value update problem,'' Theory of Computing Systems, Vol. 30, 1997, pp. 583-597. An early version appears in the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures, July 1995, pp. 13-20.
- Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Gregory Plaxton, Stephen J. Smith, and Marco Zagha, ``An experimental analysis of parallel sorting algorithms,'' Theory of Computing Systems, Vol. 31, No. 2, 1998, pp. 135-167. An early version appears under the title, ``A comparison of sorting algorithms for the Connection Machine CM-2,'' in the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, Hilton Head, South Carolina, July 1991, pp. 3-16.
- Don Dailey and Charles E. Leiserson, ``Using Cilk to write multiprocessor chess programs,'' Advances in Computer Games, H.J. van den Herik and B. Monien, eds., volume 9, University of Maastricht, 2001, pp. 25-52.
- C. Scott Ananian, Krste Asanovic, Bradley C. Kuszmaul, Charles E. Leiserson, Sean Lie, ``Unbounded transactional memory,'' IEEE Micro, Vol. 26, No. 1, January 2006. (Won the IEEE Micro ``Top Picks'' award for the most industry relevant and significant papers of the year in computer architecture.) An early version appeared in 11th International Symposium on High-Performance Computer Architecture, San Francisco, CA, February, 2005, pp. 316-327.
- John S. Danaher, I-Ting Angelina Lee, and Charles E. Leiserson, ``Programming with exceptions in JCilk,'' Science of Computer Programming, 2006, to appear.

**Papers in Proceedings of Refereed Conferences (Other than early versions of those above.)**

- H. T. Kung and Charles E. Leiserson, ``Systolic arrays (for VLSI),'' Sparse Matrix Proceedings 1978, I. S. Duff and G. W. Stewart, ed., Knoxville, Tennessee, Society for Industrial and Applied Mathematics, 1979, pp. 256-282.
- Charles E. Leiserson, ``Systolic priority queues,'' Proceedings of the Caltech Conference on Very Large Scale Integration, Charles L. Seitz, ed., Pasadena, California, January 1979, pp. 199-214.
- Dan Hoey and Charles E. Leiserson, ``A layout for the shuffle-exchange network,'' 1980 International Conference on Parallel Processing, August 1980, pp. 329-336.
- Charles E. Leiserson, ``Area-efficient graph layouts (for VLSI),'' Twenty-First Annual Symposium on Foundations of Computer Science, Syracuse, New York, IEEE Computer Society, October 1980, pp. 270-281.
- Charles E. Leiserson, Flavio M. Rose, and James B. Saxe, ``Optimizing synchronous circuitry by retiming,'' Third Caltech Conference on VLSI, Randal Bryant, ed., Pasadena, California, March 1983, pp. 87-116.
- Charles E. Leiserson, ``Systolic and semisystolic design,'' IEEE International Conference on Computer Design/VLSI in Computers (ICCD '83), Rye, New York, October 1983, pp. 627-632.
- Kyle A. Gallivan and Charles E. Leiserson, ``High-performance architectures for adaptive filtering,'' SPIE Conference on Real Time Signal Processing, Vol. 495, No. 7, San Diego, California, August 1984, pp. 30-38.
- Charles E. Leiserson and F. Miller Maley, ``Algorithms for routing and testing routability of planar VLSI layouts,'' Proceedings of the 17th Symposium on Theory of Computing, ACM, Providence, Rhode Island, May 1985, pp. 69-78.
- Alexander T. Ishii and Charles E. Leiserson, ``A timing analysis of level-clocked circuitry,'' Proceedings of the Sixth MIT Conference on Advanced Research in VLSI, April 1990, pp. 113-130.
- Charles E. Leiserson, Satish Rao, and Sivan Toledo, ``Efficient out-of-core algorithms for linear relaxation using blocking covers,'' Thirty-Fourth Annual Symposium on Foundations of Computer Science, IEEE Computer Society, November 1993, pp. 704-713.
- Robert D. Blumofe, Matteo Frigo, Christopher F. Joerg, Charles E. Leiserson, and Keith H. Randall, ``Dag-consistent distributed shared memory,'' Tenth International Parallel Processing Symposium, IEEE Computer Society, April 1996, pp. 132-141.
- Robert D. Blumofe, Matteo Frigo, Christopher F. Joerg, Charles E. Leiserson, and Keith H. Randall, ``An analysis of dag-consistent distributed shared-memory algorithms,'' Eighth Annual ACM Symposium on Parallel Algorithms and Architectures, June 1996, pp. 297-308.
- Charles E. Leiserson, ``Programming irregular parallel applications in Cilk,'' Solving Irregularly Structured Problems in Parallel: 4th International Symposium, IRREGULAR'97, Paderborn, Germany, June 1997, Springer-Verlag, pp. 61-71.
- Mingdong Feng and Charles E. Leiserson, ``Efficient detection of determinacy races in Cilk programs,'' Ninth Annual ACM Symposium on Parallel Algorithms and Architectures, June 1997, pp. 1-11.
- Matteo Frigo, Charles E. Leiserson, and Keith Randall, ``The implementation of the Cilk-5 multithreaded language,'' 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation, Montreal, Canada, June 1998, pp. 212-223.
- Guang-Ien Cheng, Mingdong Feng, Charles E. Leiserson, Keith H. Randall, and Andrew F. Stark, ``Detecting data races in Cilk programs that use locks,'' Tenth ACM Symposium on Parallel Algorithms and Architectures, June 1998, pp. 298-309.
- Matteo Frigo, Charles E. Leiserson, Harald Prokop, and Sridhar Ramachandran, ``Cache-oblivious algorithms,'' 40th Annual Symposium on Foundations of Computer Science, New York, New York, October 17-19, 1999, pp. 285-297.
- Ching Law and Charles E. Leiserson, ``A new competitive analysis of randomized caching,'' Eleventh Annual International Symposium on Algorithms And Computation, December 2000, pp. 35-46.
- Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, and Charles E. Leiserson, ``On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs,'' 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 2004, pp. 133-144.
- Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, and Charles E. Leiserson, ``Adversarial analyses of window backoff strategies for simple multiple-access channels,'' ACM Symposium on Parallelism in Algorithms and Architectures, July 2005, pp. 325-332.
- John S. Danaher, I-Ting Angelina Lee, and Charles E. Leiserson, ``The JCilk language for multithreaded computing,'' Synchronization and Concurrency in Object-Oriented Languages, OOPSLA 2005 Workshop, October 2005.
- Kunal Agrawal, Yuxiong He, Wen Jing Hsu, and Charles E. Leiserson, ``Adaptive scheduling with parallelism feedback,'' ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, March 2006, pp. 100-109.
- Yuxiong He, Wen-Jing Hsu, and Charles E. Leiserson, ``Provably Efficient Two-Level Adaptive Scheduling,'' 12th Workshop on Job Scheduling Strategies for Parallel Processing, Saint Malo, France, June 2006, to appear.
- Kunal Agrawal, Yuxiong He, and Charles E. Leiserson, ``An Empirical Evaluation of Work Stealing with Parallelism Feedback,'' Proceedings of the International Conference on Distributed Computing Systems (ICDCS), July, 2006.
- Kunal Agrawal, Yuxiong He, and Charles E. Leiserson, ``Work stealing with parallelism feedback,'' 26th International Conference on Distributed Computing Systems, Lisboa, Portugal, July 2006, to appear.
- Kunal Agrawal, Charles E. Leiserson, and Jim Sukha, ``Memory models for open-nested transactions,'' Proceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness, October 22, 2006.

**Other Major Publications**

- H. T. Kung and Charles E. Leiserson, ``Algorithms for VLSI processor arrays,'' Chapter 8.3 of Introduction to VLSI Systems by Carver A. Mead and Lynn A. Conway, Addison-Wesley, 1978.
- Charles E. Leiserson, Jill P. Mesirov, Lena Nekludova, Stephen M. Omohundro, and John Reif, ``Solving sparse linear systems via parallel nested dissection on the Connection Machine,'' SIAM 1986 National Meeting, Boston, Mass., July 1986. Also appears as a Thinking Machines Corporation technical memorandum (unnumbered).
- Tom Leighton and Charles E. Leiserson, ``A survey of algorithms for integrating wafer-scale systolic arrays,'' in Wafer-Scale Integration, G. Saucier and J. Trilhe, eds., North-Holland, 1986, pp. 177-195.
- Charles E. Leiserson and John G. Lewis, ``Orderings for parallel sparse symmetric factorization,'' Chapter 5 of Parallel Processing for Scientific Computing, Garry Rodrigue, ed., SIAM, 1989.
- Charles E. Leiserson, ``VLSI theory and parallel supercomputing,'' Chapter 2 of Carnegie Mellon University School of Computer Science 25th Anniversary Symposium, Richard F. Rashid, ed., Addison-Wesley, 1991, pp. 29-44. An early version appeared in Decennial Caltech Conference on VLSI, March 1989, The MIT Press, pp. 5-16.
- Charles E. Leiserson, ``Timekeeper,'' SIGACT News, Vol. 23, No. 4, ACM Press, Fall 1992, pp. 81-82.
- Charles E. Leiserson, ``Cilk,'' in Encyclopedia of Distributed Computing, Joseph Urban and Partha Dasgupta, editors, Kluwer Academic Publishers, to appear.
- Charles E. Leiserson and Aske Plaat, ``Programming parallel applications in Cilk,'' SIAM News, Vol. 31, No. 4, May 1998, pp. 6-7.
- Erik D. Demaine, Martin L. Demaine, Alan Edelman, Charles E. Leiserson, and Per-Olof Persson, ``Building blocks and excluded sums,'' SIAM News, Volume 38, Number 1, January/February 2005.

**Internal Memoranda and Progress Reports (Other than early versions of those above.)**

- Sandeep N. Bhatt and Charles E. Leiserson, ``Minimizing the longest edge in a VLSI layout,'' MIT VLSI Memo No. 82-86, May 1981.
- Charles E. Leiserson and Cynthia A. Phillips, ``A space-efficient algorithm for finding the connected components of rectangles in the plane,'' MIT Laboratory for Computer Science Technical Memorandum MIT/LCS/TM-323, February 1987.
- Charles E. Leiserson and Cynthia A. Phillips, ``Parallel contraction of planar graphs,'' MIT Laboratory for Computer Science Technical Memorandum MIT/LCS/TM-343, October 1987.
- Tom Leighton, Charles E. Leiserson, Bruce Maggs, Serge Plotkin, and Joel Wein, ``Theory of Parallel and VLSI Computation,'' MIT Laboratory for Computer Science Research Seminar Series Memorandum MIT/LCS/RSS 1, March 1988.
- Tom Leighton, Charles E. Leiserson, Bruce Maggs, Serge Plotkin, and Joel Wein, ``Advanced Parallel and VLSI Computation,'' MIT Laboratory for Computer Science Research Seminar Series Memorandum MIT/LCS/RSS 2, March 1988.
- C. E. Leiserson, F. T. Leighton, and S. A. Plotkin, editors, ``Connection Machine Projects,'' MIT Laboratory for Computer Science Research Seminar Series Memorandum MIT/ [0]LCS/ [0]RSS 4, January 1989.
- Tom Leighton, Charles E. Leiserson, and Eric Schwabe, ``Theory of Parallel and VLSI Computation,'' MIT Laboratory for Computer Science Research Seminar Series Memorandum MIT/LCS/RSS 6, March 1989.
- Tom Leighton and Charles E. Leiserson, ``Advanced Parallel and VLSI Computation,'' MIT Laboratory for Computer Science Research Seminar Series Memorandum MIT/ [0]LCS/ [0]RSS 7, December 1989.
- Tom Leighton, Charles E. Leiserson, and Dina Kravets, ``Theory of Parallel and VLSI Computation,'' MIT Laboratory for Computer Science Research Seminar Series Memorandum MIT/LCS/RSS 8, May 1990.
- Charles E. Leiserson, editor, ``Proceedings of the 1991 MIT Student Workshop on VLSI and Parallel Systems,'' MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-513, August 1991.
- Alexander T. Ishii, Charles E. Leiserson, and Marios C. Papaefthymiou, ``An algorithm for the tramp steamer problem based on mean-weight cycles,'' MIT Laboratory for Computer Science Technical Memorandum MIT/LCS/TM-457, November 1991.
- Charles E. Leiserson, editor, ``Proceedings of the 1992 MIT Student Workshop on VLSI and Parallel Systems,'' MIT Laboratory for Computer Science Technical Report MIT/ [0]LCS/ [0]TR-546, August 1992.
- Charles E. Leiserson, editor, ``Proceedings of the 1993 MIT Student Workshop on Supercomputing Technologies,'' MIT Laboratory for Computer Science Technical Report MIT/ [0]LCS/ [0]TR-575, August 1993.
- Phillip B. Gibbons, Richard M. Karp, Charles E. Leiserson, Gregory M. Papadopolous, editors, ``DIMACS Workshop on Models, Architectures, and Technologies for Parallel Computation,'' DIMACS Center for Discrete Mathematics and Theoretical Computer Science, Technical Report 93-87, September, 1993.
- Charles E. Leiserson, editor, ``Proceedings of the 1994 MIT Student Workshop on Supercomputing Technologies,'' MIT Laboratory for Computer Science Technical Report MIT/ [0]LCS/ [0]TR-622, July 1994.
- Supercomputing Technologies Group, MIT Laboratory for Computer Science, Cilk-5.2 (Beta 1) Reference Manual, unpublished manuscript, available on the World Wide Web at http:// [0]supertech.lcs.mit.edu/cilk, 1998. Earlier versions of this manual are also available.
- Charles E. Leiserson, Harald Prokop, and Keith H. Randall, ``Using de Bruijn sequences to index a 1 in a computer word,'' unpublished manuscript, available on the World Wide Web at http:// [0]supertech.lcs.mit.edu/cilk, 1998.
- Charles E. Leiserson and Harald Prokop, ``A minicourse on multithreaded programming,'' unpublished manuscript, available on the World Wide Web at http:// [0]supertech.lcs.mit.edu [0]/cilk, 1999.

Books

Other Publications