Pioneers in Computer Science
Pioneers in CS
Back
Richard M. Karp
Internet Agealgorithmstheory of computation

Richard M. Karp

Richard Manning Karp is an American computer scientist and computational theorist at the University of

1935 – presentU.S.AContribution: 1985

Introduction

Richard M. Karp (born 1935) is an American computer scientist and recipient of the Turing Award. He has made significant contributions to the theory of algorithms and computational complexity. Karp is known for his work in NP-completeness, graph algorithms, and optimization problems, which has had a profound impact on the field of theoretical computer science.

Key Achievement

Contributions to algorithm theory, including the development of efficient algorithms for network flow and other combinatorial optimization problems; identified polynomial-time computability with the intuitive notion of algorithmic efficiency; contributed to the theory of NP-completeness

Biography

Richard Manning Karp is an American computer scientist and computational theorist at the University of California, Berkeley. He is most notable for his research in the theory of algorithms, for which he received the 1985 ACM Turing Award, The Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008.

Awards

Frederick W. Lanchester Prize1977
Fulkerson Prize1979
Turing Award1985
John von Neumann Theory Prize1990
ACM Fellow1994
Charles Babbage Award1995
National Medal of Science1996
Harvey Prize1998
EATCS award2000
Benjamin Franklin Medal2004
Kyoto Prize in Advanced Technology2008
Fellow of the Society for Industrial and Applied Mathematics2009
Dickson Prize in Science2009
honorary doctorate of the Weizmann Institute of Science
Harvard Centennial Medal
honorary doctor of ETH Zürich
honorary doctorate of Technion

Institutions

University of Washington

University of California, Berkeley

Education

Harvard School of Engineering and Applied Sciences

University of California, Berkeley

Harvard University