Nondeterminism fairness and a fundamental analogy. - Edith Spaan; Leen Torenvliet; Peter van Emde Boas (Bull. EATCS, 1989)

Nexttime is not Necessary. - Edith Spaan (TARK, 1990)

Query Optimization Using Rewrite Rules. - Sieger van Denneheuvel; Karen L. Kwast; Gerard R. Renardel de Lavalette; Edith Spaan (RTA, 1991)

Bounded Reductions. - Harry Buhrman; Edith Spaan; Leen Torenvliet (STACS, 1991)

The Relative Power of Logspace and Polynomial Time Reductions. - Harry Buhrman; Edith Spaan; Leen Torenvliet (Comput. Complex., 1993)

A modal perspective on the computational complexity of attribute value grammar. - Patrick Blackburn; Edith Spaan (J. Log. Lang. Inf., 1993)

Complexity Transfer for Modal Logic (Extended Abstract) - Edith Hemaspaandra (LICS, 1994)

Census Techniques Collapse Space Classes. - Edith Hemaspaandra (Inf. Process. Lett., 1994)

Quasi-injective Reductions. - Edith Hemaspaandra; Lane A. Hemaspaandra (Theor. Comput. Sci., 1994)

SPARSE Reduces Conjunctively to TALLY. - Harry Buhrman; Edith Hemaspaandra; Luc Longpré (SIAM J. Comput., 1995)

P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility. - Edith Hemaspaandra; Ashish V. Naik; Mitsunori Ogihara; Alan L. Selman (J. Comput. Syst. Sci., 1996)

The Price of Universality. - Edith Hemaspaandra (Notre Dame J. Formal Log., 1996)

RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (CIAC, 1997)

Query Order in the Polynomial Hierarchy. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (FCT, 1997)

A Downward Translation in the Polynomial Hierarchy. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (STACS, 1997)

An Introduction to Query Order. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (Bull. EATCS, 1997)

Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP. - Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe (J. ACM, 1997)

Raising NP lower bounds to parallel NP lower bounds. - Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe (SIGACT News, 1997)

Downward Collapse from a Weaker Hypothesis - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (CoRR, 1998)

Recognizing when Greed can Approximate Maximum Independent Sets is Complete for Parallel Access to NP. - Edith Hemaspaandra; Jörg Rothe (Inf. Process. Lett., 1998)

Query Order and the Polynomial Hierarchy. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (J. Univers. Comput. Sci., 1998)

RS N1-tt (NP) Distinguishes Robust Many-One and Turing Completeness. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (Theory Comput. Syst., 1998)

A Downward Collapse within the Polynomial Hierarchy. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (SIAM J. Comput., 1998)

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 (SIGACT News, 1998)

Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (STACS, 1999)

R1-ttSN(NP) Distinguishes Robust Many-One and Turing Completeness - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (CoRR, 1999)

Translating Equality Downwards - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (CoRR, 1999)

Almost-Everywhere Superiority for Quantum Computing - Edith Hemaspaandra; Lane A. Hemaspaandra; Marius Zimand (CoRR, 1999)

On the Power of Positive Turing Reductions. - Edith Hemaspaandra (J. Univers. Comput. Sci., 1999)

Modal Satisfiability Is in Deterministic Linear Space. - Edith Hemaspaandra (CSL, 2000)

Computational Politics: Electoral Systems. - Edith Hemaspaandra; Lane A. Hemaspaandra (MFCS, 2000)

Using the No-Search Easy-Hard Technique for Downward Collapse - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (CoRR, 2001)

The Complexity of Poor Man's Logic. - Edith Hemaspaandra (J. Log. Comput., 2001)

Equivalence and Isomorphism for Boolean Constraint Satisfaction. - Elmar Böhler; Edith Hemaspaandra; Steffen Reith; Heribert Vollmer (CSL, 2002)

Almost-Everywhere Superiority for Quantum Polynomial Time. - Edith Hemaspaandra; Lane A. Hemaspaandra; Marius Zimand (Inf. Comput., 2002)

