X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper1.git/blobdiff_plain/db8153d47e6b58c304ac2689b6d338e8023ff6e1..0ecc70e5cfcddd4891a106344c71d6244677044d:/paper.tex?ds=inline

diff --git a/paper.tex b/paper.tex
index 30fe880..d9b3e5e 100644
--- a/paper.tex
+++ b/paper.tex
@@ -391,7 +391,7 @@ in~\cite{Benall68,Jana06,Janall99,Riceall06}.
 
 There are many schemes for the simultaneous approximation of all roots of a given
 polynomial. Several works on different methods and issues of root
-finding have been reported in~\cite{Azad07, Gemignani07, Kalantari08, Skachek08, Zhancall08, Zhuall08}. However, Durand-Kerner and Ehrlich-Aberth methods are the most practical choices among
+finding have been reported in~\cite{Azad07, Gemignani07, Kalantari08, Zhancall08, Zhuall08}. However, Durand-Kerner and Ehrlich-Aberth methods are the most practical choices among
 them~\cite{Bini04}. These two methods have been extensively
 studied for parallelization due to their intrinsics parallelism, i.e. the
 computations involved in both methods has some inherent
