What is he best known for?
The fields of study he is best known for:
- Computer network
- Algorithm
- Combinatorics
His scientific interests lie mostly in Combinatorics, Discrete mathematics, Distributed algorithm, Theoretical computer science and Distributed computing.
His study in the field of Dominating set and Degree also crosses realms of Constant, Exponential function and Randomness.
His Discrete mathematics study combines topics from a wide range of disciplines, such as Bounded function and Computation.
The various areas that he examines in his Distributed algorithm study include Hypergraph, Approximation algorithm, Network topology, Wireless network and Upper and lower bounds.
The study incorporates disciplines such as Destination-Sequenced Distance Vector routing, Static routing, Geographic routing, Dynamic Source Routing and Topology in addition to Theoretical computer science.
His Distributed computing research is multidisciplinary, incorporating elements of Adversary and Wireless sensor network, Computer network.
His most cited work include:
- Geometric ad-hoc routing: of theory and practice (678 citations)
- Worst-Case optimal and average-case efficient geometric ad-hoc routing (504 citations)
- Distributed computation in dynamic networks (355 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of investigation include Combinatorics, Distributed algorithm, Discrete mathematics, Upper and lower bounds and Binary logarithm.
His research combines Bounded function and Combinatorics.
His Distributed algorithm study deals with Theoretical computer science intersecting with Topology.
His Discrete mathematics research incorporates elements of Node and Wireless network.
His Upper and lower bounds research incorporates themes from Matching, Algorithm and Security token.
His study in the field of Log-log plot is also linked to topics like Omega.
He most often published in these fields:
- Combinatorics (40.69%)
- Distributed algorithm (32.90%)
- Discrete mathematics (27.71%)
What were the highlights of his more recent work (between 2017-2020)?
- Combinatorics (40.69%)
- Distributed algorithm (32.90%)
- Binary logarithm (16.45%)
In recent papers he was focusing on the following fields of study:
The scientist’s investigation covers issues in Combinatorics, Distributed algorithm, Binary logarithm, Time complexity and Upper and lower bounds.
His Combinatorics study integrates concerns from other disciplines, such as Matching and Bounded function.
His Distributed algorithm research includes elements of Discrete mathematics, Randomized algorithm, Graph, Maximal independent set and Arboricity.
Fabian Kuhn frequently studies issues relating to Approximation algorithm and Discrete mathematics.
His research investigates the link between Time complexity and topics such as Dominating set that cross with problems in Theoretical computer science.
He has included themes like Node, Security token, Complement and Integer in his Upper and lower bounds study.
Between 2017 and 2020, his most popular works were:
- On Derandomizing Local Distributed Algorithms (72 citations)
- Possibilities and Impossibilities for Distributed Subgraph Detection (26 citations)
- Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds (25 citations)
In his most recent research, the most cited papers focused on:
- Computer network
- Algorithm
- Combinatorics
His main research concerns Distributed algorithm, Combinatorics, Binary logarithm, Time complexity and Discrete mathematics.
His study in Distributed algorithm is interdisciplinary in nature, drawing from both Arboricity, Overlay network, Theoretical computer science and Open problem.
His work deals with themes such as Dominating set, Minimum spanning tree and Planar graph, which intersect with Theoretical computer science.
His research in Combinatorics intersects with topics in Matching and Upper and lower bounds.
The Discrete mathematics study combines topics in areas such as Graph and Approximation algorithm.
His work carried out in the field of Graph brings together such families of science as Vertex and Graph.
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.
