Edith Hemaspaandra

184 papers A* 18A 20B 20C 3Journal 113Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	A Taste of Formal Methods for Computer Science Students using Jupyter Notebooks. SIGCSE (2) Zack Fitzsimmons, Zohair Raza Hassan, Edith Hemaspaandra, Carlos R. Rivero
2026	J	`jnl`	The complexity of (Pk,Pℓ)-arrowing. J. Comput. Syst. Sci. Zohair Raza Hassan, Edith Hemaspaandra, Stanislaw P. Radziszowski
2025	A	`conf`	On the Parallelizability of Approval-Based Committee Rules. ECAI Zack Fitzsimmons, Zohair Raza Hassan, Edith Hemaspaandra
2025	J	`jnl`	On the Parallelizability of Approval-Based Committee Rules. CoRR Zack Fitzsimmons, Zohair Raza Hassan, Edith Hemaspaandra
2024	J	`jnl`	Finding Optimal Solutions with Neighborly Help. Algorithmica Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner
2023	B	`conf`	Complexity of Conformant Election Manipulation. FCT Zack Fitzsimmons, Edith Hemaspaandra
2023	J	`jnl`	Complexity of Conformant Election Manipulation. CoRR Zack Fitzsimmons, Edith Hemaspaandra
2023	—	`conf`	Feedback Tools and Motivation to Persist in Intro CS Theory. SIGCSE (2) Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez
2023	B	`conf`	The Complexity of (P FCT Zohair Raza Hassan, Edith Hemaspaandra, Stanislaw P. Radziszowski
2023	J	`jnl`	The Complexity of (P CoRR Zohair Raza Hassan, Edith Hemaspaandra, Stanislaw P. Radziszowski
2023	A	`conf`	Using Weighted Matching to Solve 2-Approval/Veto Control and Bribery. ECAI Zack Fitzsimmons, Edith Hemaspaandra
2023	J	`jnl`	Using Weighted Matching to Solve 2-Approval/Veto Control and Bribery. CoRR Zack Fitzsimmons, Edith Hemaspaandra
2022	J	`jnl`	Complexity of stability. J. Comput. Syst. Sci. Fabian Frei, Edith Hemaspaandra, Jörg Rothe
2022	—	`conf`	Effective Succinct Feedback for Intro CS Theory: A JFLAP Extension. SIGCSE (1) Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez
2022	C	`conf`	Formal Methods for NFA Equivalence: QBFs, Witness Extraction, and Encoding Verification. CICM Edith Hemaspaandra, David E. Narváez
2022	A*	`conf`	Insight into Voting Problem Complexity Using Randomized Classes. IJCAI Zack Fitzsimmons, Edith Hemaspaandra
2022	J	`jnl`	Insight into Voting Problem Complexity Using Randomized Classes. CoRR Zack Fitzsimmons, Edith Hemaspaandra
2022	J	`jnl`	The complexity of online bribery in sequential elections. J. Comput. Syst. Sci. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2021	A*	`conf`	Kemeny Consensus Complexity. IJCAI Zack Fitzsimmons, Edith Hemaspaandra
2021	J	`jnl`	Kemeny Consensus Complexity. CoRR Zack Fitzsimmons, Edith Hemaspaandra
2021	A	`conf`	Witness Feedback for Introductory CS Theory Assignments. SIGCSE Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez
2020	B	`conf`	Complexity of Stability. ISAAC Fabian Frei, Edith Hemaspaandra, Jörg Rothe
2020	J	`jnl`	Control in the presence of manipulators: cooperative and competitive cases. Auton. Agents Multi Agent Syst. Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
2020	J	`jnl`	Correction to: Control in the presence of manipulators: cooperative and competitive cases. Auton. Agents Multi Agent Syst. Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
2020	J	`jnl`	Effective Feedback for Introductory CS Theory: A JFLAP Extension and Student Persistence. CoRR Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez
2020	A	`conf`	Election Score Can Be Harder than Winner. ECAI Zack Fitzsimmons, Edith Hemaspaandra
2020	A	`conf`	Prototype of an Automated Feedback Tool for Intro CS Theory. SIGCSE Ivona Bezáková, Edith Hemaspaandra, Aryeh Lieberman, Hannah Miller, David E. Narváez
2020	J	`jnl`	Search versus Decision for Election Manipulation Problems. ACM Trans. Comput. Theory Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton
2020	J	`jnl`	The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. Comput. Complex. Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe
2019	J	`jnl`	Complexity of Stability. CoRR Fabian Frei, Edith Hemaspaandra, Jörg Rothe
2019	B	`conf`	Finding Optimal Solutions With Neighborly Help. MFCS Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner
2019	J	`jnl`	Finding Optimal Solutions With Neighborly Help. CoRR Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner
2019	J	`jnl`	High-multiplicity election problems. Auton. Agents Multi Agent Syst. Zack Fitzsimmons, Edith Hemaspaandra
2019	B	`conf`	The Complexity of Online Bribery in Sequential Elections (Extended Abstract). TARK Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2019	J	`jnl`	The Complexity of Online Bribery in Sequential Elections. CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2019	A*	`conf`	Very Hard Electoral Control Problems. AAAI Zack Fitzsimmons, Edith Hemaspaandra, Alexander Hoover, David E. Narváez
2018	J	`jnl`	Election Score Can Be Harder Than Winner. CoRR Zack Fitzsimmons, Edith Hemaspaandra
2018	A	`conf`	High-Multiplicity Election Problems. AAMAS Zack Fitzsimmons, Edith Hemaspaandra
2018	B	`conf`	The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. MFCS Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe
2018	J	`jnl`	Very Hard Electoral Control Problems. CoRR Zack Fitzsimmons, Edith Hemaspaandra, Alexander Hoover, David E. Narváez
2017	J	`jnl`	Credimus. CoRR Edith Hemaspaandra, Lane A. Hemaspaandra
2017	A*	`conf`	The Complexity of Succinct Elections. AAAI Zack Fitzsimmons, Edith Hemaspaandra
2017	J	`jnl`	The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe
2017	J	`jnl`	The complexity of controlling candidate-sequential elections. Theor. Comput. Sci. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2017	J	`jnl`	The complexity of online voter control in sequential elections. Auton. Agents Multi Agent Syst. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2016	J	`jnl`	Complexity Dichotomies for Unweighted Scoring Rules. CoRR Edith Hemaspaandra, Henning Schnoor
2016	A	`conf`	Dichotomy for Pure Scoring Rules Under Manipulative Electoral Actions. ECAI Edith Hemaspaandra, Henning Schnoor
2016	—	`ch.`	Dodgson's Rule and Young's Rule. Handbook of Computational Social Choice Ioannis Caragiannis, Edith Hemaspaandra, Lane A. Hemaspaandra
2016	J	`jnl`	Manipulation Complexity of Same-System Runoff Elections. Ann. Math. Artif. Intell. Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
2016	—	`conf`	Modeling Single-Peakedness for Votes with Ties. STAIRS Zack Fitzsimmons, Edith Hemaspaandra
2016	J	`jnl`	Modeling Single-Peakedness for Votes with Ties. CoRR Zack Fitzsimmons, Edith Hemaspaandra
2016	—	`ch.`	The Complexity of Manipulative Actions in Single-Peaked Societies. Economics and Computation Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2016	J	`jnl`	The Complexity of Succinct Elections. CoRR Zack Fitzsimmons, Edith Hemaspaandra
2015	J	`jnl`	Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. J. Artif. Intell. Res. Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra
2015	—	`conf`	Complexity of Manipulative Actions When Voting with Ties. ADT Zack Fitzsimmons, Edith Hemaspaandra
2015	J	`jnl`	Complexity of Manipulative Actions When Voting with Ties. CoRR Zack Fitzsimmons, Edith Hemaspaandra
2015	—	`conf`	More Natural Models of Electoral Control by Partition. ADT Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra
2015	A*	`conf`	The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract). IJCAI Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2015	J	`jnl`	Weighted Electoral Control. J. Artif. Intell. Res. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2014	A*	`conf`	A Control Dichotomy for Pure Scoring Rules. AAAI Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor
2014	J	`jnl`	A Control Dichotomy for Pure Scoring Rules. CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor
2014	A	`conf`	Bribery and voter control under voting-rule uncertainty. AAMAS Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra
2014	J	`jnl`	More Natural Models of Electoral Control by Partition. CoRR Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra
2014	J	`jnl`	The complexity of manipulative attacks in nearly single-peaked electorates. Artif. Intell. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2014	J	`jnl`	The complexity of online manipulation of sequential elections. J. Comput. Syst. Sci. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2013	—	`conf`	A Richer Understanding of the Complexity of Election Systems. Fundamental Problems in Computing Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2013	A*	`conf`	Control in the Presence of Manipulators: Cooperative and Competitive Cases. IJCAI Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
2013	J	`jnl`	Control in the Presence of Manipulators: Cooperative and Competitive Cases. CoRR Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
2013	A	`conf`	Search versus Decision for Election Manipulation Problems. STACS Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton
2013	B	`conf`	The Complexity of Online Manipulation of Sequential Elections. TARK Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2013	J	`jnl`	The Complexity of Online Manipulation of Sequential Elections. CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2013	J	`jnl`	Weighted Electoral Control CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2013	A	`conf`	Weighted electoral control. AAMAS Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2013	J	`jnl`	X THEN X: Manipulation of Same-System Runoff Elections CoRR Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
2012	J	`jnl`	Controlling Candidate-Sequential Elections CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2012	A	`conf`	Controlling Candidate-Sequential Elections. ECAI Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2012	J	`jnl`	Online Voter Control in Sequential Elections CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2012	A	`conf`	Online Voter Control in Sequential Elections. ECAI Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2012	J	`jnl`	Search versus Decision for Election Manipulation Problems CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton
2012	J	`jnl`	The Complexity of Online Manipulation of Sequential Elections CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2012	A	`conf`	Weighted Manipulation for Four-Candidate Llull Is Easy. ECAI Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor
2011	J	`jnl`	A Simplest Undecidable Modal Logic CoRR Edith Hemaspaandra, Henning Schnoor
2011	B	`conf`	A Universally Defined Undecidable Unimodal Logic. MFCS Edith Hemaspaandra, Henning Schnoor
2011	J	`jnl`	Minimization for Generalized Boolean Formulas CoRR Edith Hemaspaandra, Henning Schnoor
2011	A*	`conf`	Minimization for Generalized Boolean Formulas. IJCAI Edith Hemaspaandra, Henning Schnoor
2011	J	`jnl`	Multimode Control Attacks on Elections. J. Artif. Intell. Res. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2011	J	`jnl`	The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2011	B	`conf`	The complexity of manipulative attacks in nearly single-peaked electorates. TARK Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2011	J	`jnl`	The shield that never was: Societies with single-peaked preferences are more open to manipulation and control. Inf. Comput. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2010	A*	`conf`	Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. AAAI Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra
2010	J	`jnl`	Generalized modal satisfiability. J. Comput. Syst. Sci. Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
2010	A	`conf`	Manipulation of copeland elections. AAMAS Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor
2010	J	`jnl`	Multimode Control Attacks on Elections CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2010	J	`jnl`	On the complexity of kings. Theor. Comput. Sci. Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe
2010	J	`jnl`	Using complexity to protect elections. Commun. ACM Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2009	J	`jnl`	How Hard Is Bribery in Elections? J. Artif. Intell. Res. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2009	J	`jnl`	Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. Math. Log. Q. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2009	J	`jnl`	Isomorphic Implication. Theory Comput. Syst. Michael Bauland, Edith Hemaspaandra
2009	J	`jnl`	Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. J. Artif. Intell. Res. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2009	A*	`conf`	Multimode Control Attacks on Elections. IJCAI Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2009	J	`jnl`	The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2009	B	`conf`	The shield that never was: societies with single-peaked preferences are more open to manipulation and control. TARK Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2008	A*	`conf`	Approximability of Manipulating Elections. AAAI Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
2008	C	`conf`	Copeland Voting Fully Resists Constructive Control. AAIM Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2008	—	`conf`	Copeland voting: ties matter. AAMAS (2) Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor
2008	J	`jnl`	Generalized Modal Satisfiability CoRR Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
2008	J	`jnl`	Llull and Copeland Voting Computationally Resist Bribery and Control CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2008	J	`jnl`	On the Complexity of Elementary Modal Logics CoRR Edith Hemaspaandra, Henning Schnoor
2008	A	`conf`	On the Complexity of Elementary Modal Logics. STACS Edith Hemaspaandra, Henning Schnoor
2007	J	`jnl`	Anyone but him: The complexity of precluding an alternative. Artif. Intell. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2007	J	`jnl`	Complexity results in graph reconstruction. Discret. Appl. Math. Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi
2007	J	`jnl`	Copeland Voting Fully Resists Constructive Control CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2007	J	`jnl`	Dichotomy for voting systems. J. Comput. Syst. Sci. Edith Hemaspaandra, Lane A. Hemaspaandra
2007	A*	`conf`	Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. IJCAI Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2007	A*	`conf`	Llull and Copeland Voting Broadly Resist Bribery and Control. AAAI Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2007	B	`conf`	On the Complexity of Kings. FCT Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe
2006	J	`jnl`	A Richer Understanding of the Complexity of Election Systems CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2006	A	`conf`	Generalized Modal Satisfiability. STACS Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
2006	J	`jnl`	How Hard Is Bribery in Elections? CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2006	J	`jnl`	Hybrid Elections Broaden Complexity-Theoretic Resistance to Control CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2006	J	`jnl`	Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. RAIRO Theor. Informatics Appl. Edith Hemaspaandra, Jörg Rothe, Holger Spakowski
2006	A*	`conf`	The Complexity of Bribery in Elections. AAAI Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2005	J	`jnl`	All superlinear inverse schemes are coNP-hard. Theor. Comput. Sci. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
2005	J	`jnl`	Anyone but Him: The Complexity of Precluding an Alternative CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2005	A*	`conf`	Anyone but Him: The Complexity of Precluding an Alternative. AAAI Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2005	J	`jnl`	Dichotomy for Voting Systems CoRR Edith Hemaspaandra, Lane A. Hemaspaandra
2005	J	`jnl`	Extending Downward Collapse from 1-versus-2 Queries to m-versus-m + 1 Queries. SIAM J. Comput. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
2005	B	`conf`	Isomorphic Implication. MFCS Michael Bauland, Edith Hemaspaandra
2005	J	`jnl`	The Complexity of Kings CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Osamu Watanabe
2005	J	`jnl`	The complexity of Kemeny elections. Theor. Comput. Sci. Edith Hemaspaandra, Holger Spakowski, Jörg Vogel
2004	B	`conf`	All Superlinear Inverse Schemes Are coNP-Hard. MFCS Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
2004	J	`jnl`	All Superlinear Inverse Schemes are coNP-Hard CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
2004	J	`jnl`	Complexity Results in Graph Reconstruction CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi
2004	B	`conf`	Complexity Results in Graph Reconstruction. MFCS Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi
2004	B	`conf`	Complexity of Cycle Length Modularity Problems in Graphs. LATIN Edith Hemaspaandra, Holger Spakowski, Mayur Thakur
2004	J	`jnl`	Dichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas CoRR Edith Hemaspaandra
2004	J	`jnl`	Isomorphic Implication CoRR Michael Bauland, Edith Hemaspaandra
2004	A	`conf`	The Complexity of Boolean Constraint Isomorphism. STACS Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
2003	J	`jnl`	Complexity of Cycle Length Modularity Problems in Graphs CoRR Edith Hemaspaandra, Holger Spakowski, Mayur Thakur
2003	J	`jnl`	The Complexity of Boolean Constraint Isomorphism CoRR Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
2002	J	`jnl`	Almost-Everywhere Superiority for Quantum Polynomial Time. Inf. Comput. Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand
2002	J	`jnl`	Equivalence and Isomorphism for Boolean Constraint Satisfaction CoRR Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
2002	B	`conf`	Equivalence and Isomorphism for Boolean Constraint Satisfaction. CSL Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
2002	B	`conf`	Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. WG Edith Hemaspaandra, Jörg Rothe, Holger Spakowski
2002	J	`jnl`	The Minimization Problem for Boolean Formulas. SIAM J. Comput. Edith Hemaspaandra, Gerd Wechsung
2001	J	`jnl`	Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP CoRR Edith Hemaspaandra, Jörg Rothe, Holger Spakowski
2001	J	`jnl`	The Complexity of Poor Man's Logic. J. Log. Comput. Edith Hemaspaandra
2001	J	`jnl`	Using the No-Search Easy-Hard Technique for Downward Collapse CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
2000	B	`conf`	Computational Politics: Electoral Systems. MFCS Edith Hemaspaandra, Lane A. Hemaspaandra
2000	B	`conf`	Modal Satisfiability Is in Deterministic Linear Space. CSL Edith Hemaspaandra
2000	A	`conf`	The Complexity of Poor Man's Logic. STACS Edith Hemaspaandra
1999	J	`jnl`	A Downward Collapse within the Polynomial Hierarchy CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1999	J	`jnl`	Almost-Everywhere Superiority for Quantum Computing CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand
1999	J	`jnl`	An Introduction to Query Order CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1999	J	`jnl`	Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
1999	A	`conf`	Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries. STACS Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1999	J	`jnl`	On the Power of Positive Turing Reductions CoRR Edith Hemaspaandra
1999	J	`jnl`	On the Power of Positive Turing Reductions. J. Univers. Comput. Sci. Edith Hemaspaandra
1999	J	`jnl`	Query Order and the Polynomial Hierarchy CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1999	J	`jnl`	R CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1999	J	`jnl`	Raising NP Lower Bounds to Parallel NP Lower Bounds CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
1999	J	`jnl`	The Complexity of Poor Man's Logic CoRR Edith Hemaspaandra
1999	J	`jnl`	Translating Equality Downwards CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1999	J	`jnl`	What's Up with Downward Collapse: Using the Easy-Hard Technique to Link Boolean and Polynomial Hierarchy Collapses CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1998	J	`jnl`	A Downward Collapse within the Polynomial Hierarchy. SIAM J. Comput. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1998	J	`jnl`	Downward Collapse from a Weaker Hypothesis CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1998	J	`jnl`	Query Order and the Polynomial Hierarchy. J. Univers. Comput. Sci. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1998	J	`jnl`	R Theory Comput. Syst. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1998	J	`jnl`	Recognizing when Greed can Approximate Maximum Independent Sets is Complete for Parallel Access to NP. Inf. Process. Lett. Edith Hemaspaandra, Jörg Rothe
1998	J	`jnl`	What's up with downward collapse: using the easy-hard technique to link Boolean and polynomial hierarchy collapses. SIGACT News Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1997	A	`conf`	A Downward Translation in the Polynomial Hierarchy. STACS Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1997	J	`jnl`	An Introduction to Query Order. Bull. EATCS Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1997	A*	`conf`	Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP. ICALP Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
1997	J	`jnl`	Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP. J. ACM Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
1997	B	`conf`	Query Order in the Polynomial Hierarchy. FCT Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1997	C	`conf`	R CIAC Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1997	J	`jnl`	Raising NP lower bounds to parallel NP lower bounds. SIGACT News Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
1997	A*	`conf`	The Minimization Problem for Boolean Formulas. FOCS Edith Hemaspaandra, Gerd Wechsung
1996	J	`jnl`	P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility. J. Comput. Syst. Sci. Edith Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
1996	J	`jnl`	The Price of Universality. Notre Dame J. Formal Log. Edith Hemaspaandra
1995	J	`jnl`	SPARSE Reduces Conjunctively to TALLY. SIAM J. Comput. Harry Buhrman, Edith Hemaspaandra, Luc Longpré
1994	J	`jnl`	Census Techniques Collapse Space Classes. Inf. Process. Lett. Edith Hemaspaandra
1994	A*	`conf`	Complexity Transfer for Modal Logic (Extended Abstract) LICS Edith Hemaspaandra
1994	J	`jnl`	Quasi-injective Reductions. Theor. Comput. Sci. Edith Hemaspaandra, Lane A. Hemaspaandra