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:
“Self-centeredness is a natural outgrowth of one of the toddler’s major concerns: What is me and what is mine...? This is why most toddlers are incapable of sharing ... to a toddler, what’s his is what he can get his hands on.... When something is taken away from him, he feels as though a piece of him—an integral piece—is being torn from him.”
—Lawrence Balter (20th century)