What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Algorithm
- Artificial intelligence
His scientific interests lie mostly in Combinatorics, Discrete mathematics, Approximation algorithm, Binary logarithm and Upper and lower bounds.
His study in Combinatorics is interdisciplinary in nature, drawing from both Embedding, Edit distance and Metric space.
The Metric space study combines topics in areas such as Bounded function and Metric.
The study of Discrete mathematics is intertwined with the study of Graph theory in a number of ways.
His Approximation algorithm study incorporates themes from Linear programming, Linear programming relaxation and Graph.
His work carried out in the field of Binary logarithm brings together such families of science as Linear function, Streaming algorithm and Multivariate random variable.
His most cited work include:
- Bounded geometries, fractals, and low-distortion embeddings (410 citations)
- Navigating nets: simple algorithms for proximity search (324 citations)
- Polylogarithmic inapproximability (206 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of investigation include Combinatorics, Discrete mathematics, Metric space, Upper and lower bounds and Approximation algorithm.
His Combinatorics research is multidisciplinary, incorporating elements of Embedding and Bounded function.
His studies deal with areas such as Graph theory and Edit distance as well as Discrete mathematics.
His Metric space research is multidisciplinary, relying on both Metric, Cluster analysis, Steiner point, Algorithm and Lipschitz continuity.
In his research on the topic of Upper and lower bounds, Maximum flow problem is strongly related with Directed graph.
His Approximation algorithm research incorporates themes from Linear programming, Optimization problem and Dynamic programming.
He most often published in these fields:
- Combinatorics (69.30%)
- Discrete mathematics (38.14%)
- Metric space (20.93%)
What were the highlights of his more recent work (between 2018-2021)?
- Combinatorics (69.30%)
- Upper and lower bounds (18.60%)
- Algorithm (14.42%)
In recent papers he was focusing on the following fields of study:
Robert Krauthgamer mainly investigates Combinatorics, Upper and lower bounds, Algorithm, Discrete mathematics and Cluster analysis.
Robert Krauthgamer studies Combinatorics, focusing on Approximation algorithm in particular.
His biological study spans a wide range of topics, including Undirected graph, Maximum flow problem, Directed graph, Current and Matrix multiplication.
His research integrates issues of Range and Sparse vector in his study of Algorithm.
His Discrete mathematics research is multidisciplinary, incorporating perspectives in Graph theory, Topology and Minimax.
The concepts of his Cluster analysis study are interwoven with issues in Binary logarithm, Data point and Multi-objective optimization.
Between 2018 and 2021, his most popular works were:
- Faster Algorithms for All-Pairs Bounded Min-Cuts (9 citations)
- On Solving Linear Systems in Sublinear Time. (9 citations)
- New algorithms and lower bounds for all-pairs max-flow in undirected graphs (8 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Combinatorics
- Artificial intelligence
Robert Krauthgamer mainly investigates Combinatorics, Upper and lower bounds, Coreset, Cluster analysis and Bounded function.
His studies in Combinatorics integrate themes in fields like Condition number, Positive-definite matrix and Diagonally dominant matrix.
The study incorporates disciplines such as Tree and Algorithm, Randomized algorithm in addition to Upper and lower bounds.
His work on Minimum cut as part of general Algorithm study is frequently connected to Omega, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them.
In his work, Topological graph theory, Centroid, Metric space and Communication complexity is strongly intertwined with Binary logarithm, which is a subfield of Coreset.
Within one scientific family, Robert Krauthgamer focuses on topics pertaining to Embedding under Bounded function, and may sometimes address concerns connected to Flow, Planar graph, Function and Distortion.
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.
