Robert C. Zak, Charles E. Leiserson, Bradley C. Kuszmaul, Shaw-Wen Yang,
W. Daniel Hillis, David C. Douglas, and David Potter, ``Parallel computer
system including arrangement for transferring messages from a source processor
to selected ones of a plurality of destination processors and combining responses,''
United States Patent 5,265,207, November 23, 1993.

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.)

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.

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.

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.

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.

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.