Richard M. Karp

From Simple English Wikipedia, the free encyclopedia
Richard Manning Karp
Richard Karp giving a talk at the EPFL on 13th of July 2009
Born (1935-01-03) January 3, 1935 (age 89)
Alma materHarvard University
Known forEdmonds–Karp algorithm
Karp's 21 NP-complete problems
Hopcroft–Karp algorithm
Karp–Lipton theorem
Rabin–Karp string search algorithm
AwardsTuring Award (1985)
John von Neumann Theory Prize (1990)
National Medal of Science (1996)
Harvey Prize
Benjamin Franklin Medal
Kyoto Prize
Scientific career
FieldsComputer Science
InstitutionsUniversity of California, Berkeley
ThesisSome Applications of Logical Syntax to Digital Computer Programming (1959)
Doctoral advisorAnthony Oettinger
Doctoral studentsNarendra Karmarkar
Michael Luby
Rajeev Motwani
Noam Nisan
Barbara Simons

Richard Manning Karp (born January 3, 1935) is an American computer scientist and computational theorist at the University of California, Berkeley. He is known for his research in the theory of algorithms, for which he received a Turing Award in 1985, The Benjamin Franklin Medal in Computer and Cognitive Science in 2004,[1] and the Kyoto Prize in 2008.

He work includes solving problems of combinatorial optimization (mostly network flow), asking questions about what an efficient algorithm looks like, and works about algorithmic complexity theory,.

References[change | change source]

  1. "Richard M. Karp". The Franklin Institute. 2014-01-15. Retrieved 2020-06-12.

Other websites[change | change source]

Media related to Richard Karp at Wikimedia Commons