What is he best known for?
The fields of study he is best known for:
- Algorithm
- Computer network
- Combinatorics
Satish Rao mainly focuses on Combinatorics, Discrete mathematics, Approximation algorithm, Computer network and Graph.
He combines subjects such as Flow, Embedding and Metric with his study of Combinatorics.
The Discrete mathematics study combines topics in areas such as Shortest Path Faster Algorithm and Bottleneck traveling salesman problem.
His work deals with themes such as Approximation theory, Multi-commodity flow problem, Metric space and Euclidean distance, which intersect with Approximation algorithm.
The concepts of his Computer network study are interwoven with issues in Content and Distributed computing.
His Graph research is multidisciplinary, incorporating elements of Time complexity and Network topology.
His most cited work include:
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms (686 citations)
- A tight bound on approximating arbitrary metrics by tree metrics (565 citations)
- A Maximum Likelihood Stereo Algorithm (446 citations)
What are the main themes of his work throughout his whole career to date?
His main research concerns Combinatorics, Discrete mathematics, Approximation algorithm, Algorithm and Time complexity.
Maximum flow problem is closely connected to Flow in his research, which is encompassed under the umbrella topic of Combinatorics.
The study incorporates disciplines such as Embedding and Metric in addition to Discrete mathematics.
His Approximation algorithm research focuses on subjects like Travelling salesman problem, which are linked to Tree.
While the research belongs to areas of Algorithm, Satish Rao spends his time largely on the problem of Supertree, intersecting his research to questions surrounding Set.
In his research on the topic of Time complexity, Spanning tree is strongly related with Minimum spanning tree.
He most often published in these fields:
- Combinatorics (45.98%)
- Discrete mathematics (31.61%)
- Approximation algorithm (18.97%)
What were the highlights of his more recent work (between 2009-2021)?
- Combinatorics (45.98%)
- Algorithm (18.39%)
- Theoretical computer science (6.90%)
In recent papers he was focusing on the following fields of study:
Combinatorics, Algorithm, Theoretical computer science, Time complexity and Discrete mathematics are his primary areas of study.
His Combinatorics study frequently draws connections to other fields, such as Logarithm.
His studies in Algorithm integrate themes in fields like Process and Set.
His studies deal with areas such as Classifier, Decision boundary and Graph partition as well as Theoretical computer science.
His Time complexity study incorporates themes from Tree, Semidefinite programming, Theory of computation, Supertree and Minimum spanning tree.
Satish Rao integrates Discrete mathematics and Laplace operator in his studies.
Between 2009 and 2021, his most popular works were:
- Quartets MaxCut: A Divide and Conquer Quartets Algorithm (78 citations)
- Quartet MaxCut: a fast algorithm for amalgamating quartet trees. (71 citations)
- Query strategies for evading convex-inducing classifiers (64 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Computer network
- Combinatorics
Satish Rao spends much of his time researching Combinatorics, Discrete mathematics, Algorithm, Time complexity and Theoretical computer science.
Satish Rao has included themes like Satisfiability and Logarithm in his Combinatorics study.
Discrete mathematics and Constraint satisfaction problem are two areas of study in which Satish Rao engages in interdisciplinary work.
His work on Local algorithm is typically connected to Random walk as part of general Algorithm study, connecting several disciplines of science.
In his study, Interval graph, Vertex, Theory of computation, Approximation algorithm and Binary logarithm is inextricably linked to Semidefinite programming, which falls within the broad field of Time complexity.
The study incorporates disciplines such as Classifier, Set, Supertree and Feature vector in addition to Theoretical computer science.
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.
