What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Algorithm
- Discrete mathematics
Combinatorics, Upper and lower bounds, Binary logarithm, Running time and Discrete mathematics are his primary areas of study.
Much of his study explores Combinatorics relationship to Spanner.
His studies in Spanner integrate themes in fields like Theoretical computer science, Communication complexity, Streaming algorithm and Integer.
Michael Elkin combines subjects such as Distributed algorithm, Discrete geometry and Planar graph with his study of Upper and lower bounds.
The various areas that Michael Elkin examines in his Distributed algorithm study include Networking hardware, Mathematical optimization and Heuristic argument.
He has included themes like Matching and Randomized algorithm in his Arboricity study.
His most cited work include:
- $(1 + psilon,eta)$-Spanner Constructions for General Graphs (154 citations)
- Distributed (δ+1)-coloring in linear (in δ) time (150 citations)
- Distributed Graph Coloring: Fundamentals and Recent Developments (148 citations)
What are the main themes of his work throughout his whole career to date?
Michael Elkin focuses on Combinatorics, Binary logarithm, Discrete mathematics, Upper and lower bounds and Spanner.
Combinatorics and Running time are two areas of study in which he engages in interdisciplinary research.
His Binary logarithm research includes elements of Algorithm, Randomized algorithm, Approximation algorithm and Logarithm.
His Upper and lower bounds research is multidisciplinary, relying on both Routing, Path and Communication complexity.
The study incorporates disciplines such as Multiplicative function, Time complexity, Degree, Efficient algorithm and Integer in addition to Spanner.
The Distributed algorithm study which covers Graph that intersects with Sublinear function.
He most often published in these fields:
- Combinatorics (77.91%)
- Binary logarithm (36.20%)
- Discrete mathematics (30.06%)
What were the highlights of his more recent work (between 2017-2020)?
- Combinatorics (77.91%)
- Spanner (21.47%)
- Distributed algorithm (19.02%)
In recent papers he was focusing on the following fields of study:
His primary areas of study are Combinatorics, Spanner, Distributed algorithm, Binary logarithm and Graph.
In his study, which falls under the umbrella issue of Combinatorics, Spanning tree is strongly linked to Metric space.
His Distributed algorithm study frequently draws connections to other fields, such as Upper and lower bounds.
The concepts of his Binary logarithm study are interwoven with issues in Graph and Time complexity, Algorithm, Efficient algorithm, Minimum spanning tree.
His Time complexity research integrates issues from Log-log plot, Sublinear function, Shortest path problem and Computation.
He studied Graph and Randomized algorithm that intersect with Deterministic algorithm, Parallel algorithm and Current.
Between 2017 and 2020, his most popular works were:
- Linear-Size Hopsets with Small Hopbound, and Constant-Hopbound Hopsets in RNC (19 citations)
- Efficient Algorithms for Constructing Very Sparse Spanners and Emulators (18 citations)
- Locally-Iterative Distributed (Δ+ 1): -Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models (15 citations)
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.
