2026 Richard M. Karp: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	109	231	225	130	126	293	94725

Research.com Recognitions

2009 - SIAM Fellow For contributions to the theory of algorithms and the theory of NP-completeness.
2002 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)
1996 - US President's National Medal of Science "For his pioneering research in theoretical computer science and the development of NP-Completeness, a concept having an important role in the theory and the practice of computation.", Awarded by President Clinton in a White House ceremony on July 26, 1996.
1994 - ACM Fellow 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
1992 - Member of the National Academy of Engineering For major contributions to the theory and application of NP-completeness, constructing efficient combinatorial algorithms, and applying probabilistic methods in computer science.
1991 - Fellow of the American Association for the Advancement of Science (AAAS)
1990 - INFORMS John von Neumann Theory Prize
1987 - John von Neumann Lecturer
1985 - Fellow of the American Academy of Arts and Sciences
1985 - A. M. Turing Award 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.
1980 - Member of the National Academy of Sciences

Overview

Richard M. Karp is a researcher affiliated with the University of California, Berkeley in the United States. Their research contributions span theoretical computer science, algorithm theory, and combinatorial optimization.

One of the recent published works by Karp is titled Improved bounds on the probability of a union and on the number of events that occur, published in 2025 in the journal Operations Research Letters.

Frequent coauthors include:

Ilan Adler
Sheldon M. Ross

Publication venues where Karp has appeared often include:

Operations Research Letters

Karp has been recognized with multiple awards throughout their career. These honors include:

SIAM Fellow (2009) for contributions to the theory of algorithms and the theory of NP-completeness.
Fellow of the Institute for Operations Research and the Management Sciences (INFORMS) (2002).
US President's National Medal of Science (1996) awarded for pioneering research in theoretical computer science and the development of NP-Completeness, presented by President Clinton.
ACM Fellow (1994) for contributions to algorithm theory and combinatorial optimization.
Member of the National Academy of Engineering (1992) for contributions to NP-completeness and algorithm design.
Fellow of the American Association for the Advancement of Science (AAAS) (1991).
INFORMS John von Neumann Theory Prize (1990).
John von Neumann Lecturer (1987).
Fellow of the American Academy of Arts and Sciences (1985).
A. M. Turing Award (1985) for contributions including algorithm theory, network flow algorithms, polynomial-time computability, and the development of NP-completeness theory.
Member of the National Academy of Sciences (1980).

Best Publications

Reducibility Among Combinatorial Problems

Richard M. Karp

22261
Citations
A scalable content-addressable network

Sylvia Ratnasamy;Paul Francis;Mark Handley;Richard Karp

10985
Citations
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

John E. Hopcroft;Richard M. Karp

4257
Citations
Theoretical improvements in algorithmic efficiency for network flow problems

Jack Edmonds;Richard M. Karp

3647
Citations
LogP: towards a realistic model of parallel computation

David Culler;Richard Karp;David Patterson;Abhijit Sahay

2489
Citations
A Dynamic Programming Approach to Sequencing Problems

Michael Held;Richard M. Karp

1972
Citations
Efficient randomized pattern-matching algorithms

Richard M. Karp;Michael O. Rabin

1967
Citations
The Traveling-Salesman Problem and Minimum Spanning Trees

Michael Held;Richard M. Karp

1953
Citations
Discovering local structure in gene expression data: the order-preserving submatrix problem.

Amir Ben-Dor;Benny Chor;Richard M. Karp;Zohar Yakhini

1649
Citations
The traveling-salesman problem and minimum spanning trees: Part II

Michael Held;Richard M. Karp

1578
Citations
Parallel program schemata

Richard M. Karp;Raymond E. Miller

1471
Citations
A Survey of Parallel Algorithms for Shared-Memory Machines

Richard M. Karp

1437
Citations
Topologically-aware overlay construction and server selection

S. Ratnasamy;M. Handley;R. Karp;S. Shenker

1232
Citations
On the Computational Complexity of Combinatorial Problems

R. M. Karp

1019
Citations
A characterization of the minimum cycle mean in a digraph

Richard M. Karp

1006
Citations
Conserved patterns of protein interaction in multiple species

Roded Sharan;Silpa Suthram;Ryan M. Kelley;Tanja Kuhn

969
Citations
Parallel algorithms for shared-memory machines

Richard M. Karp;Vijaya Ramachandran

940
Citations
Application-Level Multicast Using Content-Addressable Networks

Sylvia Ratnasamy;Mark Handley;Richard M. Karp;Scott Shenker

939
Citations
Feature selection for high-dimensional genomic microarray data

Eric P. Xing;Michael I. Jordan;Richard M. Karp

917
Citations
An optimal algorithm for on-line bipartite matching

R. M. Karp;U. V. Vazirani;V. V. Vazirani

912
Citations
Randomized rumor spreading

R. Karp;C. Schindelhauer;S. Shenker;B. Vocking

897
Citations

Frequent Co-Authors

Ron Shamir Tel Aviv University

Roded Sharan Tel Aviv University

Michael Luby BitRipple

Scott Shenker University of California, Berkeley

Eran Halperin University of California, Los Angeles

Avi Wigderson Institute for Advanced Study

Christos H. Papadimitriou Columbia University

Trey Ideker University of California, San Diego

Tao Jiang University of California, Riverside

Michael I. Jordan University of California, Berkeley

External Links

Wikipedia of Richard M. Karp Personal website of Richard M. Karp

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online degrees can help broaden your options or support your Computer Science education. Many students opt for emba online programs as a way to develop advanced business management skills—an excellent complement to tech expertise.

If you’re interested in how information is stored, organized, and accessed, consider pursuing an online library science degree. This pathway is valuable for those passionate about information systems, database management, or digital archives.

For those cost-conscious, there are many cheap masters programs across the USA, including fields related to data analytics, cybersecurity, and IT management.

Looking to lead teams or innovate within organizations? A doctorate in organizational leadership can boost your credentials and prepare you for high-level positions that shape company technology strategies.