Richard+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 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]. 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]. || toc =StarTech= 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.
 * Home * People * Richard Karp**
 * [[image:Karp_mg_7736.jpg link="http://commons.wikimedia.org/wiki/Category:Richard_Karp"]] ||~  || **Richard Manning Karp**,
 * Richard Karp ||~  ||^   ||

=Selected Publications=
 * Richard Karp (**1959**). //Some Applications of Logical Syntax to Digital Computer Programming//. Ph.D. Thesis, Harvard University
 * Manuel Blum, Richard Karp, Oliver Vornberger, Christos H. Papadimitriou, Mihalis Yannakakis (**1981**). //[|The Complexity of Testing Whether a Graph is a Superconcentrator]//. [|Information Processing Letters], Vol. 13 Nos. 4/5
 * Richard Karp (**1986**). //[|Combinatorics, complexity, and randomness]//. Communications of the ACM, Vol. 29, No. 2
 * Richard Karp, Yanjun Zhang (**1988**). //[|A randomized parallel branch-and-bound procedure]//. [|STOC '88]
 * Richard Karp, Yanjun Zhang (**1989**). //[|On parallel evaluation of game trees]//. [|SPAA '89]
 * Richard Karp, Yanjun Zhang (**1993**). //[|Randomized parallel algorithms for backtrack search and branch-and-bound computation]//. Journal of the ACM, Vol. 40, No. 3
 * Richard Karp, Yanjun Zhang (**1995**). //[|Bounded branching process and and/or tree evaluation]//. [|Random Structures & Algorithms, Vol. 7, No. 2]

=External Links= > media type="custom" key="24020244"
 * [|Richard M. Karp's Home Page]
 * [|Richard M. Karp from Wikipedia]
 * [|Richard M. Karp | EECS at UC Berkeley]
 * [|CCB | Richard Karp, Ph.D.]
 * [|ICSI | Board Bios | Richard M. Karp]
 * [|The Mathematics Genealogy Project - Richard Karp]
 * [|Details for Richard Karp - Oberwolfach Photo Collection]
 * Message from Richard Manning Karp - The 2008 Kyoto Prize, [|YouTube] Video

=References= =What links here?= include page="Richard Karp" component="backlinks" limit="40"
 * Up one level**