Edith Hemaspaandra

According to our database1, Edith Hemaspaandra authored at least 103 papers between 1989 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Search versus Decision for Election Manipulation Problems.
ACM Trans. Comput. Theory, 2020

Prototype of an Automated Feedback Tool for Intro CS Theory.
Proceedings of the SIGCSE '20: The 51st ACM Technical Symposium on Computer Science Education, 2020

2019
Complexity of Stability.
CoRR, 2019

The Complexity of Online Bribery in Sequential Elections (Extended Abstract).
Proceedings of the Proceedings Seventeenth Conference on Theoretical Aspects of Rationality and Knowledge, 2019

The Complexity of Online Bribery in Sequential Elections.
CoRR, 2019

High-multiplicity election problems.
Auton. Agents Multi Agent Syst., 2019

Finding Optimal Solutions With Neighborly Help.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Very Hard Electoral Control Problems.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Election Score Can Be Harder Than Winner.
CoRR, 2018

The Robustness of LWPP and WPP, with an Application to Graph Reconstruction.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
The complexity of controlling candidate-sequential elections.
Theor. Comput. Sci., 2017

Credimus.
CoRR, 2017

The complexity of online voter control in sequential elections.
Auton. Agents Multi Agent Syst., 2017

The Complexity of Succinct Elections.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Dodgson's Rule and Young's Rule.
Proceedings of the Handbook of Computational Social Choice, 2016

Complexity Dichotomies for Unweighted Scoring Rules.
CoRR, 2016

Manipulation Complexity of Same-System Runoff Elections.
Ann. Math. Artif. Intell., 2016

Modeling Single-Peakedness for Votes with Ties.
Proceedings of the STAIRS 2016, 2016

Dichotomy for Pure Scoring Rules Under Manipulative Electoral Actions.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

The Complexity of Manipulative Actions in Single-Peaked Societies.
Proceedings of the Economics and Computation, 2016

2015
Weighted Electoral Control.
J. Artif. Intell. Res., 2015

Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.
J. Artif. Intell. Res., 2015

The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract).
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Complexity of Manipulative Actions When Voting with Ties.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

More Natural Models of Electoral Control by Partition.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

2014
The complexity of online manipulation of sequential elections.
J. Comput. Syst. Sci., 2014

The complexity of manipulative attacks in nearly single-peaked electorates.
Artif. Intell., 2014

Bribery and voter control under voting-rule uncertainty.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

A Control Dichotomy for Pure Scoring Rules.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
X THEN X: Manipulation of Same-System Runoff Elections
CoRR, 2013

Control in the Presence of Manipulators: Cooperative and Competitive Cases.
Proceedings of the IJCAI 2013, 2013

A Richer Understanding of the Complexity of Election Systems.
Proceedings of the Fundamental Problems in Computing, 2013

2012
Controlling Candidate-Sequential Elections.
Proceedings of the ECAI 2012, 2012

Online Voter Control in Sequential Elections.
Proceedings of the ECAI 2012, 2012

Weighted Manipulation for Four-Candidate Llull Is Easy.
Proceedings of the ECAI 2012, 2012

2011
Multimode Control Attacks on Elections.
J. Artif. Intell. Res., 2011

The shield that never was: Societies with single-peaked preferences are more open to manipulation and control.
Inf. Comput., 2011

A Simplest Undecidable Modal Logic
CoRR, 2011

A Universally Defined Undecidable Unimodal Logic.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Minimization for Generalized Boolean Formulas.
Proceedings of the IJCAI 2011, 2011

2010
On the complexity of kings.
Theor. Comput. Sci., 2010

Generalized modal satisfiability.
J. Comput. Syst. Sci., 2010

Using complexity to protect elections.
Commun. ACM, 2010

Manipulation of copeland elections.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

2009
Isomorphic Implication.
Theory Comput. Syst., 2009

Hybrid Elections Broaden Complexity-Theoretic Resistance to Control.
Math. Log. Q., 2009

Llull and Copeland Voting Computationally Resist Bribery and Constructive Control.
J. Artif. Intell. Res., 2009

How Hard Is Bribery in Elections?
J. Artif. Intell. Res., 2009

2008
Llull and Copeland Voting Computationally Resist Bribery and Control
CoRR, 2008

On the Complexity of Elementary Modal Logics.
Proceedings of the STACS 2008, 2008

