Index: doc/theses/thierry_delisle_PhD/comp_II/comp_II.tex
===================================================================
--- doc/theses/thierry_delisle_PhD/comp_II/comp_II.tex	(revision f0c3120ef113f46364e3c1cf53b2ccae87a6da3b)
+++ doc/theses/thierry_delisle_PhD/comp_II/comp_II.tex	(revision a6cafa8cfc36b27b6de8b3a60c41982b39bef977)
@@ -44,4 +44,5 @@
 \begin{document}
 \maketitle
+\thispagestyle{empty}
 \cleardoublepage
 
@@ -327,5 +328,5 @@
 
 How much scalability is actually needed is highly debatable.
-\emph{libfibre}\cite{libfibre} has compared favorably to other schedulers in webserver tests\cite{karstenuser} and uses a single atomic counter in its scheduling algorithm similarly to the proposed bitmask.
+\emph{libfibre}\cite{libfibre} has compared favorably to other schedulers in webserver tests\cite{Karsten20} and uses a single atomic counter in its scheduling algorithm similarly to the proposed bitmask.
 As such, the single atomic instruction on a shared cacheline may be sufficiently performant.
 
@@ -421,5 +422,5 @@
 Processors that are unnecessarily unblocked lead to unnecessary contention, CPU usage, and power consumption, while too many sleeping processors can lead to sub-optimal throughput.
 Furthermore, transitions from sleeping to awake and vice-versa also add unnecessary latency.
-There is already a wealth of research on the subject\cite{schillings1996engineering, wiki:thunderherd} and I may use an existing approach for the idle-sleep heuristic in this project, \eg\cite{karstenuser}.
+There is already a wealth of research on the subject\cite{schillings1996engineering, wiki:thunderherd} and I may use an existing approach for the idle-sleep heuristic in this project, \eg\cite{Karsten20}.
 
 \subsection{Asynchronous I/O}