\documentstyle[11pt]{article}
\begin{document}


Referee A

\begin{enumerate}
\item %1  
Done.
\item %2
Done.
\item %3
Done.
\item %4
Done.
\item %5
Actually, the text states that processor $p$ chooses the same 
location in {\tt prism} as processor $r$, so the swap operation would 
have erased $r$'s PID from {\tt prism} 
(``Assuming it has read the PID of an existing processor (e.g. $r$), 
$p$ attempts to collide with it'').
\item %6
Done.
\item %7
Done.
\item %8
We start counting the levels at 0. In a tree of $d$ levels 
the levels are numbered $0,1,\ldots,d-1$ so $i<d$ is correct.
\item %9
Done.
\item %10
Done.
\item %11
Done.
\end{enumerate}

Referee B

\begin{enumerate}
\item %1
Done. 
\item %2
Done. 
\item %3
Done. 
\item %4
Done. 
\item %5
Done. 
\item %6
Done. 
\item %7
Done. 
\item %8
Done. 
\item %9
Done. 
\item %10
Done. 
\end{enumerate}

\end{document}
