Home * People * Richard Karp

Richard Manning Karp,
an American mathematician, computer scientist and pioneer in theoretical computer science and computational complexity for which he received a Turing Award in 1985, the Harvey Prize in 1998, the Benjamin Franklin Medal in 2004, and the Kyoto Prize in 2008 [1] and several honorary degrees. Richard Karp is professor at Department of Electrical Engineering and Computer Sciences with additional appointments in Mathematics, Bioengineering and Operations research, University of California, Berkeley. His research interests further include combinatorial algorithms, discrete probability, computational biology, and internet algorithms [2] . Karp introduced the now standard methodology for proving problems to be NP-complete. He is known for Karp's 21 NP-complete problems, the Edmonds–Karp algorithm, the Hopcroft–Karp algorithm, the Karp–Lipton theorem, and the Rabin–Karp algorithm.
Richard Karp [3]


According to primary StarTech author Bradley Kuszmaul, Hans Berliner, Richard Karp, David Slate, and Lewis Stiller contributed to a mini-seminar on computer chess held at Thinking Machines Corporation on August 12, 1991. In particular, Richard Karp suggested that StarTech should be based on Berliner’s serial program HiTech rather than GNU Chess [4] .

Selected Publications

[5] [6]

External Links


  1. ^ Dr. Richard Karp to Receive Inamori Foundation's 24th Annual Kyoto Prize for Lifetime Achievement in "Advanced Technology", June 20, 2008
  2. ^ Richard M. Karp's Home Page
  3. ^ Richard Karp giving a talk at the EPFL on 13th of July 2009, Category:Richard Karp - Wikimedia Commons
  4. ^ Bradley C. Kuszmaul (1994). Synchronized MIMD Computing. Ph. D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, pdf, pp. 146, Acknowledgments
  5. ^ Richard M. Karp's Publications List
  6. ^ dblp: Richard M. Karp

What links here?

Up one level