The Minimization Problem for Boolean Formulas. - Edith Hemaspaandra; Gerd Wechsung (SIAM J. Comput., 2002)

Complexity of Cycle Length Modularity Problems in Graphs. - Edith Hemaspaandra; Holger Spakowski; Mayur Thakur (LATIN, 2004)

The Complexity of Boolean Constraint Isomorphism. - Elmar Böhler; Edith Hemaspaandra; Steffen Reith; Heribert Vollmer (STACS, 2004)

Dichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas - Edith Hemaspaandra (CoRR, 2004)

The Complexity of Kings - Edith Hemaspaandra; Lane A. Hemaspaandra; Osamu Watanabe 001 (CoRR, 2005)

Extending Downward Collapse from 1-versus-2 Queries to m-versus-m + 1 Queries. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (SIAM J. Comput., 2005)

All superlinear inverse schemes are coNP-hard. - Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel (Theor. Comput. Sci., 2005)

The complexity of Kemeny elections. - Edith Hemaspaandra; Holger Spakowski; Jörg Vogel 001 (Theor. Comput. Sci., 2005)

The Complexity of Bribery in Elections. - Piotr Faliszewski; Edith Hemaspaandra; Lane A. Hemaspaandra (AAAI, 2006)

Generalized Modal Satisfiability. - Michael Bauland; Edith Hemaspaandra; Henning Schnoor; Ilka Schnoor (STACS, 2006)

Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. - Edith Hemaspaandra; Jörg Rothe; Holger Spakowski (RAIRO Theor. Informatics Appl., 2006)

Llull and Copeland Voting Broadly Resist Bribery and Control. - Piotr Faliszewski; Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe (AAAI, 2007)

Anyone but him: The complexity of precluding an alternative. - Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe (Artif. Intell., 2007)

Complexity results in graph reconstruction. - Edith Hemaspaandra; Lane A. Hemaspaandra; Stanislaw P. Radziszowski; Rahul Tripathi (Discret. Appl. Math., 2007)

Dichotomy for voting systems. - Edith Hemaspaandra; Lane A. Hemaspaandra (J. Comput. Syst. Sci., 2007)

Approximability of Manipulating Elections. - Eric Brelsford; Piotr Faliszewski; Edith Hemaspaandra; Henning Schnoor; Ilka Schnoor (AAAI, 2008)

Copeland Voting Fully Resists Constructive Control. - Piotr Faliszewski; Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe (AAIM, 2008)

Copeland voting: ties matter. - Piotr Faliszewski; Edith Hemaspaandra; Henning Schnoor (AAMAS (2), 2008)

On the Complexity of Elementary Modal Logics. - Edith Hemaspaandra; Henning Schnoor (STACS, 2008)

Llull and Copeland Voting Computationally Resist Bribery and Control - Piotr Faliszewski; Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe (CoRR, 2008)

How Hard Is Bribery in Elections? - Piotr Faliszewski; Edith Hemaspaandra; Lane A. Hemaspaandra (J. Artif. Intell. Res., 2009)

Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. - Piotr Faliszewski; Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe (J. Artif. Intell. Res., 2009)

Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. - Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe (Math. Log. Q., 2009)

Isomorphic Implication. - Michael Bauland; Edith Hemaspaandra (Theory Comput. Syst., 2009)

Manipulation of copeland elections. - Piotr Faliszewski; Edith Hemaspaandra; Henning Schnoor (AAMAS, 2010)

Using complexity to protect elections. - Piotr Faliszewski; Edith Hemaspaandra; Lane A. Hemaspaandra (Commun. ACM, 2010)

Generalized modal satisfiability. - Edith Hemaspaandra; Henning Schnoor; Ilka Schnoor (J. Comput. Syst. Sci., 2010)

On the complexity of kings. - Edith Hemaspaandra; Lane A. Hemaspaandra; Till Tantau; Osamu Watanabe 001 (Theor. Comput. Sci., 2010)

Minimization for Generalized Boolean Formulas. - Edith Hemaspaandra; Henning Schnoor (IJCAI, 2011)

A Universally Defined Undecidable Unimodal Logic. - Edith Hemaspaandra; Henning Schnoor (MFCS, 2011)

