\relax 
\citation{AchlioptasMolloy}
\@writefile{toc}{\contentsline {section}{\tocsection {}{1}{The Algorithm and its Representation}}{1}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces A Visualization for the List Counts}}{2}}
\newlabel{fig:state_diagram}{{1}{2}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{2}{When $c<1$ the Algorithm Succeeds with High Probability}}{3}}
\newlabel{sect:cless1}{{2}{3}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{3}{1-Stacks Stay Small Until Order $n^{1/3}$}}{3}}
\newlabel{sect:onestacksmall}{{3}{3}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{4}{The Probability of Failure is Small Until Order $n^{2/3}$}}{4}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{5}{The Expected Size of $S_2(t)$}}{4}}
\newlabel{sect:s2tsize}{{5}{4}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{6}{The First Time the 1-Stack is Cleared Out}}{4}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{7}{A Summary and Justification for Subsequent Sections}}{5}}
\bibstyle{chicago}
\bibdata{DBP}
\bibcite{AchlioptasMolloy}{\citeauthoryear {Achlioptas and Molloy}{Achlioptas and Molloy}{1997}}
\newlabel{tocindent-1}{0pt}
\newlabel{tocindent0}{15.0pt}
\newlabel{tocindent1}{21.0pt}
\newlabel{tocindent2}{0pt}
\newlabel{tocindent3}{0pt}
\@writefile{toc}{\contentsline {section}{\tocsection {}{}{References\begingroup \@temptokena {{\uppercase {References}}{\uppercase {References}}}\xdef {\uppercase {References}}{\uppercase {References}}{}\mark {}\endgroup }}{6}}