default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdith Hemaspaandra
Edith Spaan
Person information
- affiliation: Rochester Institute of Technology, Henrietta, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j51]Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner:
Finding Optimal Solutions with Neighborly Help. Algorithmica 86(6): 1921-1947 (2024)- 2023
- [c72]Zack Fitzsimmons, Edith Hemaspaandra:
Using Weighted Matching to Solve 2-Approval/Veto Control and Bribery. ECAI 2023: 732-739 - [c71]Zack Fitzsimmons, Edith Hemaspaandra:
Complexity of Conformant Election Manipulation. FCT 2023: 176-189 - [c70]Zohair Raza Hassan, Edith Hemaspaandra, Stanislaw P. Radziszowski:
The Complexity of (Pk, Pℓ )-Arrowing. FCT 2023: 248-261 - [c69]Ivona Bezáková
, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez:
Feedback Tools and Motivation to Persist in Intro CS Theory. SIGCSE (2) 2023: 1341 - [i63]Zack Fitzsimmons, Edith Hemaspaandra:
Using Weighted Matching to Solve 2-Approval/Veto Control and Bribery. CoRR abs/2305.16889 (2023) - [i62]Zohair Raza Hassan, Edith Hemaspaandra, Stanislaw P. Radziszowski:
The Complexity of (Pk, P𝓁)-Arrowing. CoRR abs/2307.10510 (2023) - [i61]Zack Fitzsimmons, Edith Hemaspaandra:
Complexity of Conformant Election Manipulation. CoRR abs/2307.11689 (2023) - 2022
- [j50]Fabian Frei, Edith Hemaspaandra, Jörg Rothe:
Complexity of stability. J. Comput. Syst. Sci. 123: 103-121 (2022) - [j49]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The complexity of online bribery in sequential elections. J. Comput. Syst. Sci. 127: 66-90 (2022) - [c68]Zack Fitzsimmons, Edith Hemaspaandra:
Insight into Voting Problem Complexity Using Randomized Classes. IJCAI 2022: 293-299 - [c67]Edith Hemaspaandra, David E. Narváez:
Formal Methods for NFA Equivalence: QBFs, Witness Extraction, and Encoding Verification. CICM 2022: 241-255 - [c66]Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez:
Effective Succinct Feedback for Intro CS Theory: A JFLAP Extension. SIGCSE (1) 2022: 976-982 - [d1]Edith Hemaspaandra, David E. Narváez:
Formal Methods for NFA Equivalence: QBFs, Witness Extraction, and Encoding Verification. Zenodo, 2022
- [i60]Zack Fitzsimmons, Edith Hemaspaandra:
Insight into Voting Problem Complexity Using Randomized Classes. CoRR abs/2204.12856 (2022) - 2021
- [c65]Zack Fitzsimmons, Edith Hemaspaandra:
Kemeny Consensus Complexity. IJCAI 2021: 196-202 - [c64]Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez:
Witness Feedback for Introductory CS Theory Assignments. SIGCSE 2021: 1300 - [i59]Zack Fitzsimmons, Edith Hemaspaandra:
Kemeny Consensus Complexity. CoRR abs/2105.08540 (2021) - 2020
- [j48]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
Control in the presence of manipulators: cooperative and competitive cases. Auton. Agents Multi Agent Syst. 34(2): 52 (2020) - [j47]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
Correction to: Control in the presence of manipulators: cooperative and competitive cases. Auton. Agents Multi Agent Syst. 34(2): 56 (2020) - [j46]Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe:
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. Comput. Complex. 29(2): 7 (2020) - [j45]Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton:
Search versus Decision for Election Manipulation Problems. ACM Trans. Comput. Theory 12(1): 3:1-3:42 (2020) - [c63]Zack Fitzsimmons, Edith Hemaspaandra:
Election Score Can Be Harder than Winner. ECAI 2020: 83-90 - [c62]Fabian Frei, Edith Hemaspaandra, Jörg Rothe:
Complexity of Stability. ISAAC 2020: 19:1-19:14 - [c61]Ivona Bezáková, Edith Hemaspaandra, Aryeh Lieberman, Hannah Miller, David E. Narváez:
Prototype of an Automated Feedback Tool for Intro CS Theory. SIGCSE 2020: 1311 - [i58]Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez:
Effective Feedback for Introductory CS Theory: A JFLAP Extension and Student Persistence. CoRR abs/2012.01546 (2020)
2010 – 2019
- 2019
- [j44]Zack Fitzsimmons, Edith Hemaspaandra:
High-multiplicity election problems. Auton. Agents Multi Agent Syst. 33(4): 383-402 (2019) - [c60]Zack Fitzsimmons, Edith Hemaspaandra, Alexander Hoover, David E. Narváez:
Very Hard Electoral Control Problems. AAAI 2019: 1933-1940 - [c59]Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner:
Finding Optimal Solutions With Neighborly Help. MFCS 2019: 78:1-78:14 - [c58]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Bribery in Sequential Elections (Extended Abstract). TARK 2019: 233-251 - [i57]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Bribery in Sequential Elections. CoRR abs/1906.08308 (2019) - [i56]Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner:
Finding Optimal Solutions With Neighborly Help. CoRR abs/1906.10078 (2019) - [i55]Fabian Frei, Edith Hemaspaandra, Jörg Rothe:
Complexity of Stability. CoRR abs/1910.00305 (2019) - 2018
- [c57]Zack Fitzsimmons, Edith Hemaspaandra:
High-Multiplicity Election Problems. AAMAS 2018: 1558-1566 - [c56]Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe:
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. MFCS 2018: 51:1-51:14 - [i54]Zack Fitzsimmons, Edith Hemaspaandra:
Election Score Can Be Harder Than Winner. CoRR abs/1806.08763 (2018) - [i53]Zack Fitzsimmons, Edith Hemaspaandra, Alexander Hoover, David E. Narváez:
Very Hard Electoral Control Problems. CoRR abs/1811.05438 (2018) - 2017
- [j43]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The complexity of online voter control in sequential elections. Auton. Agents Multi Agent Syst. 31(5): 1055-1076 (2017) - [j42]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The complexity of controlling candidate-sequential elections. Theor. Comput. Sci. 678: 14-21 (2017) - [c55]Zack Fitzsimmons, Edith Hemaspaandra:
The Complexity of Succinct Elections. AAAI 2017: 4921-4922 - [i52]Edith Hemaspaandra, Lane A. Hemaspaandra:
Credimus. CoRR abs/1711.00201 (2017) - [i51]Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe:
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. CoRR abs/1711.01250 (2017) - 2016
- [j41]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
Manipulation Complexity of Same-System Runoff Elections. Ann. Math. Artif. Intell. 77(3-4): 159-189 (2016) - [c54]Edith Hemaspaandra, Henning Schnoor:
Dichotomy for Pure Scoring Rules Under Manipulative Electoral Actions. ECAI 2016: 1071-1079 - [c53]Zack Fitzsimmons, Edith Hemaspaandra:
Modeling Single-Peakedness for Votes with Ties. STAIRS 2016: 63-74 - [p1]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Manipulative Actions in Single-Peaked Societies. Economics and Computation 2016: 327-360 - [r1]Ioannis Caragiannis, Edith Hemaspaandra, Lane A. Hemaspaandra:
Dodgson's Rule and Young's Rule. Handbook of Computational Social Choice 2016: 103-126 - [i50]Edith Hemaspaandra, Henning Schnoor:
Complexity Dichotomies for Unweighted Scoring Rules. CoRR abs/1604.05264 (2016) - [i49]Zack Fitzsimmons, Edith Hemaspaandra:
Modeling Single-Peakedness for Votes with Ties. CoRR abs/1604.08191 (2016) - [i48]Zack Fitzsimmons, Edith Hemaspaandra:
The Complexity of Succinct Elections. CoRR abs/1611.08927 (2016) - 2015
- [j40]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Weighted Electoral Control. J. Artif. Intell. Res. 52: 507-542 (2015) - [j39]Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra:
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. J. Artif. Intell. Res. 53: 439-496 (2015) - [c52]Zack Fitzsimmons, Edith Hemaspaandra:
Complexity of Manipulative Actions When Voting with Ties. ADT 2015: 103-119 - [c51]Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra:
More Natural Models of Electoral Control by Partition. ADT 2015: 396-413 - [c50]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract). IJCAI 2015: 4178-4182 - [i47]Zack Fitzsimmons, Edith Hemaspaandra:
Complexity of Manipulative Actions When Voting with Ties. CoRR abs/1506.04722 (2015) - 2014
- [j38]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
The complexity of manipulative attacks in nearly single-peaked electorates. Artif. Intell. 207: 69-99 (2014) - [j37]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The complexity of online manipulation of sequential elections. J. Comput. Syst. Sci. 80(4): 697-710 (2014) - [c49]Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor:
A Control Dichotomy for Pure Scoring Rules. AAAI 2014: 712-720 - [c48]Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra:
Bribery and voter control under voting-rule uncertainty. AAMAS 2014: 61-68 - [i46]Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor:
A Control Dichotomy for Pure Scoring Rules. CoRR abs/1404.4560 (2014) - [i45]Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra:
More Natural Models of Electoral Control by Partition. CoRR abs/1410.2652 (2014) - 2013
- [c47]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Weighted electoral control. AAMAS 2013: 367-374 - [c46]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
A Richer Understanding of the Complexity of Election Systems. Fundamental Problems in Computing 2013: 375-406 - [c45]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
Control in the Presence of Manipulators: Cooperative and Competitive Cases. IJCAI 2013: 113-119 - [c44]Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton:
Search versus Decision for Election Manipulation Problems. STACS 2013: 377-388 - [c43]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Manipulation of Sequential Elections. TARK 2013 - [i44]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
X THEN X: Manipulation of Same-System Runoff Elections. CoRR abs/1301.6118 (2013) - [i43]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Weighted Electoral Control. CoRR abs/1305.0943 (2013) - [i42]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
Control in the Presence of Manipulators: Cooperative and Competitive Cases. CoRR abs/1308.0544 (2013) - [i41]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Manipulation of Sequential Elections. CoRR abs/1310.6997 (2013) - 2012
- [c42]Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor:
Weighted Manipulation for Four-Candidate Llull Is Easy. ECAI 2012: 318-323 - [c41]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Online Voter Control in Sequential Elections. ECAI 2012: 396-401 - [c40]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Controlling Candidate-Sequential Elections. ECAI 2012: 905-906 - [i40]Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton:
Search versus Decision for Election Manipulation Problems. CoRR abs/1202.6641 (2012) - [i39]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Controlling Candidate-Sequential Elections. CoRR abs/1202.6649 (2012) - [i38]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Manipulation of Sequential Elections. CoRR abs/1202.6655 (2012) - [i37]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Online Voter Control in Sequential Elections. CoRR abs/1203.0411 (2012) - 2011
- [j36]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. 209(2): 89-107 (2011) - [j35]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Multimode Control Attacks on Elections. J. Artif. Intell. Res. 40: 305-351 (2011) - [c39]Edith Hemaspaandra, Henning Schnoor:
Minimization for Generalized Boolean Formulas. IJCAI 2011: 566-571 - [c38]Edith Hemaspaandra, Henning Schnoor:
A Universally Defined Undecidable Unimodal Logic. MFCS 2011: 364-375 - [c37]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
The complexity of manipulative attacks in nearly single-peaked electorates. TARK 2011: 228-237 - [i36]Edith Hemaspaandra, Henning Schnoor:
Minimization for Generalized Boolean Formulas. CoRR abs/1104.2312 (2011) - [i35]Edith Hemaspaandra, Henning Schnoor:
A Simplest Undecidable Modal Logic. CoRR abs/1105.0845 (2011) - [i34]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates. CoRR abs/1105.5032 (2011) - 2010
- [j34]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Using complexity to protect elections. Commun. ACM 53(11): 74-82 (2010) - [j33]Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
Generalized modal satisfiability. J. Comput. Syst. Sci. 76(7): 561-578 (2010) - [j32]Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe:
On the complexity of kings. Theor. Comput. Sci. 411(4-5): 783-798 (2010) - [c36]Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra:
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. AAAI 2010: 715-722 - [c35]Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor:
Manipulation of copeland elections. AAMAS 2010: 367-374 - [i33]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Multimode Control Attacks on Elections. CoRR abs/1007.1800 (2010)
2000 – 2009
- 2009
- [j31]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. J. Artif. Intell. Res. 35: 275-341 (2009) - [j30]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
How Hard Is Bribery in Elections? J. Artif. Intell. Res. 35: 485-532 (2009) - [j29]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. Math. Log. Q. 55(4): 397-424 (2009) - [j28]Michael Bauland, Edith Hemaspaandra:
Isomorphic Implication. Theory Comput. Syst. 44(1): 117-139 (2009) - [c34]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Multimode Control Attacks on Elections. IJCAI 2009: 128-133 - [c33]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: 118-127 - [i32]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 abs/0909.3257 (2009) - 2008
- [c32]Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
Approximability of Manipulating Elections. AAAI 2008: 44-49 - [c31]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Copeland Voting Fully Resists Constructive Control. AAIM 2008: 165-176 - [c30]Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor:
Copeland voting: ties matter. AAMAS (2) 2008: 983-990 - [c29]Edith Hemaspaandra, Henning Schnoor:
On the Complexity of Elementary Modal Logics. STACS 2008: 349-360 - [i31]Edith Hemaspaandra, Henning Schnoor:
On the Complexity of Elementary Modal Logics. CoRR abs/0802.1884 (2008) - [i30]Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
Generalized Modal Satisfiability. CoRR abs/0804.2729 (2008) - [i29]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Llull and Copeland Voting Computationally Resist Bribery and Control. CoRR abs/0809.4484 (2008) - 2007
- [j27]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Anyone but him: The complexity of precluding an alternative. Artif. Intell. 171(5-6): 255-285 (2007) - [j26]Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi:
Complexity results in graph reconstruction. Discret. Appl. Math. 155(2): 103-118 (2007) - [j25]Edith Hemaspaandra, Lane A. Hemaspaandra:
Dichotomy for voting systems. J. Comput. Syst. Sci. 73(1): 73-83 (2007) - [c28]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Llull and Copeland Voting Broadly Resist Bribery and Control. AAAI 2007: 724-730 - [c27]Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe:
On the Complexity of Kings. FCT 2007: 328-340 - [c26]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. IJCAI 2007: 1308-1314 - [i28]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Copeland Voting Fully Resists Constructive Control. CoRR abs/0711.4759 (2007) - 2006
- [j24]Edith Hemaspaandra, Jörg Rothe, Holger Spakowski:
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. RAIRO Theor. Informatics Appl. 40(1): 75-91 (2006) - [c25]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
The Complexity of Bribery in Elections. AAAI 2006: 641-646 - [c24]Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
Generalized Modal Satisfiability. STACS 2006: 500-511 - [i27]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. CoRR abs/cs/0608057 (2006) - [i26]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
How Hard Is Bribery in Elections? CoRR abs/cs/0608081 (2006) - [i25]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
A Richer Understanding of the Complexity of Election Systems. CoRR abs/cs/0609112 (2006) - 2005
- [j23]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Extending Downward Collapse from 1-versus-2 Queries to m-versus-m + 1 Queries. SIAM J. Comput. 34(6): 1352-1369 (2005) - [j22]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
All superlinear inverse schemes are coNP-hard. Theor. Comput. Sci. 345(2-3): 345-358 (2005) - [j21]Edith Hemaspaandra, Holger Spakowski, Jörg Vogel:
The complexity of Kemeny elections. Theor. Comput. Sci. 349(3): 382-391 (2005) - [c23]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Anyone but Him: The Complexity of Precluding an Alternative. AAAI 2005: 95-101 - [c22]Michael Bauland, Edith Hemaspaandra:
Isomorphic Implication. MFCS 2005: 119-130 - [i24]Edith Hemaspaandra, Lane A. Hemaspaandra:
Dichotomy for Voting Systems. CoRR abs/cs/0504075 (2005) - [i23]Edith Hemaspaandra, Lane A. Hemaspaandra, Osamu Watanabe:
The Complexity of Kings. CoRR abs/cs/0506055 (2005) - [i22]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Anyone but Him: The Complexity of Precluding an Alternative. CoRR abs/cs/0507027 (2005) - 2004
- [c21]Edith Hemaspaandra, Holger Spakowski, Mayur Thakur:
Complexity of Cycle Length Modularity Problems in Graphs. LATIN 2004: 509-518 - [c20]Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi:
Complexity Results in Graph Reconstruction. MFCS 2004: 287-297 - [c19]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
All Superlinear Inverse Schemes Are coNP-Hard. MFCS 2004: 368-379 - [c18]Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism. STACS 2004: 164-175 - [i21]Michael Bauland, Edith Hemaspaandra:
Isomorphic Implication. CoRR abs/cs/0412062 (2004) - [i20]Edith Hemaspaandra:
Dichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas. CoRR cs.CC/0406006 (2004) - [i19]Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi:
Complexity Results in Graph Reconstruction. CoRR cs.CC/0410021 (2004) - [i18]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
All Superlinear Inverse Schemes are coNP-Hard. CoRR cs.CC/0410023 (2004) - 2003
- [i17]Edith Hemaspaandra, Holger Spakowski, Mayur Thakur:
Complexity of Cycle Length Modularity Problems in Graphs. CoRR cs.CC/0306131 (2003) - [i16]Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism. CoRR cs.CC/0306134 (2003) - 2002
- [j20]Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand:
Almost-Everywhere Superiority for Quantum Polynomial Time. Inf. Comput. 175(2): 171-181 (2002) - [j19]Edith Hemaspaandra, Gerd Wechsung:
The Minimization Problem for Boolean Formulas. SIAM J. Comput. 31(6): 1948-1958 (2002) - [c17]Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction. CSL 2002: 412-426 - [c16]Edith Hemaspaandra, Jörg Rothe, Holger Spakowski:
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. WG 2002: 258-269 - [i15]Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction. CoRR cs.CC/0202036 (2002) - 2001
- [j18]Edith Hemaspaandra:
The Complexity of Poor Man's Logic. J. Log. Comput. 11(4): 609-622 (2001) - [i14]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Using the No-Search Easy-Hard Technique for Downward Collapse. CoRR cs.CC/0106037 (2001) - [i13]Edith Hemaspaandra, Jörg Rothe, Holger Spakowski:
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. CoRR cs.CC/0110025 (2001) - 2000
- [c15]Edith Hemaspaandra:
Modal Satisfiability Is in Deterministic Linear Space. CSL 2000: 332-342 - [c14]Edith Hemaspaandra, Lane A. Hemaspaandra:
Computational Politics: Electoral Systems. MFCS 2000: 64-83 - [c13]Edith Hemaspaandra:
The Complexity of Poor Man's Logic. STACS 2000: 230-242
1990 – 1999
- 1999
- [j17]Edith Hemaspaandra:
On the Power of Positive Turing Reductions. J. Univers. Comput. Sci. 5(12): 828-832 (1999) - [c12]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries. STACS 1999: 269-280 - [i12]Edith Hemaspaandra:
On the Power of Positive Turing Reductions. CoRR cs.CC/9906028 (1999) - [i11]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 cs.CC/9907036 (1999) - [i10]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Raising NP Lower Bounds to Parallel NP Lower Bounds. CoRR cs.CC/9907039 (1999) - [i9]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 cs.CC/9910002 (1999) - [i8]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
R1-ttSN(NP) Distinguishes Robust Many-One and Turing Completeness. CoRR cs.CC/9910003 (1999) - [i7]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
An Introduction to Query Order. CoRR cs.CC/9910004 (1999) - [i6]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Query Order and the Polynomial Hierarchy. CoRR cs.CC/9910005 (1999) - [i5]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
A Downward Collapse within the Polynomial Hierarchy. CoRR cs.CC/9910007 (1999) - [i4]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Translating Equality Downwards. CoRR cs.CC/9910008 (1999) - [i3]Edith Hemaspaandra:
The Complexity of Poor Man's Logic. CoRR cs.LO/9911014 (1999) - [i2]Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand:
Almost-Everywhere Superiority for Quantum Computing. CoRR quant-ph/9910033 (1999) - 1998
- [j16]Edith Hemaspaandra, Jörg Rothe:
Recognizing when Greed can Approximate Maximum Independent Sets is Complete for Parallel Access to NP. Inf. Process. Lett. 65(3): 151-156 (1998) - [j15]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Query Order and the Polynomial Hierarchy. J. Univers. Comput. Sci. 4(6): 574-588 (1998) - [j14]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
RS N1-tt (NP) Distinguishes Robust Many-One and Turing Completeness. Theory Comput. Syst. 31(3): 307-325 (1998) - [j13]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
A Downward Collapse within the Polynomial Hierarchy. SIAM J. Comput. 28(2): 383-393 (1998) - [j12]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 29(3): 10-22 (1998) - [i1]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Downward Collapse from a Weaker Hypothesis. CoRR cs.CC/9808002 (1998) - 1997
- [j11]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
An Introduction to Query Order. Bull. EATCS 63 (1997) - [j10]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 44(6): 806-825 (1997) - [j9]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Raising NP lower bounds to parallel NP lower bounds. SIGACT News 28(2): 2-13 (1997) - [c11]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness. CIAC 1997: 49-60 - [c10]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Query Order in the Polynomial Hierarchy. FCT 1997: 222-232 - [c9]Edith Hemaspaandra, Gerd Wechsung:
The Minimization Problem for Boolean Formulas. FOCS 1997: 575-584 - [c8]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: 214-224 - [c7]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
A Downward Translation in the Polynomial Hierarchy. STACS 1997: 319-328 - 1996
- [j8]Edith Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman:
P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility. J. Comput. Syst. Sci. 53(2): 194-209 (1996) - [j7]Edith Hemaspaandra:
The Price of Universality. Notre Dame J. Formal Log. 37(2): 174-203 (1996) - 1995
- [j6]Harry Buhrman, Edith Hemaspaandra, Luc Longpré:
SPARSE Reduces Conjunctively to TALLY. SIAM J. Comput. 24(4): 673-681 (1995) - 1994
- [j5]Edith Hemaspaandra:
Census Techniques Collapse Space Classes. Inf. Process. Lett. 51(2): 79-84 (1994) - [j4]Edith Hemaspaandra, Lane A. Hemaspaandra:
Quasi-injective Reductions. Theor. Comput. Sci. 123(2): 407-413 (1994) - [c6]Edith Hemaspaandra:
Complexity Transfer for Modal Logic (Extended Abstract). LICS 1994: 164-173 - 1993
- [j3]Harry Buhrman, Edith Spaan, Leen Torenvliet:
The Relative Power of Logspace and Polynomial Time Reductions. Comput. Complex. 3: 231-244 (1993) - [j2]Patrick Blackburn, Edith Spaan:
A modal perspective on the computational complexity of attribute value grammar. J. Log. Lang. Inf. 2(2): 129-169 (1993) - [c5]Harry Buhrman, Luc Longpré, Edith Spaan:
SPARSE reduces conjunctively to TALLY. SCT 1993: 208-214 - 1992
- [c4]Harry Buhrman, Edith Spaan, Leen Torenvliet:
Bounded Reductions. Complexity Theory: Current Research 1992: 83-99 - 1991
- [c3]Sieger van Denneheuvel, Karen L. Kwast, Gerard R. Renardel de Lavalette, Edith Spaan:
Query Optimization Using Rewrite Rules. RTA 1991: 252-263 - [c2]Harry Buhrman, Edith Spaan, Leen Torenvliet:
Bounded Reductions. STACS 1991: 410-421 - 1990
- [c1]Edith Spaan:
Nexttime is not Necessary. TARK 1990: 241-256
1980 – 1989
- 1989
- [j1]Edith Spaan, Leen Torenvliet, Peter van Emde Boas:
Nondeterminism fairness and a fundamental analogy. Bull. EATCS 37: 186-193 (1989)
Coauthor Index
[j49] [j48] [j47] [j46] [j45] [c58] [i57] [c56] [j43] [j42] [i52] [i51] [j41] [p1] [r1] [j40] [j39] [c51] [c50] [j38] [j37] [c49] [c48] [i46] [i45] [c47] [c46] [c45] [c44] [c43] [i44] [i43] [i42] [i41] [c41] [c40] [i40] [i39] [i38] [i37] [j36] [j35] [c37] [i34] [j34] [j32] [c36] [i33] [j31] [j30] [j29] [c34] [c33] [i32] [c31] [i29] [j27] [j26] [j25] [c28] [c27] [c26] [i28] [c25] [i27] [i26] [i25] [j23] [j22] [c23] [i24] [i23] [i22] [c20] [c19] [i19] [i18] [j20] [i14] [c14] [c12] [i11] [i10] [i9] [i8] [i7] [i6] [i5] [i4] [i2] [j15] [j14] [j13] [j12] [i1] [j11] [j10] [j9] [c11] [c10] [c8] [c7] [j4]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
