1997 - ACM Fellow An outstanding computer scientist, with unusually diverse, original and deep accomplishments, like showing primes in NP, inventing dynamic logic, helping start SUN, and solidifying concurrency.
Vaughan R. Pratt mostly deals with Combinatorics, Discrete mathematics, Theoretical computer science, Probabilistic logic and Architecture. Vaughan R. Pratt combines subjects such as Linear function, Selection and Applied mathematics with his study of Combinatorics. In the subject of general Discrete mathematics, his work in Higher-order logic, Substructural logic and Intermediate logic is often linked to Equational logic, thereby combining diverse domains of study.
His study in Theoretical computer science is interdisciplinary in nature, drawing from both Parallel computing, Data compression, Partially ordered set, String and Compressed suffix array. His Probabilistic logic study integrates concerns from other disciplines, such as Robot, Software system, Inertial measurement unit and Desert. Along with Architecture, other disciplines of study including Intervention and Human–computer interaction are integrated into his research.
Vaughan R. Pratt mainly focuses on Discrete mathematics, Theoretical computer science, Algebra, Combinatorics and Algorithm. His work in Discrete mathematics covers topics such as Automaton which are related to areas like Event and Converse. His work deals with themes such as Computational complexity theory, Programming language, Concurrency and Software engineering, which intersect with Theoretical computer science.
His Algebra study combines topics from a wide range of disciplines, such as Generalization and Boolean function. In his study, which falls under the umbrella issue of Combinatorics, Linear function is strongly linked to Upper and lower bounds. His biological study spans a wide range of topics, including Pixel, Exponential function and Rendering.
His scientific interests lie mostly in Algebra, Discrete mathematics, Chu space, Artificial intelligence and Combinatorics. His Algebra research is multidisciplinary, incorporating elements of Predicate logic and Many-valued logic, Substructural logic. The Discrete mathematics study combines topics in areas such as Converse and Row.
His research in Artificial intelligence intersects with topics in Software system and Desert. His Software system research is multidisciplinary, relying on both Inertial measurement unit and Human–computer interaction. His study in the field of Complete partial order is also linked to topics like Main diagonal.
His main research concerns Human–computer interaction, Robot, Artificial intelligence, Desert and Probabilistic logic. His research in Human–computer interaction intersects with topics in Sign language and Manually coded language. His Robot research includes themes of Software system and Inertial measurement unit.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Fast Pattern Matching in Strings
Donald E. Knuth;James H. Morris;Vaughan R. Pratt.
SIAM Journal on Computing (1977)
Stanley: The Robot that Won the DARPA Grand Challenge
Sebastian Thrun;Michael Montemerlo;Hendrik Dahlkamp;David Stavens.
Journal of Field Robotics (2006)
Time bounds for selection
Manuel Blum;Robert W. Floyd;Vaughan Pratt;Ronald L. Rivest.
Journal of Computer and System Sciences (1973)
Towards fully autonomous driving: Systems and algorithms
Jesse Levinson;Jake Askeland;Jan Becker;Jennifer Dolson.
(2011)
Modeling concurrency with partial orders
Vaughan Pratt.
International Journal of Parallel Programming (1986)
Semantical consideration on floyo-hoare logic
Vaughan R. Pratt.
foundations of computer science (1976)
SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC
V. R. Pratt.
Journal of Symbolic Logic (1976)
Direct least-squares fitting of algebraic surfaces
Vaughan Pratt.
international conference on computer graphics and interactive techniques (1987)
Every Prime Has a Succinct Certificate
Vaughan R. Pratt.
SIAM Journal on Computing (1975)
Linear Algorithm for Data Compression via String Matching
Michael Rodeh;Vaughan R. Pratt;Shimon Even.
Journal of the ACM (1981)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
MIT
Stanford University
Princeton University
Stanford University
Bar-Ilan University
University of Edinburgh
Carnegie Mellon University
IBM (United States)
Nimble Research
Willow Garage
Chinese Academy of Sciences
Tufts University
Bocconi University
The Ohio State University
Cornell University
Université du Québec à Trois-Rivières
Osaka University
Tokyo Institute of Technology
Osaka University
Wellcome Sanger Institute
University of Bremen
Stanford University
Leiden University
Emory University
Medical University of Graz
University of Chicago