Lane A. Hemaspaandra (premarriage name: Hemachandra)

Lane A. Hemaspaandra (premarriage name: Hemachandra)

University of Rochester

H-index: 46

North America-United States

About Lane A. Hemaspaandra (premarriage name: Hemachandra)

Lane A. Hemaspaandra (premarriage name: Hemachandra), With an exceptional h-index of 46 and a recent h-index of 18 (since 2020), a distinguished researcher at University of Rochester, specializes in the field of Computational Social Choice, Computational Complexity Theory, Algorithms.

His recent articles reflect a diverse array of research interests and contributions to the field:

SIGACT News Complexity Theory Column 117: Thirty Years of Complexity Theory (Columns)

SIGACT News Complexity Theory Column 116

Separating and collapsing electoral control types

Search versus search for collapsing electoral control types

SIGACT News Complexity Theory Column 113

SIGACT News Complexity Theory Column 112

SIGACT News Complexity Theory Column 111

SIGACT News Complexity Theory Column 115: Juris Hartmanis and Two Golden Rules

Lane A. Hemaspaandra (premarriage name: Hemachandra) Information

University

Position

Professor of Computer Science

Citations(all)

8490

Citations(since 2020)

1203

Cited By

7889

hIndex(all)

46

hIndex(since 2020)

18

i10Index(all)

146

i10Index(since 2020)

37

Email

University Profile Page

University of Rochester

Google Scholar

View Google Scholar Profile

Lane A. Hemaspaandra (premarriage name: Hemachandra) Skills & Research Interests

Computational Social Choice

Computational Complexity Theory

Algorithms

Top articles of Lane A. Hemaspaandra (premarriage name: Hemachandra)

Title

Journal

Author(s)

Publication Date

SIGACT News Complexity Theory Column 117: Thirty Years of Complexity Theory (Columns)

ACM SIGACT News

Lane A Hemaspaandra

2023/3/1

SIGACT News Complexity Theory Column 116

ACM SIGACT News

Lane A Hemaspaandra

2023/3/1

Separating and collapsing electoral control types

Benjamin Carleton

Michael C Chavrimootoo

Lane A Hemaspaandra

David E Narváez

Conor Taliancich

...

2023/5/30

Search versus search for collapsing electoral control types

Benjamin Carleton

Michael C Chavrimootoo

Lane A Hemaspaandra

David E Narváez

Conor Taliancich

...

2023/5/30

SIGACT News Complexity Theory Column 113

ACM SIGACT News

Lane A Hemaspaandra

2022/6/21

SIGACT News Complexity Theory Column 112

ACM SIGACT News

Lane A Hemaspaandra

2022/4/18

SIGACT News Complexity Theory Column 111

ACM SIGACT News

Lane A Hemaspaandra

2022/1/3

SIGACT News Complexity Theory Column 115: Juris Hartmanis and Two Golden Rules

ACM SIGACT News

Lane A Hemaspaandra

2022/12/19

SIGACT news complexity theory column 114

ACM SIGACT News

Lane A Hemaspaandra

2022/8/30

The complexity of online bribery in sequential elections

Journal of Computer and System Sciences

Edith Hemaspaandra

Lane A Hemaspaandra

Jörg Rothe

2022/8/1

Gaps, ambiguity, and establishing complexity-class containments via iterative constant-setting

arXiv preprint arXiv:2109.14764

Lane A Hemaspaandra

Mandar Juvekar

Arian Nadjimzadah

Patrick A Phillips

2021/9/29

Closure and nonclosure properties of the classes of compressible and rankable sets

Journal of Computer and System Sciences

Jackson Abascal

Lane A Hemaspaandra

Shir Maimon

Daniel Rubery

2021/9/1

Existence versus exploitation: the opacity of backdoors and backbones

Progress in Artificial Intelligence

Lane A Hemaspaandra

David E Narváez

2021/9

SIGACT News Complexity Theory Column 109.

SIGACT News

Lane A Hemaspaandra

2021/6/17

The opacity of backbones

Information and Computation

Lane A Hemaspaandra

David E Narváez

2021/12/1

SIGACT News Complexity Theory Column 108

ACM SIGACT News

Lane A Hemaspaandra

2021/3/16

SIGACT News Complexity Theory Column 110

ACM SIGACT News

Lane A Hemaspaandra

2021/10/27

The Robustness of LWPP and WPP, with an Application to Graph Reconstruction

computational complexity

Edith Hemaspaandra

Lane A Hemaspaandra

Holger Spakowski

Osamu Watanabe

2020/12

The Power of Self-Reducibility: Selectivity, Information, and Approximation

Complexity and Approximation: In Memory of Ker-I Ko

Lane A Hemaspaandra

2020

Control in the presence of manipulators: cooperative and competitive cases

Autonomous Agents and Multi-Agent Systems

Zack Fitzsimmons

Edith Hemaspaandra

Lane A Hemaspaandra

2020/10

See List of Professors in Lane A. Hemaspaandra (premarriage name: Hemachandra) University(University of Rochester)

Co-Authors

H-index: 90
Abbas El Gamal

Abbas El Gamal

Stanford University

H-index: 56
Mitsunori Ogihara

Mitsunori Ogihara

University of Miami

H-index: 49
Jin-Yi Cai

Jin-Yi Cai

University of Wisconsin-Madison

H-index: 46
Osamu Watanabe

Osamu Watanabe

Tokyo Institute of Technology

H-index: 46
Piotr Faliszewski

Piotr Faliszewski

Akademia Górniczo-Hutnicza

H-index: 44
Eric Allender

Eric Allender

Rutgers, The State University of New Jersey

academic-engine