\def\noopsort#1{}
\begin{thebibliography}{}

\bibitem[\protect\citeauthoryear{Achlioptas and Molloy}{Achlioptas and
  Molloy}{1997}]{AchlioptasMolloy}
Achlioptas, D. and M.~Molloy (1997).
\newblock The analysis of a list-coloring algorithm on a random graph (extended
  abstract).
\newblock {\em Proceedings of the 38th IEEE Symposium on Foundations of
  Computer Science\/}, 204--212.

\bibitem[\protect\citeauthoryear{D.E.~Knuth}{D.E.~Knuth}{1990}]{Knuth90RAS}
D.E.~Knuth, R.~Motwani, B.~P. (1990).
\newblock Stable husbands.
\newblock {\em Random Structures Algorithms\/}~{\em 1}, 1--14.

\bibitem[\protect\citeauthoryear{Erd\"{o}s and R\'{e}nyi}{Erd\"{o}s and
  R\'{e}nyi}{1960}]{ErdosRenyi1960}
Erd\"{o}s, P. and A.~R\'{e}nyi (1960).
\newblock On the evolution of random graphs.
\newblock ~{\em 5}, 17--61.

\bibitem[\protect\citeauthoryear{Pollard}{Pollard}{1984}]{Pollard84book}
Pollard, D. (1984).
\newblock {\em Convergence of Stochastic Processes}.
\newblock New York: Springer.

\bibitem[\protect\citeauthoryear{Pollard}{Pollard}{2001}]{PollardUGMTP}
Pollard, D. (2001).
\newblock {\em A User's Guide to Measure Theoretic Probability}.
\newblock Cambridge University Press.

\end{thebibliography}
