| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Online Voter Control in Sequential Elections  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton |
Search versus Decision for Election Manipulation Problems |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Controlling Candidate-Sequential Elections |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
The Complexity of Online Manipulation of Sequential Elections |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Henning Schnoor |
A Simplest Undecidable Modal Logic |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Henning Schnoor |
Minimization for Generalized Boolean Formulas |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra |
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra |
Multimode Control Attacks on Elections. |
J. Artif. Intell. Res. (JAIR) |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Henning Schnoor |
Minimization for Generalized Boolean Formulas. |
IJCAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Henning Schnoor |
A Universally Defined Undecidable Unimodal Logic. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra |
The complexity of manipulative attacks in nearly single-peaked electorates. |
TARK |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe |
On the complexity of kings. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra |
Using complexity to protect elections. |
Commun. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra |
Multimode Control Attacks on Elections |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor |
Generalized modal satisfiability. |
J. Comput. Syst. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor |
Manipulation of copeland elections. |
AAMAS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra |
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. |
AAAI |
2010 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. |
Math. Log. Q. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. |
J. Artif. Intell. Res. (JAIR) |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra |
How Hard Is Bribery in Elections? |
J. Artif. Intell. Res. (JAIR) |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Bauland, Edith Hemaspaandra |
Isomorphic Implication. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Computational complexity, Constraints, Propositional logic, Logic in computer science, Isomorphism problem |
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra |
Multimode Control Attacks on Elections. |
IJCAI |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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. |
TARK |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Llull and Copeland Voting Computationally Resist Bribery and Control |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Henning Schnoor |
On the Complexity of Elementary Modal Logics |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor |
Generalized Modal Satisfiability |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Copeland Voting Fully Resists Constructive Control. |
AAIM |
2008 |
DBLP DOI BibTeX RDF |
Computational social choice theory, multiagent systems, preference aggregation |
| 1 | Edith Hemaspaandra, Henning Schnoor |
On the Complexity of Elementary Modal Logics. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor |
Copeland voting: ties matter. |
AAMAS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor |
Approximability of Manipulating Elections. |
AAAI |
2008 |
DBLP BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Copeland Voting Fully Resists Constructive Control |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Anyone but him: The complexity of precluding an alternative. |
Artif. Intell. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi |
Complexity results in graph reconstruction. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra |
Dichotomy for voting systems. |
J. Comput. Syst. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. |
IJCAI |
2007 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe |
On the Complexity of Kings. |
FCT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Llull and Copeland Voting Broadly Resist Bribery and Control. |
AAAI |
2007 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Jörg Rothe, Holger Spakowski |
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. |
ITA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra |
How Hard Is Bribery in Elections? |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
A Richer Understanding of the Complexity of Election Systems |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor |
Generalized Modal Satisfiability. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
computational complexity, modal logic |
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra |
The Complexity of Bribery in Elections. |
AAAI |
2006 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Holger Spakowski, Jörg Vogel |
The complexity of Kemeny elections. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
All superlinear inverse schemes are coNP-hard. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Anyone but Him: The Complexity of Precluding an Alternative |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Osamu Watanabe |
The Complexity of Kings |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra |
Dichotomy for Voting Systems |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
Extending Downward Collapse from 1-versus-2 Queries to m-versus-m + 1 Queries. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Bauland, Edith Hemaspaandra |
Isomorphic Implication. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Anyone but Him: The Complexity of Precluding an Alternative. |
AAAI |
2005 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra |
Dichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
All Superlinear Inverse Schemes are coNP-Hard |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi |
Complexity Results in Graph Reconstruction |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Michael Bauland, Edith Hemaspaandra |
Isomorphic Implication |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
All Superlinear Inverse Schemes Are coNP-Hard. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi |
Complexity Results in Graph Reconstruction. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Holger Spakowski, Mayur Thakur |
Complexity of Cycle Length Modularity Problems in Graphs. |
LATIN |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer |
The Complexity of Boolean Constraint Isomorphism. |
STACS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer |
The Complexity of Boolean Constraint Isomorphism |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Holger Spakowski, Mayur Thakur |
Complexity of Cycle Length Modularity Problems in Graphs |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand |
Almost-Everywhere Superiority for Quantum Polynomial Time. |
Inf. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer |
Equivalence and Isomorphism for Boolean Constraint Satisfaction |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Gerd Wechsung |
The Minimization Problem for Boolean Formulas. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Jörg Rothe, Holger Spakowski |
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. |
WG |
2002 |
DBLP DOI BibTeX RDF |
minimum vertex cover heuristics, parallel access to NP, Computational complexity, approximation, completeness |
| 1 | Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer |
Equivalence and Isomorphism for Boolean Constraint Satisfaction. |
CSL |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra |
The Complexity of Poor Man's Logic. |
J. Log. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Jörg Rothe, Holger Spakowski |
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP |
CoRR |
2001 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
Using the No-Search Easy-Hard Technique for Downward Collapse |
CoRR |
2001 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra |
Computational Politics: Electoral Systems. |
MFCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra |
The Complexity of Poor Man's Logic. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra |
Modal Satisfiability Is in Deterministic Linear Space. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra |
On the Power of Positive Turing Reductions. |
J. UCS |
1999 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
An Introduction to Query Order |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand |
Almost-Everywhere Superiority for Quantum Computing |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
Query Order and the Polynomial Hierarchy |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
Translating Equality Downwards |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
What's Up with Downward Collapse: Using the Easy-Hard Technique to Link Boolean and Polynomial Hierarchy Collapses |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra |
On the Power of Positive Turing Reductions |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra |
The Complexity of Poor Man's Logic |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
A Downward Collapse within the Polynomial Hierarchy |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
R1-ttSN(NP) Distinguishes Robust Many-One and Turing Completeness |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Raising NP Lower Bounds to Parallel NP Lower Bounds |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Jörg Rothe |
Recognizing when Greed can Approximate Maximum Independent Sets is Complete for Parallel Access to NP. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
Query Order and the Polynomial Hierarchy. |
J. UCS |
1998 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
Downward Collapse from a Weaker Hypothesis |
CoRR |
1998 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
RS N1-tt (NP) Distinguishes Robust Many-One and Turing Completeness. |
Theory Comput. Syst. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
What's up with downward collapse: using the easy-hard technique to link Boolean and polynomial hierarchy collapses. |
SIGACT News |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
A Downward Collapse within the Polynomial Hierarchy. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP. |
J. ACM |
1997 |
DBLP DOI BibTeX RDF |
Lewis Carroll, election systems, majority rule, completeness |
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
An Introduction to Query Order. |
Bulletin of the EATCS |
1997 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Raising NP lower bounds to parallel NP lower bounds. |
SIGACT News |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP. |
ICALP |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
A Downward Translation in the Polynomial Hierarchy. |
STACS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
Query Order in the Polynomial Hierarchy. |
FCT |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Gerd Wechsung |
The Minimization Problem for Boolean Formulas. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
computational complexity, minimization, propositional logic, Boolean formulas, polynomial hierarchy |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")