Rate Professor Richard Karp

Academic Profile

Academic Background: Ph.D. in Applied Mathematics, Harvard University, 1959; M.S., Harvard University, 1956; B.A., Harvard University, 1955.

Research Interests: Theoretical computer science, algorithm design, NP-completeness, and computational complexity.

Appointments: Professor, Electrical Engineering and Computer Sciences (EECS), UC Berkeley (1968–1994, 1999–present); Director, International Computer Science Institute (1988–1995).

Awards: National Medal of Science (1996); Turing Award (1985); Kyoto Prize (2008).

Publications:

• Reducibility Among Combinatorial Problems, Complexity of Computer Computations (1972).
• Rapid Identification of Repeated Patterns in Strings, Trees and Arrays, ACM Symposium on Theory of Computing (1972).

Editorial Contributions: Former editor, Journal of the ACM.

Additional Contributions: Pioneered the concept of NP-completeness, foundational to modern computer science.