Nationality American Role Computer scientist Alma mater Harvard University Fields Computer Science | Parents Rose Karp, Abraham Karp Name Richard Karp | |
 | ||
Born January 3, 1935 (age 89)
Boston, Massachusetts ( 1935-01-03 ) Institutions University of California, Berkeley
IBM Thesis Some Applications of Logical Syntax to Digital Computer Programming (1959) Doctoral students Narendra Karmarkar
Michael Luby
Rajeev Motwani
Noam Nisan
Barbara Simons Siblings David A. Karp, Carolyn Karp, Robert Karp Education Harvard University (1959), Harvard University (1956), Harvard University (1955) Awards Turing Award, Benjamin Franklin Medal Similar People Jack Edmonds, Richard E Bellman, Rajeev Motwani, David A Karp, Manuel Blum | ||
Doctoral advisor Anthony Oettinger | ||
Richard m karp theory of computation as an enabling tool for the sciences
Richard Manning Karp (born January 3, 1935) 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 a Turing Award in 1985, The Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008.
Contents
- Richard m karp theory of computation as an enabling tool for the sciences
- Biography
- Work
- Turing Award
- References
Biography
Born to Abraham and Rose Karp in Boston, Massachusetts, Karp has three younger siblings: Robert, David, and Carolyn. He attended Harvard University, where he received his bachelor's degree in 1955, his master's degree in 1956, and his Ph.D. in applied mathematics in 1959.
He started working at IBM's Thomas J. Watson Research Center. In 1968, he became Professor of Computer Science, Mathematics, and Operations Research at the University of California, Berkeley. Apart from a 4-year period as a professor at the University of Washington, he has remained at Berkeley. From 1988 to 1995 and 1999 to the present he has also been a Research Scientist at the International Computer Science Institute in Berkeley, where he currently leads the Algorithms Group.
Richard Karp was awarded the National Medal of Science, and was the recipient of the Harvey Prize of the Technion and the 2004 Benjamin Franklin Medal in Computer and Cognitive Science for his insights into computational complexity. In 1994 he was inducted as a Fellow of the Association for Computing Machinery. He is the recipient of several honorary degrees.
In 2012, Karp became the founding director of the Simons Institute for the Theory of Computing at the University of California, Berkeley.
Work
He has made many other important discoveries in computer science and operations research in the area of combinatorial algorithms. His major current research interests include bioinformatics.
In 1971 he co-developed with Jack Edmonds the Edmonds–Karp algorithm for solving the max-flow problem on networks, and in 1972 he published a landmark paper in complexity theory, "Reducibility Among Combinatorial Problems", in which he proved 21 Problems to be NP-complete.
In 1973 he and John Hopcroft published the Hopcroft–Karp algorithm, still the fastest known method for finding maximum cardinality matchings in bipartite graphs.
In 1980, along with Richard J. Lipton, Karp proved the Karp-Lipton theorem (which proves that, if SAT can be solved by Boolean circuits with a polynomial number of logic gates, then the polynomial hierarchy collapses to its second level).
In 1987 he co-developed with Michael O. Rabin the Rabin-Karp string search algorithm.
Turing Award
His citation for the Turing Award was as follows:
For his continuing contributions to the theory of algorithms including the development of efficient algorithms for network flow and other combinatorial optimization problems, the identification of polynomial-time computability with the intuitive notion of algorithmic efficiency, and, most notably, contributions to the theory of NP-completeness. Karp introduced the now standard methodology for proving problems to be NP-complete which has led to the identification of many theoretical and practical problems as being computationally difficult.