Stop the war!Остановите войну!
for scientists:
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
- 2023
[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- 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 - [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 - [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]