Signed-off-by: Akira Yokosawa <akiyks@xxxxxxxxx>
---
defer/rcurelated.tex | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/defer/rcurelated.tex b/defer/rcurelated.tex
index 32074e74..3fb791cf 100644
--- a/defer/rcurelated.tex
+++ b/defer/rcurelated.tex
@@ -10,13 +10,13 @@
The known first mention of anything resembling RCU took the form of a bug
report from
\ppl{Donald}{Knuth}~\cite[page 413 of Fundamental Algorithms]{Knuth73}
-against \ppl{J.}{Weizenbaum}'s SLIP list-processing facility for
+against \ppl{Joseph}{Weizenbaum}'s SLIP list-processing facility for
FORTRAN~\cite{Weizenbaum:1963:SLP:367593.367617}.
Knuth was justified in reporting the bug, as SLIP had no notion of
any sort of grace-period guarantee.
The first known non-bug-report mention of anything resembling RCU appeared
-in \pplsur{H. T.}{Kung}'s and \pplsur{P.}{Lehman}'s landmark
+in \pplsur{H. T.}{Kung}'s and \pplsur{Philip L.}{Lehman}'s landmark
paper~\cite{Kung80}.
There was some additional use of this technique in
academia~\cite{Manber82,Manber84,BarbaraLiskov1988ArgusCACM,Pugh90,Andrews91textbook,Pu95a,Cowan96a,Rastogi:1997:LPV:645923.671017,Gamsa99},
--
2.17.1
