


default search action
Lane A. Hemaspaandra
Lane A. Hemachandra
Person information
- affiliation: University of Rochester, New York, USA
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j213]Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles:
Separating and Collapsing Electoral Control Types. J. Artif. Intell. Res. 81: 71-116 (2024) - [j212]Lane A. Hemaspaandra
, Mandar Juvekar
, Arian Nadjimzadah
, Patrick A. Phillips
:
Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting. ACM Trans. Comput. Theory 16(4): 20:1-20:26 (2024) - 2023
- [j211]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 116. SIGACT News 54(1): 62 (2023) - [j210]Lane A. Hemaspaandra
:
SIGACT News Complexity Theory Column 117: Thirty Years of Complexity Theory (Columns). SIGACT News 54(1): 82-89 (2023) - [c105]Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles:
Separating and Collapsing Electoral Control Types. AAMAS 2023: 1743-1751 - [c104]Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles:
Search versus Search for Collapsing Electoral Control Types. AAMAS 2023: 2682-2684 - 2022
- [j209]Edith Hemaspaandra, Lane A. Hemaspaandra
, Jörg Rothe
:
The complexity of online bribery in sequential elections. J. Comput. Syst. Sci. 127: 66-90 (2022) - [j208]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 112. SIGACT News 53(1): 58 (2022) - [j207]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 113. SIGACT News 53(2): 39 (2022) - [j206]Lane A. Hemaspaandra:
SIGACT news complexity theory column 114. SIGACT News 53(3): 41-45 (2022) - [j205]Lane A. Hemaspaandra
:
SIGACT News Complexity Theory Column 115: Juris Hartmanis and Two Golden Rules. SIGACT News 53(4): 35-40 (2022) - [c103]Lane A. Hemaspaandra
, Mandar Juvekar
, Arian Nadjimzadah
, Patrick A. Phillips
:
Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting. MFCS 2022: 57:1-57:15 - [i88]Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles:
Separating and Collapsing Electoral Control Types. CoRR abs/2207.00710 (2022) - [i87]Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles:
Search versus Search for Collapsing Electoral Control Types. CoRR abs/2207.03049 (2022) - 2021
- [j204]Lane A. Hemaspaandra:
Thoughts on Alan Selman (1941-2021). Bull. EATCS 133 (2021) - [j203]Lane A. Hemaspaandra
, David E. Narváez:
The opacity of backbones. Inf. Comput. 281: 104772 (2021) - [j202]Jackson Abascal
, Lane A. Hemaspaandra
, Shir Maimon
, Daniel Rubery:
Closure and nonclosure properties of the classes of compressible and rankable sets. J. Comput. Syst. Sci. 120: 162-176 (2021) - [j201]Lane A. Hemaspaandra
, David E. Narváez
:
Existence versus exploitation: the opacity of backdoors and backbones. Prog. Artif. Intell. 10(3): 297-308 (2021) - [j200]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 108. SIGACT News 52(1): 41-46 (2021) - [j199]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 109. SIGACT News 52(2): 45 (2021) - [j198]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 110. SIGACT News 52(3): 37 (2021) - [j197]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 111. SIGACT News 52(4): 55 (2021) - [i86]Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah, Patrick A. Phillips:
Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting. CoRR abs/2109.14764 (2021) - 2020
- [j196]Zack Fitzsimmons
, Edith Hemaspaandra
, Lane A. Hemaspaandra
:
Control in the presence of manipulators: cooperative and competitive cases. Auton. Agents Multi Agent Syst. 34(2): 52 (2020) - [j195]Zack Fitzsimmons
, Edith Hemaspaandra
, Lane A. Hemaspaandra
:
Correction to: Control in the presence of manipulators: cooperative and competitive cases. Auton. Agents Multi Agent Syst. 34(2): 56 (2020) - [j194]Edith Hemaspaandra, Lane A. Hemaspaandra
, Holger Spakowski, Osamu Watanabe:
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. Comput. Complex. 29(2): 7 (2020) - [j193]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 104. SIGACT News 51(1): 37 (2020) - [j192]Lane A. Hemaspaandra
:
SIGACT News Complexity Theory Column 105. SIGACT News 51(2): 36-37 (2020) - [j191]Lane A. Hemaspaandra
:
SIGACT News Complexity Theory Column 106: Teaching Models, Computability, and Complexity in Time of COVID-19. SIGACT News 51(3): 55-58 (2020) - [j190]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 107. SIGACT News 51(4): 47 (2020) - [j189]Edith Hemaspaandra, Lane A. Hemaspaandra
, Curtis Menton:
Search versus Decision for Election Manipulation Problems. ACM Trans. Comput. Theory 12(1): 3:1-3:42 (2020) - [c102]Lane A. Hemaspaandra
:
The Power of Self-Reducibility: Selectivity, Information, and Approximation. Complexity and Approximation 2020: 19-47
2010 – 2019
- 2019
- [j188]Lane A. Hemaspaandra
, Daniel Rubery:
Recursion-theoretic ranking and compression. J. Comput. Syst. Sci. 101: 31-41 (2019) - [j187]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 100. SIGACT News 50(1): 35-37 (2019) - [j186]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 101. SIGACT News 50(2): 29-30 (2019) - [j185]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 102. SIGACT News 50(3): 51 (2019) - [j184]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 103. SIGACT News 50(4): 56 (2019) - [c101]Jackson Abascal, Lane A. Hemaspaandra
, Shir Maimon, Daniel Rubery:
Closure and Nonclosure Properties of the Compressible and Rankable Sets. LATA 2019: 177-189 - [c100]Lane A. Hemaspaandra
, David E. Narváez
:
Existence Versus Exploitation: The Opacity of Backdoors and Backbones Under a Weak Assumption. SOFSEM 2019: 247-259 - [c99]Edith Hemaspaandra, Lane A. Hemaspaandra
, Jörg Rothe:
The Complexity of Online Bribery in Sequential Elections (Extended Abstract). TARK 2019: 233-251 - [i85]Lane A. Hemaspaandra:
The Power of Self-Reducibility: Selectivity, Information, and Approximation. CoRR abs/1902.08299 (2019) - [i84]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Bribery in Sequential Elections. CoRR abs/1906.08308 (2019) - 2018
- [j183]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 97. SIGACT News 49(1): 54 (2018) - [j182]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 98. SIGACT News 49(2): 32 (2018) - [j181]Lane A. Hemaspaandra
:
SIGACT News Complexity Theory Column 99. SIGACT News 49(3): 48-50 (2018) - [j180]Lane A. Hemaspaandra
, Holger Spakowski:
Column: Team Diagonalization. SIGACT News 49(3): 51-61 (2018) - [c98]Lane A. Hemaspaandra
:
Computational Social Choice and Computational Complexity: BFFs? AAAI 2018: 7971-7977 - [c97]Lane A. Hemaspaandra
:
That Most Important Intersection. Adventures Between Lower Bounds and Higher Altitudes 2018: 568-589 - [c96]Edith Hemaspaandra, Lane A. Hemaspaandra
, Holger Spakowski, Osamu Watanabe:
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. MFCS 2018: 51:1-51:14 - [i83]Lane A. Hemaspaandra, Holger Spakowski:
Team Diagonalization. CoRR abs/1807.10983 (2018) - 2017
- [j179]Edith Hemaspaandra, Lane A. Hemaspaandra
, Jörg Rothe:
The complexity of online voter control in sequential elections. Auton. Agents Multi Agent Syst. 31(5): 1055-1076 (2017) - [j178]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 93. SIGACT News 48(1): 101 (2017) - [j177]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 94. SIGACT News 48(2): 40 (2017) - [j176]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 96. SIGACT News 48(4): 42 (2017) - [j175]Edith Hemaspaandra, Lane A. Hemaspaandra
, Jörg Rothe:
The complexity of controlling candidate-sequential elections. Theor. Comput. Sci. 678: 14-21 (2017) - [c95]Lane A. Hemaspaandra
, David E. Narváez:
The Opacity of Backbones. AAAI 2017: 3900-3906 - [i82]Lane A. Hemaspaandra, David E. Narváez:
The Opacity of Backbones and Backdoors Under a Weak Assumption. CoRR abs/1706.04582 (2017) - [i81]Lane A. Hemaspaandra:
Computational Social Choice and Computational Complexity: BFFs? CoRR abs/1710.10753 (2017) - [i80]Edith Hemaspaandra, Lane A. Hemaspaandra:
Credimus. CoRR abs/1711.00201 (2017) - [i79]Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe:
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. CoRR abs/1711.01250 (2017) - 2016
- [j174]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
:
Manipulation Complexity of Same-System Runoff Elections. Ann. Math. Artif. Intell. 77(3-4): 159-189 (2016) - [j173]Lane A. Hemaspaandra
, Rahman Lavaee, Curtis Menton:
Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control. Ann. Math. Artif. Intell. 77(3-4): 191-223 (2016) - [j172]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 90: Introduction to Complexity Theory Column 90. SIGACT News 47(1): 41 (2016) - [j171]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 91. SIGACT News 47(2): 65 (2016) - [j170]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 93. SIGACT News 47(3): 44-45 (2016) - [p2]Edith Hemaspaandra, Lane A. Hemaspaandra
, Jörg Rothe:
The Complexity of Manipulative Actions in Single-Peaked Societies. Economics and Computation 2016: 327-360 - [r2]Ioannis Caragiannis, Edith Hemaspaandra, Lane A. Hemaspaandra
:
Dodgson's Rule and Young's Rule. Handbook of Computational Social Choice 2016: 103-126 - [i78]Lane A. Hemaspaandra, David E. Narváez:
The Opacity of Backbones. CoRR abs/1606.03634 (2016) - [i77]Lane A. Hemaspaandra, Daniel Rubery:
Recursion-Theoretic Ranking and Compression. CoRR abs/1610.01185 (2016) - [i76]Lane A. Hemaspaandra, Daniel Rubery:
More on Compression and Ranking. CoRR abs/1611.01696 (2016) - 2015
- [j169]Piotr Faliszewski
, Edith Hemaspaandra, Lane A. Hemaspaandra
:
Weighted Electoral Control. J. Artif. Intell. Res. 52: 507-542 (2015) - [j168]Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra
:
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. J. Artif. Intell. Res. 53: 439-496 (2015) - [j167]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 85. SIGACT News 46(1): 39 (2015) - [j166]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 86: Introduction to Complexity Theory Column 86. SIGACT News 46(2): 40 (2015) - [j165]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 87: Introduction to Complexity Theory Column 87. SIGACT News 46(3): 36 (2015) - [j164]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 88/89: Introduction to Complexity Theory Column 88/89. SIGACT News 46(4): 31 (2015) - [c94]Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra
:
More Natural Models of Electoral Control by Partition. ADT 2015: 396-413 - [c93]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract). IJCAI 2015: 4178-4182 - 2014
- [j163]Piotr Faliszewski
, Edith Hemaspaandra, Lane A. Hemaspaandra
:
The complexity of manipulative attacks in nearly single-peaked electorates. Artif. Intell. 207: 69-99 (2014) - [j162]Edith Hemaspaandra, Lane A. Hemaspaandra
, Jörg Rothe:
The complexity of online manipulation of sequential elections. J. Comput. Syst. Sci. 80(4): 697-710 (2014) - [j161]Lane A. Hemaspaandra:
SIGACT news complexity theory column 81. SIGACT News 45(1): 47 (2014) - [j160]Lane A. Hemaspaandra:
SIGACT news complexity theory column 82. SIGACT News 45(2): 46 (2014) - [j159]Lane A. Hemaspaandra
:
SIGACT news complexity theory column 82. SIGACT News 45(3): 53 (2014) - [j158]Lane A. Hemaspaandra
:
Beautiful structures: an appreciation of the contributions of Alan Selman. SIGACT News 45(3): 54-70 (2014) - [j157]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 84. SIGACT News 45(4): 58 (2014) - [c92]Edith Hemaspaandra, Lane A. Hemaspaandra
, Henning Schnoor:
A Control Dichotomy for Pure Scoring Rules. AAAI 2014: 712-720 - [c91]Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra:
Bribery and voter control under voting-rule uncertainty. AAMAS 2014: 61-68 - [i75]Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor:
A Control Dichotomy for Pure Scoring Rules. CoRR abs/1404.4560 (2014) - [i74]Lane A. Hemaspaandra:
Beautiful Structures: An Appreciation of the Contributions of Alan Selman. CoRR abs/1406.4106 (2014) - [i73]Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra:
More Natural Models of Electoral Control by Partition. CoRR abs/1410.2652 (2014) - 2013
- [j156]Tatiana Gvozdeva, Lane A. Hemaspaandra
, Arkadii M. Slinko
:
Three hierarchies of simple games parameterized by "resource" parameters. Int. J. Game Theory 42(1): 1-17 (2013) - [j155]Lane A. Hemaspaandra:
SIGACT news complexity theory column 77. SIGACT News 44(1): 49 (2013) - [j154]Lane A. Hemaspaandra:
SIGACT news complexity theory column 78. SIGACT News 44(2): 45-46 (2013) - [j153]Lane A. Hemaspaandra:
SIGACT news complexity theory column 80. SIGACT News 44(4): 52 (2013) - [c90]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Weighted electoral control. AAMAS 2013: 367-374 - [c89]Lane A. Hemaspaandra, Rahman Lavaee, Curtis Menton:
Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control. AAMAS 2013: 1345-1346 - [c88]Piotr Faliszewski
, Edith Hemaspaandra, Lane A. Hemaspaandra
, Jörg Rothe:
A Richer Understanding of the Complexity of Election Systems. Fundamental Problems in Computing 2013: 375-406 - [c87]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
Control in the Presence of Manipulators: Cooperative and Competitive Cases. IJCAI 2013: 113-119 - [c86]Edith Hemaspaandra, Lane A. Hemaspaandra
, Curtis Menton:
Search versus Decision for Election Manipulation Problems. STACS 2013: 377-388 - [c85]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Manipulation of Sequential Elections. TARK 2013 - [i72]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
X THEN X: Manipulation of Same-System Runoff Elections. CoRR abs/1301.6118 (2013) - [i71]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Weighted Electoral Control. CoRR abs/1305.0943 (2013) - [i70]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
Control in the Presence of Manipulators: Cooperative and Competitive Cases. CoRR abs/1308.0544 (2013) - [i69]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Manipulation of Sequential Elections. CoRR abs/1310.6997 (2013) - 2012
- [j152]Lane A. Hemaspaandra:
SIGACT news complexity theory column 73. SIGACT News 43(1): 61 (2012) - [j151]Lane A. Hemaspaandra:
SIGACT news complexity theory column 74. SIGACT News 43(2): 51-52 (2012) - [j150]Lane A. Hemaspaandra:
SIGACT news complexity theory column 75. SIGACT News 43(3): 65-66 (2012) - [j149]Lane A. Hemaspaandra
, Ryan Williams
:
SIGACT News Complexity Theory Column 76: an atypical survey of typical-case heuristic algorithms. SIGACT News 43(4): 70-89 (2012) - [c84]Edith Hemaspaandra, Lane A. Hemaspaandra
, Jörg Rothe:
Online Voter Control in Sequential Elections. ECAI 2012: 396-401 - [c83]Edith Hemaspaandra, Lane A. Hemaspaandra
, Jörg Rothe:
Controlling Candidate-Sequential Elections. ECAI 2012: 905-906 - [i68]Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton:
Search versus Decision for Election Manipulation Problems. CoRR abs/1202.6641 (2012) - [i67]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Controlling Candidate-Sequential Elections. CoRR abs/1202.6649 (2012) - [i66]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Manipulation of Sequential Elections. CoRR abs/1202.6655 (2012) - [i65]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Online Voter Control in Sequential Elections. CoRR abs/1203.0411 (2012) - [i64]Lane A. Hemaspaandra, Rahman Lavaee, Curtis Menton:
Schulze and Ranked-Pairs Voting are Fixed-Parameter Tractable to Bribe, Manipulate, and Control. CoRR abs/1210.6963 (2012) - [i63]Lane A. Hemaspaandra, Ryan Williams:
An Atypical Survey of Typical-Case Heuristic Algorithms. CoRR abs/1210.8099 (2012) - 2011
- [j148]Piotr Faliszewski
, Edith Hemaspaandra, Lane A. Hemaspaandra
, Jörg Rothe:
The shield that never was: Societies with single-peaked preferences are more open to manipulation and control. Inf. Comput. 209(2): 89-107 (2011) - [j147]Piotr Faliszewski
, Edith Hemaspaandra, Lane A. Hemaspaandra
:
Multimode Control Attacks on Elections. J. Artif. Intell. Res. 40: 305-351 (2011) - [j146]Lane A. Hemaspaandra:
SIGACT news complexity theory column 69. SIGACT News 42(1): 58 (2011) - [j145]Lane A. Hemaspaandra:
SIGACT news complexity theory column 70. SIGACT News 42(2): 51 (2011) - [j144]Lane A. Hemaspaandra:
SIGACT news complexity theory column 71. SIGACT News 42(3): 53-54 (2011) - [j143]Lane A. Hemaspaandra:
SIGACT news complexity theory column 72. SIGACT News 42(4): 53 (2011)