Copeland voting: ties matter.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

Copeland Voting Fully Resists Constructive Control.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

Approximability of Manipulating Elections.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Dichotomy for voting systems.
J. Comput. Syst. Sci., 2007

Complexity results in graph reconstruction.
Discret. Appl. Math., 2007

Anyone but him: The complexity of precluding an alternative.
Artif. Intell., 2007

Llull and Copeland Voting Broadly Resist Bribery and Control.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP.
RAIRO Theor. Informatics Appl., 2006

Generalized Modal Satisfiability.
Proceedings of the STACS 2006, 2006

The Complexity of Bribery in Elections.
Proceedings of the Proceedings, 2006

2005
The complexity of Kemeny elections.
Theor. Comput. Sci., 2005

All superlinear inverse schemes are coNP-hard.
Theor. Comput. Sci., 2005

Extending Downward Collapse from 1-versus-2 Queries to m-versus-m + 1 Queries.
SIAM J. Comput., 2005

The Complexity of Kings
CoRR, 2005

2004
Dichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas
CoRR, 2004

The Complexity of Boolean Constraint Isomorphism.
Proceedings of the STACS 2004, 2004

Complexity of Cycle Length Modularity Problems in Graphs.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2002
The Minimization Problem for Boolean Formulas.
SIAM J. Comput., 2002

Almost-Everywhere Superiority for Quantum Polynomial Time.
Inf. Comput., 2002

Equivalence and Isomorphism for Boolean Constraint Satisfaction.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001
The Complexity of Poor Man's Logic.
J. Log. Comput., 2001

Using the No-Search Easy-Hard Technique for Downward Collapse
CoRR, 2001

2000
Computational Politics: Electoral Systems.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Modal Satisfiability Is in Deterministic Linear Space.
Proceedings of the Computer Science Logic, 2000

1999
On the Power of Positive Turing Reductions.
J. UCS, 1999

Almost-Everywhere Superiority for Quantum Computing
CoRR, 1999

Translating Equality Downwards
CoRR, 1999

R<sub>1-tt</sub><sup>SN</sup>(NP) Distinguishes Robust Many-One and Turing Completeness
CoRR, 1999

Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries.
Proceedings of the STACS 99, 1999

1998
What's up with downward collapse: using the easy-hard technique to link Boolean and polynomial hierarchy collapses.
SIGACT News, 1998

A Downward Collapse within the Polynomial Hierarchy.
SIAM J. Comput., 1998

R<sup><i>S N</i></sup><sub>1-tt</sub> (NP) Distinguishes Robust Many-One and Turing Completeness.
Theory Comput. Syst., 1998

Query Order and the Polynomial Hierarchy.
J. UCS, 1998

Recognizing when Greed can Approximate Maximum Independent Sets is Complete for Parallel Access to NP.
Inf. Process. Lett., 1998

Downward Collapse from a Weaker Hypothesis
CoRR, 1998

1997
Raising NP lower bounds to parallel NP lower bounds.
SIGACT News, 1997

Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP.
J. ACM, 1997

An Introduction to Query Order.
Bull. EATCS, 1997

A Downward Translation in the Polynomial Hierarchy.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Query Order in the Polynomial Hierarchy.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

R<sup>SN</sup><sub>1-tt</sub>(NP) Distinguishes Robust Many-One and Turing Completeness.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996
The Price of Universality.
Notre Dame J. Formal Log., 1996

P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility.
J. Comput. Syst. Sci., 1996

1995
SPARSE Reduces Conjunctively to TALLY.
SIAM J. Comput., 1995

1994
Quasi-injective Reductions.
Theor. Comput. Sci., 1994

Census Techniques Collapse Space Classes.
Inf. Process. Lett., 1994

Complexity Transfer for Modal Logic (Extended Abstract)
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

1993
A modal perspective on the computational complexity of attribute value grammar.
Journal of Logic, Language and Information, 1993

The Relative Power of Logspace and Polynomial Time Reductions.
Comput. Complex., 1993

1992
Bounded Reductions.
Proceedings of the Complexity Theory: Current Research, 1992

1991
Query Optimization Using Rewrite Rules.
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1990
Nexttime is not Necessary.
Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge, 1990

1989
Nondeterminism fairness and a fundamental analogy.
Bull. EATCS, 1989


  Loading...