\begin{thebibliography}{10}

\bibitem{AH}
J.~Aspnes and M.P. Herlihy.
\newblock Fast randomized consensus using shared memory.
\newblock {\em Journal of Algorithms}, 11, 1990.

\bibitem{AttiyaR95}
H.~Attiya and S.~Rajsbaum.
\newblock A combinatorial topology framework for wait-free computability.
\newblock Preprint, 1995.

\bibitem{Renaming}
Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, and Rudiger Reischuk.
\newblock Renaming in an asynchronous environment.
\newblock {\em Journal of the ACM}, July 1990.

\bibitem{BMZ}
O.~Biran, S.~Moran, and S.~Zaks.
\newblock A combinatorial characterization of the distributed tasks which are
  solvable in the presence of one faulty processor.
\newblock In {\em Proceedings of the 7th Annual ACM Symposium on Principles of
  Distributed Computing}, pages 263--275, August 1988.

\bibitem{BorowskyGafni}
E.~Borowsky and E.~Gafni.
\newblock Generalized flp impossibility result for $t$-resilient asynchronous
  computations.
\newblock In {\em Proceedings of the 1993 ACM Symposium on Theory of
  Computing}, May 1993.

\bibitem{BorowskyGafniPODC}
E.~Borowsky and E.~Gafni.
\newblock Immediate atomic snapshots and fast renaming.
\newblock In {\em Proceedings of the 12th Annual ACM Symposium on Principles of
  Distributed Computing}, August 1993.

\bibitem{BGSIMM}
E.~Borowsky and E.~Gafni.
\newblock A simple algorithmically reasoned chracterization of wait-free
  computationsi.
\newblock In {\em Proceedings of the 16th Annual ACM Symposium on Principles of
  Distributed Computing}, August 1997.

\bibitem{DLPSW86}
D.~Dolev, N.A. Lynch, S.S. Pinter, E.W. Stark, and W.E. Weihl.
\newblock Reaching approximate agreement in the presence of faults.
\newblock {\em Journal of the ACM}, 33(3):499--516, July 1986.

\bibitem{FLP}
M.~Fischer, N.A. Lynch, and M.S. Paterson.
\newblock Impossibility of distributed commit with one faulty process.
\newblock {\em Journal of the ACM}, 32(2), April 1985.

\bibitem{GafniK95}
E.~Gafni and E.~Koutsoupias.
\newblock 3-processor tasks are undecidable.
\newblock PODC 95, Brief announcement.

\bibitem{HerlihyR95}
M.~Herlihy and S.~Rajsbaum.
\newblock Algebraic spans.
\newblock In {\em Proceedings of the 14th Annual ACM Symposium on Principles of
  Distributed Computing}, pages 90--99. ACM, August 1995.

\bibitem{HerlihyR96}
M.P. Herlihy and S.~Rajsbaum.
\newblock On the decidability of distributed decision problems.
\newblock In preparation.

\bibitem{HS93}
M.P. Herlihy and N.~Shavit.
\newblock The asynchronous computability theorem for $t$-resilient tasks.
\newblock In {\em Proceedings of the 1993 ACM Symposium on Theory of
  Computing}, May 1993.

\bibitem{HS94}
M.P. Herlihy and N.~Shavit.
\newblock A simple constructive computability theorem for wait-free
  computation.
\newblock In {\em Proceedings of the 1994 ACM Symposium on Theory of
  Computing}, May 1994.

\bibitem{automata}
N.A. Lynch and M.R. Tuttle.
\newblock An introduction to input/output automata.
\newblock Technical Report MIT/LCS/TM-373, MIT Laboratory For Computer Science,
  November 1988.

\bibitem{Munkres}
J.R. Munkres.
\newblock {\em Elements Of Algebraic Topology}.
\newblock Addison Wesley, Reading MA, 1984.
\newblock ISBN 0-201-04586-9.

\bibitem{SaksZaharoglou}
M.~Saks and F.~Zaharoglou.
\newblock Wait-free $k$-set agreement is impossible: The topology of public
  knowledge.
\newblock In {\em Proceedings of the 1993 ACM Symposium on Theory of
  Computing}, May 1993.

\end{thebibliography}
