What is he best known for?
The fields of study he is best known for:
- Algorithm
- Computer network
- Statistics
Richard M. Karp mostly deals with Discrete mathematics, Combinatorics, Algorithm, Theoretical computer science and Distributed computing.
His Discrete mathematics study incorporates themes from Tree traversal, Upper and lower bounds, Graph and Computation.
His Combinatorics research is multidisciplinary, relying on both Linear programming and Travelling salesman problem.
Richard M. Karp has included themes like Mathematical economics, Complexity class, Matroid and Integer programming in his Travelling salesman problem study.
His Algorithm research incorporates elements of Mathematical optimization and Probabilistic analysis of algorithms.
His Distributed computing research is multidisciplinary, incorporating elements of Overlay network and Computer network, Server.
His most cited work include:
- Reducibility Among Combinatorial Problems. (6546 citations)
- A scalable content-addressable network (6477 citations)
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs (2331 citations)
What are the main themes of his work throughout his whole career to date?
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.
His research integrates issues of Mathematical optimization and Probabilistic analysis of algorithms in his study of Algorithm.
His work deals with themes such as Function and Linear programming, which intersect with Discrete mathematics.
He interconnects Randomized algorithm, Computation and Set in the investigation of issues within Theoretical computer science.
He most often published in these fields:
- Combinatorics (25.88%)
- Algorithm (24.71%)
- Discrete mathematics (19.41%)
What were the highlights of his more recent work (between 2004-2019)?
- Algorithm (24.71%)
- Set (7.35%)
- Combinatorics (25.88%)
In recent papers he was focusing on the following fields of study:
His primary areas of investigation include Algorithm, Set, Combinatorics, Theoretical computer science and Matching.
Richard M. Karp focuses mostly in the field of Algorithm, narrowing it down to topics relating to Communication channel and, in certain cases, Asymptotically optimal algorithm and Flow network.
His biological study spans a wide range of topics, including Discrete mathematics, Upper and lower bounds and Sorting.
His research in Theoretical computer science intersects with topics in Machine learning, Task and Graph.
His Matching study combines topics in areas such as Correctness, Pairwise comparison, Topology and Integer programming.
The study incorporates disciplines such as Matroid, Mathematical economics, Complexity class, Travelling salesman problem and Gene regulatory network in addition to Integer programming.
Between 2004 and 2019, his most popular works were:
- Reducibility Among Combinatorial Problems (2006 citations)
- Conserved patterns of protein interaction in multiple species (689 citations)
- Efficient algorithms for detecting signaling pathways in protein interaction networks. (255 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Computer network
- Statistics
Richard M. Karp mainly investigates Genetics, Matching, Computational biology, Algorithm and Protein Interaction Networks.
His Matching research includes themes of Set, Topology, Travelling salesman problem, Sequence and Integer programming.
His studies deal with areas such as Matroid, Turing machine, Flow network, Mathematical economics and Complexity class as well as Integer programming.
His study in Computational biology is interdisciplinary in nature, drawing from both Genetic analysis, Bacterial protein, Bacteria, Yeast and Protein sequencing.
His work deals with themes such as Smith–Waterman algorithm, Nucleotide, Channel capacity and Random graph, which intersect with Algorithm.
Richard M. Karp integrates many fields, such as Protein network and Theoretical computer science, in his works.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
