\begin{thebibliography}{1}

\bibitem{unionfind}
A.~V. Aho, J.~E. Hopcroft, and J.~D. Ullman.
\newblock {\em {Tree Structures for the UNION-FIND Problem}}, pages 139--145.
\newblock Addison Wesley Publishing Company, Reading, Massachusetts, 1974.

\bibitem{Arvind89a}
Arvind and R.~S. Nikhil.
\newblock {Executing a Program on the MIT Tagged-Token Dataflow Architecture}.
\newblock {\em IEEE Transactions on Computers}, 1989 (to appear).
\newblock An earlier version appeared in {\em Proceedings of the PARLE
  Conference, Eindhoven, The Netherlands\/}, Springer-Verlag LNCS Volume 259,
  June 15-19, 1987.

\bibitem{CLUMonitors}
R.~C.~B. Cooper and K.~G. Hamilton.
\newblock Preserving abstraction in concurrent programming.
\newblock {\em IEEE Transactions on Software Engineering}, 14(2):258--263,
  February 1988.

\bibitem{Monitors}
C.~A.~R. Hoare.
\newblock Monitors: An operating system structuring concept.
\newblock {\em Communications of the ACM}, 10(10):549--557, October 1974.

\bibitem{ppq}
D.~W. Jones.
\newblock Concurrent operations on priority queues.
\newblock {\em Communications of the ACM}, 32(1):132--137, January 1989.

\bibitem{Mesa}
B.~W. Lampson and D.~D. Redell.
\newblock Experience with processes and monitors in mesa.
\newblock {\em Communications of the ACM}, 23(2):105--117, February 1980.

\bibitem{NestedMonitors}
A.~M. Lister.
\newblock The problem of nested monitor calls.
\newblock {\em Operating Systems Review}, 11(3):5--7, July 1977.

\bibitem{Nikhil88c}
R.~S. Nikhil.
\newblock {Id (Version 88.1) Reference Manual}.
\newblock Technical Report CSG Memo 284, MIT Laboratory for Computer Science,
  545 Technology Square, Cambridge, MA 02139, August 1988.

\bibitem{Papadopoulos88a}
G.~M. Papadopoulos.
\newblock {\em {Implementation of a General-Purpose Dataflow Multiprocessor}}.
\newblock PhD thesis, Laboratory for Computer Science, Massachusetts Institute
  of Technology, Cambridge, MA 02139, August 1988.

\end{thebibliography}
