##### Web results:

**Richard**Manning**Karp**(born January 3, 1935) is an American computer scientist and computational theorist at the University of California, Berkeley.- Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111YouTube
- HLF Laureate Portraits: Richard Manning KarpYouTube
- HLFF Shortcuts: Richard Manning KarpYouTube
- NP-Complete Problems, lecture by Richard KarpYouTube

People Faculty

**Richard M. Karp**Larger Photo**Richard M. Karp**Professor Emeritus Research Areas Biosystems & Computational Biology (BIO) Operating Systems & Networking (OSNT) Theory (THY) Research Centers Center for Computational Biology (CCB) Industrial Engineering and Operations Research (IEOR) Simons Institute for the Theory of Computing (SITC)**Richard****Karp**, in full**Richard**Manning**Karp**, (born January 3, 1935, Boston, Massachusetts, U.S.), American mathematician and computer scientist and winner of the 1985 A.**M**. Turing Award, the highest honour in computer science, for “his continuing contributions to the theory of algorithms including the development of efficient algorithms for networ...Professor Emeritus Research Primary Research Area: Applied Mathematics Research Interests: Computer science and bioengineering Contact Information 621 Soda Hall

**karp**@cs.berkeley.edu +1 (510) 642-5799 http://www.cs.berkeley.edu/~**karp**Publications Selected Publications:**Karp**joined University of Washington in 1994 as an Adjunct Professor of Molecular Biology to further explore this subject. He developed an interest in the computational mapping of the human genome. As**Karp**worked more with real world applications, he began to criticize the theory community for focusing on “artificial problems” and being “ingrown.”**Richard****Karp**is a world leader in algorithm design and analysis and computational complexity. His work has helped programmers find workable solution procedures to complex problems, avoiding inordinately time-consuming approaches. Dr.**Karp**received his A.B., S.**M**., and Ph.D. degrees from Harvard University, receiving his Ph.D. in 1959.**Richard M. Karp**focuses on Combinatorics, Algorithm, Discrete mathematics, Theoretical computer science and Upper and lower bounds. His study ties his expertise on Parallel algorithm together with the subject of Combinatorics. Parallel algorithm is a subfield of Parallel computing that**Richard M. Karp**explores.**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 ...A survey of parallel algorithms for shared-memory machines. RM

**Karp**, V Ramachandran. University of California at Berkeley, Berkeley CA. , 1989. 1457. 1989. Topologically-aware overlay construction and server selection. S Ratnasamy,**M**Handley, R**Karp**, S Shenker. Proceedings.**Richard M. Karp**Professor of Computer Science & Engineering and Adjunct Professor of Molecular Biotechnology, University of Washington Throughout his long and distinguished career,**Richard M. Karp**has made major contributions to the fields of computer science, mathematics, operations research, statistics, engineering, and molecular biology, with the unifying theme being the study of ...