What is he best known for?
The fields of study he is best known for:
- Algorithm
- Computer network
- Distributed computing
James Aspnes mainly focuses on Theoretical computer science, Population protocol, Distributed computing, Theory of computation and Algorithm.
James Aspnes interconnects Tree, Skip list, Hash table and Node in the investigation of issues within Theoretical computer science.
His research integrates issues of Telecommunications network and Presburger arithmetic in his study of Population protocol.
His Theory of computation research incorporates elements of Multiplication and Mobile computing.
His Algorithm research is multidisciplinary, incorporating elements of Discrete mathematics and Reduction.
His work in Discrete mathematics addresses issues such as PSPACE, which are connected to fields such as Combinatorics.
His most cited work include:
- A Theory of Network Localization (537 citations)
- Computation in networks of passively mobile finite-state sensors (447 citations)
- Skip graphs (345 citations)
What are the main themes of his work throughout his whole career to date?
James Aspnes focuses on Discrete mathematics, Theoretical computer science, Algorithm, Distributed computing and Time complexity.
James Aspnes combines subjects such as Population protocol, Shared memory, Combinatorics and Constant with his study of Discrete mathematics.
Within one scientific family, he focuses on topics pertaining to Randomized algorithm under Shared memory, and may sometimes address concerns connected to Mutual exclusion.
His work carried out in the field of Theoretical computer science brings together such families of science as Adversary, Skip list, Tree, Asynchronous communication and Key.
His work in the fields of Algorithm, such as Theory of computation, intersects with other areas such as Exponential function.
His research brings together the fields of Computer network and Distributed computing.
He most often published in these fields:
- Discrete mathematics (29.19%)
- Theoretical computer science (24.32%)
- Algorithm (22.70%)
What were the highlights of his more recent work (between 2015-2021)?
- Time complexity (16.76%)
- Leader election (7.03%)
- Discrete mathematics (29.19%)
In recent papers he was focusing on the following fields of study:
The scientist’s investigation covers issues in Time complexity, Leader election, Discrete mathematics, State and Population protocol.
His Time complexity research integrates issues from Convergence and Theoretical computer science.
His Theoretical computer science study combines topics from a wide range of disciplines, such as Object, Adversary, Key and Theory of computation.
The Leader election study which covers Computability that intersects with Load balancing.
As a member of one scientific family, he mostly works in the field of Discrete mathematics, focusing on Limit and, on occasion, Transfinite number.
His Population protocol study contributes to a more complete understanding of Algorithm.
Between 2015 and 2021, his most popular works were:
- Time-space trade-offs in population protocols (45 citations)
- Space-optimal majority in population protocols (43 citations)
- The fuzzylog: a partially ordered shared log (9 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Computer network
- Time complexity
His main research concerns Time complexity, Convergence, Leader election, Population protocol and Computability.
His Time complexity study often links to related topics such as Theoretical computer science.
His Theoretical computer science study integrates concerns from other disciplines, such as Object, Key and Multi-core processor.
He regularly links together related areas like Discrete mathematics in his Population protocol studies.
The concepts of his Discrete mathematics study are interwoven with issues in Standard model and Limit.
His Computability research is multidisciplinary, relying on both Binary logarithm, Combinatorics and Load balancing.
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.
