What is he best known for?
The fields of study he is best known for:
- Algorithm
- Combinatorics
- Discrete mathematics
His primary areas of study are Combinatorics, Discrete mathematics, Shortest path problem, Computer network and Time complexity.
His Combinatorics study often links to related topics such as Upper and lower bounds.
The Discrete mathematics study combines topics in areas such as Data structure, Oracle and Link/cut tree.
The various areas that he examines in his Computer network study include Constrained Shortest Path First and Flow statistics.
He interconnects Distributed computing, IS-IS and Link-state routing protocol, Private Network-to-Network Interface in the investigation of issues within Constrained Shortest Path First.
His Time complexity study integrates concerns from other disciplines, such as Computer program and Dominator.
His most cited work include:
- Internet traffic engineering by optimizing OSPF weights (968 citations)
- Optimizing OSPF/IS-IS weights in a changing world (573 citations)
- Approximate distance oracles (535 citations)
What are the main themes of his work throughout his whole career to date?
Mikkel Thorup mainly focuses on Combinatorics, Discrete mathematics, Time complexity, Binary logarithm and Hash function.
His Combinatorics research includes themes of Upper and lower bounds and Data structure.
His work carried out in the field of Data structure brings together such families of science as Priority queue and Linear space.
Mikkel Thorup works mostly in the field of Discrete mathematics, limiting it down to topics relating to Space and, in certain cases, Reduction, as a part of the same area of interest.
His Time complexity research is multidisciplinary, incorporating elements of Graph theory, Deterministic algorithm, Minimum cut and Spanning tree.
In his study, Algorithm and Sampling is inextricably linked to Set, which falls within the broad field of Hash function.
He most often published in these fields:
- Combinatorics (59.00%)
- Discrete mathematics (32.33%)
- Time complexity (18.33%)
What were the highlights of his more recent work (between 2014-2021)?
- Combinatorics (59.00%)
- Hash function (16.00%)
- Discrete mathematics (32.33%)
In recent papers he was focusing on the following fields of study:
Mikkel Thorup focuses on Combinatorics, Hash function, Discrete mathematics, Time complexity and Binary logarithm.
Mikkel Thorup works on Combinatorics which deals in particular with Vertex.
His work in Hash function covers topics such as Algorithm which are related to areas like Heuristics, Floorplan and Shortest path problem.
His Integer study, which is part of a larger body of work in Discrete mathematics, is frequently linked to Ball, bridging the gap between disciplines.
His Time complexity research focuses on subjects like Graph, which are linked to Graph.
As a part of the same scientific study, Mikkel Thorup usually deals with the Binary logarithm, concentrating on Expected value and frequently concerns with Connected component, Conjecture and Randomness.
Between 2014 and 2021, his most popular works were:
- Heavy Hitters via Cluster-Preserving Clustering (36 citations)
- Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time (36 citations)
- Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication (27 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Combinatorics
- Statistics
His primary areas of investigation include Combinatorics, Hash function, Discrete mathematics, Time complexity and Binary logarithm.
Minimum cut is the focus of his Combinatorics research.
His Hash function research incorporates elements of Independence, Permutation and Algorithm.
As a part of the same scientific family, Mikkel Thorup mostly works in the field of Algorithm, focusing on Tabulation hashing and, on occasion, Probabilistic logic.
His Time complexity research is multidisciplinary, incorporating perspectives in Digraph, Reachability, Linear space and Planar graph.
The study incorporates disciplines such as Distributed algorithm, Reduction, Turnstile and Cluster analysis in addition to Binary logarithm.
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.
