Major Contributions
A number of well-known algorithms bear Pratt's name. Pratt certificates, short proofs of the primality of a number, demonstrated in a practical way that primality can be efficiently verified, placing the primality testing problem in the complexity class NP and providing the first strong evidence that the problem is not co-NP-complete. The Knuth-Morris-Pratt algorithm, which Pratt designed in the early 1970s together with fellow Stanford professor Donald Knuth and independently from Morris, is still the most efficient general string searching algorithm known today. Along with Blum, Floyd, Rivest, and Tarjan, he described the first worst-case optimal selection algorithm.
Read more about this topic: Vaughan Pratt
Famous quotes containing the word major:
“What was lost in the European cataclysm was not only the Jewish past—the whole life of a civilization—but also a major share of the Jewish future.... [ellipsis in source] It was not only the intellect of a people in its prime that was excised, but the treasure of a people in its potential.”
—Cynthia Ozick (b. 1928)