Richard Karp

Richard Karp is a Professor Emeritus in the Department of Mathematics at the University of California, Berkeley. His research focuses on Applied Mathematics, with affiliations in the Department of Electrical Engineering and Computer Sciences and the Group in Logic and the Methodology of Science. Karp's work includes contributions to computer science and bioengineering, as evidenced by his publications in areas such as computational molecular biology and linear programming decoding. He has supervised several dissertations, including those on the complexity of games and graph theory. His contact information is available at karp@cs.berkeley.edu.

Richard M. Karp is known for his foundational work in theoretical computer science, particularly in algorithms and complexity theory. His research spans combinatorial optimization, network flow problems, and parallel computation. Karp has contributed to the development of efficient algorithms for problems such as maximum matchings in bipartite graphs, the traveling-salesman problem, and minimum spanning trees. His work on reducibility among combinatorial problems and the complexity of algorithmic efficiency has had a lasting impact. Additionally, he has explored content-addressable networks, randomized algorithms, and feature selection in genomic data. His research has significantly influenced both theoretical and applied computing.