A Simplest Undecidable Modal Logic - Edith Hemaspaandra; Henning Schnoor (CoRR, 2011)

The shield that never was: Societies with single-peaked preferences are more open to manipulation and control. - Piotr Faliszewski; Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe (Inf. Comput., 2011)

Multimode Control Attacks on Elections. - Piotr Faliszewski; Edith Hemaspaandra; Lane A. Hemaspaandra (J. Artif. Intell. Res., 2011)

Weighted Manipulation for Four-Candidate Llull Is Easy. - Piotr Faliszewski; Edith Hemaspaandra; Henning Schnoor (ECAI, 2012)

Online Voter Control in Sequential Elections. - Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe (ECAI, 2012)

Controlling Candidate-Sequential Elections. - Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe (ECAI, 2012)

A Richer Understanding of the Complexity of Election Systems. - Piotr Faliszewski; Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe (Fundamental Problems in Computing, 2013)

X THEN X: Manipulation of Same-System Runoff Elections - Zack Fitzsimmons; Edith Hemaspaandra; Lane A. Hemaspaandra (CoRR, 2013)

A Control Dichotomy for Pure Scoring Rules. - Edith Hemaspaandra; Lane A. Hemaspaandra; Henning Schnoor (AAAI, 2014)

Bribery and voter control under voting-rule uncertainty. - Gábor Erdélyi; Edith Hemaspaandra; Lane A. Hemaspaandra (AAMAS, 2014)

The complexity of manipulative attacks in nearly single-peaked electorates. - Piotr Faliszewski; Edith Hemaspaandra; Lane A. Hemaspaandra (Artif. Intell., 2014)

The complexity of online manipulation of sequential elections. - Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe (J. Comput. Syst. Sci., 2014)

More Natural Models of Electoral Control by Partition. - Gábor Erdélyi; Edith Hemaspaandra; Lane A. Hemaspaandra (ADT, 2015)

Complexity of Manipulative Actions When Voting with Ties. - Zack Fitzsimmons; Edith Hemaspaandra (ADT, 2015)

The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract). - Piotr Faliszewski; Edith Hemaspaandra; Lane A. Hemaspaandra (IJCAI, 2015)

Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. - Felix Brandt 001; Markus Brill; Edith Hemaspaandra; Lane A. Hemaspaandra (J. Artif. Intell. Res., 2015)

Weighted Electoral Control. - Piotr Faliszewski; Edith Hemaspaandra; Lane A. Hemaspaandra (J. Artif. Intell. Res., 2015)

The Complexity of Manipulative Actions in Single-Peaked Societies. - Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe (Economics and Computation, 2016)

Dichotomy for Pure Scoring Rules Under Manipulative Electoral Actions. - Edith Hemaspaandra; Henning Schnoor (ECAI, 2016)

Modeling Single-Peakedness for Votes with Ties. - Zack Fitzsimmons; Edith Hemaspaandra (STAIRS, 2016)

Manipulation Complexity of Same-System Runoff Elections. - Zack Fitzsimmons; Edith Hemaspaandra; Lane A. Hemaspaandra (Ann. Math. Artif. Intell., 2016)

Complexity Dichotomies for Unweighted Scoring Rules. - Edith Hemaspaandra; Henning Schnoor (CoRR, 2016)

Dodgson's Rule and Young's Rule. - Ioannis Caragiannis; Edith Hemaspaandra; Lane A. Hemaspaandra (Handbook of Computational Social Choice, 2016)

The Complexity of Succinct Elections. - Zack Fitzsimmons; Edith Hemaspaandra (AAAI, 2017)

The complexity of online voter control in sequential elections. - Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe (Auton. Agents Multi Agent Syst., 2017)

Credimus. - Edith Hemaspaandra; Lane A. Hemaspaandra (CoRR, 2017)

The complexity of controlling candidate-sequential elections. - Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe (Theor. Comput. Sci., 2017)

Very Hard Electoral Control Problems. - Zack Fitzsimmons; Edith Hemaspaandra; Alexander Hoover 001; David E. Narváez (AAAI, 2019)

