diff options
Diffstat (limited to 'doc/diffutils.texi')
| -rw-r--r-- | doc/diffutils.texi | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/doc/diffutils.texi b/doc/diffutils.texi index 1d48f54..7b08cd4 100644 --- a/doc/diffutils.texi +++ b/doc/diffutils.texi @@ -142,26 +142,26 @@ use diffs to update files. David Hayes, Richard Stallman, and Len Tower. Wayne Davison designed and implemented the unified output format. The basic algorithm is described by Eugene W. Myers in ``An O(ND) Difference Algorithm and its Variations'', -@cite{Algorithmica} Vol.@: 1 No.@: 2, 1986, pp.@: 251--266; and in ``A File +@cite{Algorithmica} Vol.@: 1, 1986, pp.@: 251--266, +@url{http://dx.doi.org/10.1007/BF01840446}; and in ``A File Comparison Program'', Webb Miller and Eugene W. Myers, -@cite{Software---Practice and Experience} Vol.@: 15 No.@: 11, 1985, -pp.@: 1025--1040. +@cite{Software---Practice and Experience} Vol.@: 15, 1985, +pp.@: 1025--1040, +@url{http://dx.doi.org/10.1002/spe.4380151102}. @c From: "Gene Myers" <gene@cs.arizona.edu> @c They are about the same basic algorithm; the Algorithmica @c paper gives a rigorous treatment and the sub-algorithm for @c delivering scripts and should be the primary reference, but @c both should be mentioned. -The algorithm was independently discovered as described by E. Ukkonen in +The algorithm was independently discovered as described by Esko Ukkonen in ``Algorithms for Approximate String Matching'', -@cite{Information and Control} Vol.@: 64, 1985, pp.@: 100--118. +@cite{Information and Control} Vol.@: 64, 1985, pp.@: 100--118, +@url{http://dx.doi.org/10.1016/S0019-9958(85)80046-2}. @c From: "Gene Myers" <gene@cs.arizona.edu> @c Date: Wed, 29 Sep 1993 08:27:55 MST @c Ukkonen should be given credit for also discovering the algorithm used @c in GNU diff. -Unless the @option{--minimal} option is used, @command{diff} uses a -heuristic by Paul Eggert that limits the cost to @math{O(N^1.5 log N)} -at the price of producing suboptimal output for large inputs with many -differences. Related algorithms are surveyed by Alfred V. Aho in +Related algorithms are surveyed by Alfred V. Aho in section 6.3 of ``Algorithms for Finding Patterns in Strings'', @cite{Handbook of Theoretical Computer Science} (Jan Van Leeuwen, ed.), Vol.@: A, @cite{Algorithms and Complexity}, Elsevier/MIT Press, |