removed ref to mcilroy99

Author: peterthiemann

bench.tex

@@ -61,7 +61,7 @@ \subsection{Comparing Algorithms in the \haskell Implementation}
 
 We consider five variants of the Haskell implementation.
 \begin{itemize}
-\item \textbf{McIlroy} our implementation of \citet{DBLP:journals/jfp/McIlroy99}. 
+\item \textbf{McIlroy} our implementation of \citet{DBLP:journals/jfp/McIlroy04}. 
 \item The \textbf{seg} implementation uses the infinite list-based segmented
   representation throughout (\cref{sec:segm-repr}).
 \item The \textbf{segConv} implementation additionally

motivation.tex

@@ -170,7 +170,7 @@ \subsection{Brief Intermezzo on Formal Languages}
 \subsection{McIlroy's Approach}
 \label{sec:naive-approach}
 
-\citet{DBLP:journals/jfp/McIlroy99} enumerates the words of a regular language as a
+\citet{DBLP:journals/jfp/McIlroy04} enumerates the words of a regular language as a
 strictly increasingly ordered infinite stream using Haskell. A key insight is to use the
 length-lexicographic ordering on words, which is defined by $u \lleq v$ if $|u|<|v|$ or
 $|u|=|v|$ and $u\le v$ in the usual lexicographic ordering. Here is a definition in Haskell.\footnote{The type