From: Kahina <kahina@kahina-VPCEH3K1E.(none)>
Date: Thu, 5 Nov 2015 10:36:21 +0000 (+0100)
Subject: la biblio
X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper1.git/commitdiff_plain/d70ea05e424af6b2925d036c3ff4b7f2552da8fc

la biblio
---

diff --git a/mybibfile.bib b/mybibfile.bib
index 5177fd8..4759950 100644
--- a/mybibfile.bib
+++ b/mybibfile.bib
@@ -229,14 +229,19 @@ OPTannote = {•}
   author =  "GS. Schedler",
 }x
 
-@Article{Winogard72,
-  title =   "  Parallel iteration methods",
-  journal = " Plenum, New York",
-  volume =  "",
-  number =  "",
-  pages =   "53-60",
-  year =    "1972",
-  author =  "S. Winogard",
+@InProceedings{Winogard72,
+  title =	"Parallel Iteration Methods",
+  author =	"Shmuel Winograd",
+  bibdate =	"2011-09-13",
+  bibsource =	"DBLP,
+		 http://dblp.uni-trier.de/db/conf/coco/cocc1972.html#Winograd72",
+  booktitle =	"Complexity of Computer Computations",
+  publisher =	"Plenum Press, New York",
+  year = 	"1972",
+  editor =	"Raymond E. Miller and James W. Thatcher",
+  ISBN = 	"0-306-30707-3",
+  pages =	"53--60",
+  series =	"The IBM Research Symposia Series",
 }x
 
 @Article{Benall68,
diff --git a/paper.tex b/paper.tex
index b6e1d7f..e8ec4e3 100644
--- a/paper.tex
+++ b/paper.tex
@@ -385,7 +385,7 @@ Authors usually adopt one of the two following approaches to parallelize root
 finding algorithms. The first approach aims at reducing the total number of
 iterations as by Miranker
 ~\cite{Mirankar68,Mirankar71}, Schedler~\cite{Schedler72} and
-Winogard~\cite{Winogard72}. The second approach aims at reducing the
+Winograd~\cite{Winogard72}. The second approach aims at reducing the
 computation time per iteration, as reported
 in~\cite{Benall68,Jana06,Janall99,Riceall06}.