Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Vaughan Pratt

Theory of Computation

Vaughan Pratt, born on 12 April 1944, is a computer scientist and professor emeritus at Stanford University. He was raised in Australia and educated at Knox Grammar School and the University of Sydney, where his 1970 master's thesis dealt with what is now called natural language processing. He then moved to the United States and completed a Stanford doctorate in twenty months under Donald Knuth, on the Shellsort algorithm and sorting networks. He taught at MIT from 1972 and at Stanford from 1981, becoming professor emeritus in 2000. His name is attached to the Knuth-Morris-Pratt string searching algorithm, to Pratt certificates, which show that primality testing lies in NP, to the top-down operator precedence method known as the Pratt parser, and to dynamic logic, which he developed in 1976. He directed the Stanford SUN workstation project, worked with the young Sun Microsystems and designed its ambigram logo. His later research concerns formal models of concurrent systems and Chu spaces.

Facts
Birth Year
1944 1
Birth Date
1944-04-12 1
Nationality
Australian 1
Connections

In Field

Source Vaughan Pratt (Wikipedia)
In the Other Atlases

Nationality

Also in Geography Atlas: the nationality of this subject.

Source Vaughan Pratt (Wikipedia)Career
Quote, Career
Raised in Australia and educated at Knox Grammar School
Sources
1. Vaughan Pratt (Wikipedia)
  • Lead
    Vaughan Pratt (born April 12, 1944)
  • Career
    Raised in Australia and educated at Knox Grammar School
  • In Field: Algorithms and Complexity Theory, Lead [in-field]
    Pratt has made several contributions to foundational areas such as search algorithms, sorting algorithms, and primality testing.
  • In Group: Algorithm Design and Analysis, Lead [in-field]
    Pratt has made several contributions to foundational areas such as search algorithms, sorting algorithms, and primality testing.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.