2026 Lane A. Hemaspaandra: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	43	8002	7775	3442	3313	339	7579

Research.com Recognitions

2007 - ACM Distinguished Member

Overview

Lane A. Hemaspaandra is affiliated with the University of Rochester in the United States and has contributed extensively to computer science research, particularly in computational theory and related fields. Their academic work spans a range of subfields including computational theory and mathematics, artificial intelligence, economics and econometrics, political science and international relations, as well as electrical and electronic engineering.

Their research covers multiple topics such as complexity and algorithms in graphs, internet traffic analysis and secure e-voting, computability, logic, and AI algorithms, game theory and voting systems, electoral systems and political participation, coding theory and cryptography, and machine learning and algorithms.

Among the recent papers authored or co-authored by Lane A. Hemaspaandra are:

Control in the presence of manipulators: cooperative and competitive cases, 2020, published in Autonomous Agents and Multi-Agent Systems
Search versus Decision for Election Manipulation Problems, 2020, published in ACM Transactions on Computation Theory
Polynomial-Time Multi-Selectivity, 2020, published in Zenodo (CERN European Organization for Nuclear Research)
The opacity of backbones, 2021, published in Information and Computation
Existence versus exploitation: the opacity of backdoors and backbones, 2021, published in Progress in Artificial Intelligence

Lane A. Hemaspaandra has collaborated frequently with several co-authors, including Edith Hemaspaandra, David E. Narváez, Benjamin Carleton, Michael C. Chavrimootoo, and Conor Taliancich.

The scholar has published repeatedly in notable venues such as ACM SIGACT News, arXiv (Cornell University), Autonomous Agents and Multi-Agent Systems, ACM Transactions on Computation Theory, and the Journal of Computer and System Sciences.

In recognition of their contributions to the field, Lane A. Hemaspaandra received the ACM Distinguished Member award in 2007.

Best Publications

How hard is bribery in elections

Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra

339
Citations
Using simulated annealing to design good codes

A.E. Gamal;L. Hemachandra;I. Shperling;V. Wei

284
Citations
Anyone but him: The complexity of precluding an alternative

Edith Hemaspaandra;Lane A. Hemaspaandra;Jörg Rothe

278
Citations
The Boolean hierarchy I: structural properties

Jin-Yi Cai;Thomas Gundermann;Juris Hartmanis;Lane A. Hemachandra

264
Citations
Llull and Copeland voting computationally resist bribery and constructive control

Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra;Jörg Rothe

256
Citations
The Complexity Theory Companion

Lane A. Hemaspaandra;Mitsunori Ogihara

250
Citations
Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP

Edith Hemaspaandra;Lane A. Hemaspaandra;Jörg Rothe

246
Citations
Using complexity to protect elections

Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra

209
Citations
Complexity theory retrospective II

Lane A. Hemaspaandra;Alan L. Selman

203
Citations
Multimode control attacks on elections

Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra

172
Citations
The shield that never was: Societies with single-peaked preferences are more open to manipulation and control

Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra;Jörg Rothe

169
Citations
Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates

Felix Brandt;Markus Brill;Edith Hemaspaandra;Lane A. Hemaspaandra

168
Citations
Dichotomy for voting systems

Edith Hemaspaandra;Lane A. Hemaspaandra

151
Citations
The Boolean hierarchy II: applications

J.-Y. Cai;T. Gundermann;G. Wechsung;J. Hartmanis

148
Citations
A Richer Understanding of the Complexity of Election Systems

Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra;Joerg Rothe

134
Citations
Threshold Computation and Cryptographic Security

Yenjo Han;Lane A. Hemaspaandra;Thomas Thierauf

121
Citations
The satanic notations: counting classes beyond #P and other definitional adventures

Lane A. Hemaspaandra;Heribert Vollmer

119
Citations
The complexity of bribery in elections

Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra

112
Citations
The complexity of manipulative attacks in nearly single-peaked electorates

Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra

107
Citations
The Boolean Hierarchy: Hardware over NP

Jin-yi Cai;Lane A. Hemachandra

103
Citations

Frequent Co-Authors

Edith Hemaspaandra Rochester Institute of Technology

Jörg Rothe Heinrich Heine University Düsseldorf

Piotr Faliszewski AGH University of Science and Technology

Mitsunori Ogihara University of Miami

Osamu Watanabe Tokyo Institute of Technology

Alan L. Selman University at Buffalo, State University of New York

Jin-Yi Cai University of Wisconsin–Madison

Felix Brandt Technical University of Munich

Mohammed J. Zaki Rensselaer Polytechnic Institute

Vincent Conitzer Carnegie Mellon University

External Links

Personal website of Lane A. Hemaspaandra Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA also opens doors to a variety of related online degrees and career pathways. Many students choose to expand their skillsets into areas that complement technology, such as data analysis, finance, or management. For instance, an online masters for data science can give tech professionals the cutting-edge skills needed for big data roles and artificial intelligence careers.

If your interests lean toward business, online accounting classes provide flexibility to develop financial expertise while still working or studying Computer Science. Those drawn to the intersection of law and technology may also find criminal justice studies valuable. Understanding criminal justice degree cost and online course offerings helps you plan for dual expertise in cybersecurity or digital forensics.

There are also rapid paths into tech-driven sectors like construction project management. A 2 year construction management degree online combines practical leadership skills with digital project technologies, ideal for Computer Science graduates aiming at tech-enabled industries. Exploring these options can help you design a truly versatile career.