Computing Atlas

How Computing Was Built
Pioneers

Richard M. Karp

Algorithms and Complexity Theory

Citation Formats

General Reference

APA Style

BibTeX

Richard Manning Karp is an American computer scientist and computational theorist at the University of California, Berkeley, most notable for his research in the theory of algorithms. He received the 1985 ACM Turing Award, the Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008, and was elected to the National Academy of Engineering in 1992 for contributions to the theory of NP-completeness, efficient combinatorial algorithms, and probabilistic methods in computer science.

Facts
Birth Year
1935 1
Birth Date
1935-01-03 1
Sources
1. Wikipedia: Richard M. Karp
Wikimedia FoundationLead section
Quote, Lead section
Richard Manning Karp is an American computer scientist and computational theorist at the University of California, Berkeley, most notable for his research in the theory of algorithms. He received the 1985 ACM Turing Award, the Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008, and was elected to the National Academy of Engineering in 1992 for contributions to the theory of NP-completeness, efficient combinatorial algorithms, and probabilistic methods in computer science.
View the Source
1. Wikipedia: Richard M. Karp
Wikimedia FoundationInfobox, Born
Quote, Infobox, Born
January 3, 1935
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0 open reader challenges)
No disputes yet. Spotted an error or a better source? Open the first one.

View At A Past Year

The atlas records no dated fact of its own for this entry, so there is no other year to choose.