Seguir
Edith Hemaspaandra
Edith Hemaspaandra
Professor of Computer Science, RIT
Dirección de correo verificada de cs.rit.edu
Título
Citado por
Citado por
Año
Complexity of modal logics
E Spaan
326*1993
Anyone but him: The complexity of precluding an alternative
E Hemaspaandra, LA Hemaspaandra, J Rothe
Artificial Intelligence 171 (5-6), 255-285, 2007
2862007
How hard is bribery in elections?
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
Journal of artificial intelligence research 35, 485-532, 2009
2832009
Llull and Copeland voting computationally resist bribery and constructive control
P Faliszewski, E Hemaspaandra, LA Hemaspaandra, J Rothe
Journal of Artificial Intelligence Research 35, 275-341, 2009
2572009
Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP
E Hemaspaandra, LA Hemaspaandra, J Rothe
Journal of the ACM (JACM) 44 (6), 806-825, 1997
2471997
The complexity of Kemeny elections
E Hemaspaandra, H Spakowski, J Vogel
Theoretical Computer Science 349 (3), 382-391, 2005
2352005
Using complexity to protect elections
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
Communications of the ACM 53 (11), 74-82, 2010
2152010
The shield that never was: Societies with single-peaked preferences are more open to manipulation and control
P Faliszewski, E Hemaspaandra, LA Hemaspaandra, J Rothe
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and …, 2009
1782009
Dichotomy for voting systems
E Hemaspaandra, LA Hemaspaandra
Journal of Computer and System Sciences 73 (1), 73-83, 2007
1582007
Multimode control attacks on elections
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
Journal of Artificial Intelligence Research 40, 305-351, 2011
1492011
A richer understanding of the complexity of election systems
P Faliszewski, E Hemaspaandra, LA Hemaspaandra, J Rothe
Fundamental problems in computing: Essays in honor of Professor Daniel J …, 2009
1342009
Copeland voting: Ties matter
P Faliszewski, E Hemaspaandra, H Schnoor
Proceedings of the 7th international joint conference on Autonomous agents …, 2008
1272008
The complexity of manipulative attacks in nearly single-peaked electorates
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
Proceedings of the 13th conference on theoretical aspects of rationality and …, 2011
1192011
Hybrid Elections Broaden Complexity‐Theoretic Resistance to Control
E Hemaspaandra, LA Hemaspaandra, J Rothe
Mathematical Logic Quarterly 55 (4), 397-424, 2009
1112009
A modal perspective on the computational complexity of attribute value grammar
P Blackburn, E Spaan
Journal of Logic, Language and Information 2, 129-169, 1993
1091993
The price of universality
E Hemaspaandra
Notre Dame Journal of Formal Logic 37 (2), 174-203, 1996
1001996
The complexity of bribery in elections
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
AAAI 6, 641-646, 2006
962006
Bypassing combinatorial protections: Polynomial-time algorithms for single-peaked electorates
F Brandt, M Brill, E Hemaspaandra, LA Hemaspaandra
Journal of Artificial Intelligence Research 53, 439-496, 2015
902015
Computational aspects of approval voting
D Baumeister, G Erdélyi, E Hemaspaandra, LA Hemaspaandra, J Rothe
Handbook on approval voting, 199-251, 2010
762010
Bypassing combinatorial protections: Polynomial-time algorithms for single-peaked electorates
F Brandt, M Brill, E Hemaspaandra, L Hemaspaandra
Proceedings of the AAAI Conference on Artificial Intelligence 24 (1), 715-722, 2010
752010
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20