Publications (48)
An Introduction to Query Order
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Query Order and the Polynomial Hierarchy
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
X THEN X: Manipulation of Same-System Runoff Elections
Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
Copeland Voting Fully Resists Constructive Control
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra +1
On the Power of Positive Turing Reductions
Edith Hemaspaandra
Isomorphic Implication
Michael Bauland, Edith Hemaspaandra
Control in the Presence of Manipulators: Cooperative and Competitive Cases
Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
Translating Equality Downwards
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Dichotomy for Voting Systems
Edith Hemaspaandra, Lane A. Hemaspaandra
The Complexity of Boolean Constraint Isomorphism
Elmar Böhler, Edith Hemaspaandra, Steffen Reith +1
Modeling Single-Peakedness for Votes with Ties
Zack Fitzsimmons, Edith Hemaspaandra
All Superlinear Inverse Schemes are coNP-Hard
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Multimode Control Attacks on Elections
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
The Complexity of Online Manipulation of Sequential Elections
Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe
Complexity of Manipulative Actions When Voting with Ties
Zack Fitzsimmons, Edith Hemaspaandra
On the Complexity of Elementary Modal Logics
Edith Hemaspaandra, Henning Schnoor
The Complexity of Kings
Edith Hemaspaandra, Lane A. Hemaspaandra, Osamu Watanabe
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe
How Hard Is Bribery in Elections?
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
More Natural Models of Electoral Control by Partition
Gabor Erdelyi, Edith Hemaspaandra, Lane A. Hemaspaandra
Complexity of Cycle Length Modularity Problems in Graphs
Edith Hemaspaandra, Holger Spakowski, Mayur Thakur
Search versus Decision for Election Manipulation Problems
Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton
A Downward Collapse within the Polynomial Hierarchy
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Complexity Results in Graph Reconstruction
Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski +1
Almost-Everywhere Superiority for Quantum Computing
Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand
R_{1-tt}^{SN}(NP) Distinguishes Robust Many-One and Turing Completeness
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Llull and Copeland Voting Computationally Resist Bribery and Control
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra +1
Dichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas
Edith Hemaspaandra
The Complexity of Online Manipulation of Sequential Elections
Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe
A Control Dichotomy for Pure Scoring Rules
Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor
The Complexity of Poor Man's Logic
Edith Hemaspaandra
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction
Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski +1
The Complexity of Controlling Candidate-Sequential Elections
Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe
Minimization for Generalized Boolean Formulas
Edith Hemaspaandra, Henning Schnoor
Very Hard Electoral Control Problems
Zack Fitzsimmons, Edith Hemaspaandra, Alexander Hoover +1
What's Up with Downward Collapse: Using the Easy-Hard Technique to Link Boolean and Polynomial Hierarchy Collapses
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
The Complexity of Online Voter Control in Sequential Elections
Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe
A Richer Understanding of the Complexity of Election Systems
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra +1
Using the No-Search Easy-Hard Technique for Downward Collapse
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Downward Collapse from a Weaker Hypothesis
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Generalized Modal Satisfiability
Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
A Simplest Undecidable Modal Logic
Edith Hemaspaandra, Henning Schnoor
Raising NP Lower Bounds to Parallel NP Lower Bounds
Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe
Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP
Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe
Complexity Dichotomies for Unweighted Scoring Rules
Edith Hemaspaandra, Henning Schnoor
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
Weighted Electoral Control
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP
Edith Hemaspaandra, Jörg Rothe, Holger Spakowski