What is he best known for?
The fields of study he is best known for:
- Algorithm
- Programming language
- Artificial intelligence
His primary scientific interests are in Time complexity, Voting, Discrete mathematics, Combinatorics and Computer security.
His work carried out in the field of Time complexity brings together such families of science as Outcome, Control and Artificial intelligence.
His work deals with themes such as Property, Mathematical economics and Pairwise comparison, which intersect with Voting.
His work on Theory of computing as part of general Discrete mathematics research is often related to Collapse, thus linking different fields of science.
His Combinatorics study combines topics from a wide range of disciplines, such as Computational complexity theory and Raising.
His research investigates the connection with Computer security and areas like Control which intersect with concerns in Management science.
His most cited work include:
- Llull and Copeland voting computationally resist bribery and constructive control (216 citations)
- Anyone but him: The complexity of precluding an alternative (214 citations)
- How hard is bribery in elections (209 citations)
What are the main themes of his work throughout his whole career to date?
His main research concerns Discrete mathematics, Combinatorics, Column, Polynomial hierarchy and Time complexity.
As part of one scientific family, Lane A. Hemaspaandra deals mainly with the area of Discrete mathematics, narrowing it down to issues related to the Computational complexity theory, and often Artificial intelligence and Computation.
His Combinatorics study incorporates themes from Reduction, Polynomial and Nondeterministic algorithm.
His work on Boolean hierarchy is typically connected to Collapse and Hierarchy as part of general Polynomial hierarchy study, connecting several disciplines of science.
Lane A. Hemaspaandra frequently studies issues relating to Control and Time complexity.
In his research, Pairwise comparison is intimately related to Voting, which falls under the overarching field of Control.
He most often published in these fields:
- Discrete mathematics (40.05%)
- Combinatorics (28.38%)
- Column (17.77%)
What were the highlights of his more recent work (between 2012-2021)?
- Column (17.77%)
- Control (10.34%)
- Discrete mathematics (40.05%)
In recent papers he was focusing on the following fields of study:
Lane A. Hemaspaandra mostly deals with Column, Control, Discrete mathematics, Combinatorics and Theoretical computer science.
His Control research incorporates elements of Time complexity, Computational social choice, Voting and Outcome.
His work in Voting covers topics such as Mathematical optimization which are related to areas like Polynomial hierarchy.
His Discrete mathematics research is mostly focused on the topic Natural number.
Lane A. Hemaspaandra has included themes like Ranking and Action in his Combinatorics study.
His Computational complexity theory research focuses on Online algorithm and how it relates to Artificial intelligence.
Between 2012 and 2021, his most popular works were:
- The complexity of manipulative attacks in nearly single-peaked electorates (66 citations)
- Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates (43 citations)
- Search versus Decision for Election Manipulation Problems (28 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Programming language
- Algebra
Lane A. Hemaspaandra focuses on Control, Computational social choice, Outcome, Theoretical computer science and Time complexity.
Matching and Polynomial hierarchy is closely connected to Mathematical optimization in his research, which is encompassed under the umbrella topic of Control.
His Computational social choice research is multidisciplinary, relying on both Computational complexity theory, Mathematical economics, Artificial intelligence and Turing machine.
His Outcome study deals with Weighted voting intersecting with Cardinal voting systems and Control.
His Time complexity study focuses on Algorithm and Discrete mathematics.
The study incorporates disciplines such as Hash function, Ranking and Core in addition to Discrete mathematics.
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.
