X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper2.git/blobdiff_plain/ee01dc901f4df2552c0e6a273fcc518a68da8fe4..b11842fb3e39552ecd202f80f19d4c50dfeae1b5:/paper.tex?ds=inline

diff --git a/paper.tex b/paper.tex
index 0be1e08..e932a3c 100644
--- a/paper.tex
+++ b/paper.tex
@@ -88,7 +88,7 @@ which each processor continues to update its approximations even
 though the latest values of other approximations $z^{k}_{i}$ have not
 been received from the other processors, in contrast with synchronous
 algorithms where it would wait those values before making a new
-iteration. Couturier and al.~\cite{Raphaelall01} proposed two methods
+iteration. Couturier and al.~\cite{cs01:nj} proposed two methods
 of parallelization for a shared memory architecture with OpenMP and
 for a distributed memory one with MPI. They are able to compute the
 roots of sparse polynomials of degree 10,000. The authors showed an interesting
