Knuth–Morris–Pratt algorithm: Difference between revisions

Content deleted Content added
Undid revision 1162159296 by 42.110.140.44 (talk) should go on the talk page
Citation bot (talk | contribs)
Misc citation tidying. | Use this bot. Report bugs. | #UCB_CommandLine
Line 7:
{{cite journal | last1=Knuth | first1=Donald E. | title=The Dangers of Computer-Science Theory | journal=Studies in Logic and the Foundations of Mathematics | volume=74 | year=1973 | pages=189–195 | doi=10.1016/S0049-237X(09)70357-X| isbn=9780444104915 }}</ref>
Morris and [[Vaughan Pratt]] published a technical report in 1970.<ref>
{{cite techreporttech report | last1=Morris | first1=J.H., Jr | last2=Pratt | first2=V. | title=A linear pattern-matching algorithm | number=TR-40 | year=1970 | institution=University of California, Berkeley, Computation Center}}</ref>
The three also published the algorithm jointly in 1977.<ref name=knuth1977></ref> Independently, in 1969, [[Yuri Matiyasevich|Matiyasevich]]<ref>{{cite journal
| language = ru