High-multiplicity election problems. - Zack Fitzsimmons; Edith Hemaspaandra (Auton. Agents Multi Agent Syst., 2019)

The Complexity of Online Bribery in Sequential Elections (Extended Abstract). - Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe (TARK, 2019)

Election Score Can Be Harder than Winner. - Zack Fitzsimmons; Edith Hemaspaandra (ECAI, 2020)

Prototype of an Automated Feedback Tool for Intro CS Theory. - Ivona Bezáková; Edith Hemaspaandra; Aryeh Lieberman; Hannah Miller; David E. Narváez (SIGCSE, 2020)

Control in the presence of manipulators: cooperative and competitive cases. - Zack Fitzsimmons; Edith Hemaspaandra; Lane A. Hemaspaandra (Auton. Agents Multi Agent Syst., 2020)

Correction to: Control in the presence of manipulators: cooperative and competitive cases. - Zack Fitzsimmons; Edith Hemaspaandra; Lane A. Hemaspaandra (Auton. Agents Multi Agent Syst., 2020)

The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. - Edith Hemaspaandra; Lane A. Hemaspaandra; Holger Spakowski; Osamu Watanabe 001 (Comput. Complex., 2020)

Effective Feedback for Introductory CS Theory: A JFLAP Extension and Student Persistence. - Ivona Bezáková; Kimberly Fluet; Edith Hemaspaandra; Hannah Miller; David E. Narváez (CoRR, 2020)

Search versus Decision for Election Manipulation Problems. - Edith Hemaspaandra; Lane A. Hemaspaandra; Curtis Menton (ACM Trans. Comput. Theory, 2020)

Kemeny Consensus Complexity. - Zack Fitzsimmons; Edith Hemaspaandra (IJCAI, 2021)

Witness Feedback for Introductory CS Theory Assignments. - Ivona Bezáková; Kimberly Fluet; Edith Hemaspaandra; Hannah Miller; David E. Narváez (SIGCSE, 2021)

Insight into Voting Problem Complexity Using Randomized Classes. - Zack Fitzsimmons; Edith Hemaspaandra (IJCAI, 2022)

Formal Methods for NFA Equivalence: QBFs, Witness Extraction, and Encoding Verification. - Edith Hemaspaandra; David E. Narváez (CICM, 2022)

Effective Succinct Feedback for Intro CS Theory: A JFLAP Extension. - Ivona Bezáková; Kimberly Fluet; Edith Hemaspaandra; Hannah Miller; David E. Narváez (SIGCSE (1), 2022)

Complexity of stability. - Fabian Frei; Edith Hemaspaandra; Jörg Rothe (J. Comput. Syst. Sci., 2022)

The complexity of online bribery in sequential elections. - Edith Hemaspaandra; Lane A. Hemaspaandra; Jörg Rothe (J. Comput. Syst. Sci., 2022)

Formal Methods for NFA Equivalence: QBFs, Witness Extraction, and Encoding Verification. - Edith Hemaspaandra; David E. Narváez (Zenodo, 2022)

Using Weighted Matching to Solve 2-Approval/Veto Control and Bribery. - Zack Fitzsimmons; Edith Hemaspaandra (ECAI, 2023)

Complexity of Conformant Election Manipulation. - Zack Fitzsimmons; Edith Hemaspaandra (FCT, 2023)

The Complexity of (Pk, Pℓ )-Arrowing. - Zohair Raza Hassan; Edith Hemaspaandra; Stanislaw P. Radziszowski (FCT, 2023)

Feedback Tools and Motivation to Persist in Intro CS Theory. - Ivona Bezáková; Kimberly Fluet; Edith Hemaspaandra; Hannah Miller; David E. Narváez (SIGCSE (2), 2023)

Finding Optimal Solutions with Neighborly Help. - Elisabet Burjons; Fabian Frei; Edith Hemaspaandra; Dennis Komm; David Wehner (Algorithmica, 2024)

On the Parallelizability of Approval-Based Committee Rules. - Zack Fitzsimmons; Zohair Raza Hassan; Edith Hemaspaandra (CoRR, 2025)