Edith Hemaspaandra Headshot

Edith Hemaspaandra

Professor
Department of Computer Science
Golisano College of Computing and Information Sciences

585-475-5194
Office Hours
On sabbatical!
Office Location

Edith Hemaspaandra

Professor
Department of Computer Science
Golisano College of Computing and Information Sciences

Education

BS, MS, Ph.D. in Computer Science, University of Amsterdam (the Netherlands)

585-475-5194

Areas of Expertise

Currently Teaching

CSCI-664
3 Credits
This course provides an introduction to computational complexity theory. It covers the P=NP problem, time and space complexity, randomization, approximability, and relativization. Course offered every other year.
CSCI-263
3 Credits
This course provides a challenging introduction to the theory of computation with an emphasis on problem solving. Topics include formal languages, grammars, auto-mata theory, computability, and complexity.

Select Scholarship

Published Conference Proceedings
Fitzsimmons, Zack and Edith Hemaspaandra. "High-Multiplicity Election Problems." Proceedings of the Seventeenth International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2018). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2018. Web.
Hemaspaandra, Edith, et al. "The Robustness of LWPP and WPP, with an Application to Graph Reconstruction." Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Ed. . Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. Web.
Fitzsimmons, Z. and E. Hemaspaandra. "The Complexity of Succinct Elections." Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI 2017). San Francisco, CA: AAAI, 2017. Web.
Hemaspaandra, E. and H. Schnoor. "Dichotomy for Pure Scoring Rules Under Manipulative Electoral Actions." Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016). Ed. . the Hague, the Netherlands: n.p., 2016. Web.
Fitzsimmons, Z. and E. Hemaspaandra. "Modeling Single-Peakedness for Votes with Ties." Proceedings of the Eighth European Starting AI Researcher Symposium (STAIRS 2016). Ed. . the Hague, the Netherlands: n.p., 2016. Web.
Fitzsimmons, Z. and Hemaspaandra, E. "Complexity of Manipulative Actions When Voting with Ties." Proceedings of the Fourth International Conference on Algorithmic Decision Theory. Ed. Toby Walsh. Lexington, KY: n.p., 2015. Print.
Erdelyi, G., Hemaspaandra, E., and Hemaspaandra, L. "More Natural Models of Electoral Control by Partition." Proceedings of the Fourth International Conference on Algorithmic Decision Theory. Ed. Toby Walsh. Lexington, KY: n.p., 2015. Print.
Hemaspaandra, E., L. Hemaspaandra, and H. Schnoor. "A Control Dichotomy for Pure Scoring Rules." Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI 2014). Ed. Unknown. Quebec City, Canada: n.p., 2014. Web.
Erdelyi, G., E. Hemaspaandra, and L. Hemaspaandra. "Bribery and Voter Control Under Voting-Rule Uncertainty." Proceedings of the Thirteenth International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2014). Ed. Unknown. Paris, France: n.p., 2014. Web.
Fitzsimmons, Z., E. Hemaspaandra, and L. Hemaspaandra. "Control in the Presence of Manipulators: Cooperative and Competitive Cases." Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (IJCAI 2013). Beijing, China: n.p., 2013. Web.
Faliszewski, P., E. Hemaspaandra, and L. Hemaspaandra. "Weighted Electoral Control." Proceedings of the Twelfth International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2013). Saint Paul, MN: n.p., 2013. Web.
Hemaspaandra, E., L. Hemaspaandra, and C. Menton. "Search versus Decision for Election Manipulation Problems." Proceedings of the 30th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2013). Kiel, Germany: n.p., 2013. Web.
Hemaspaandra, E., L. Hemaspaandra, and J. Rothe. "The Complexity of Online Manipulation of Sequential Elections." Proceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge (TARK XIV). Chennai, IN: n.p., 2013. Web.
Hemaspaandra, E. and H. Schnoor. "A Universally Defined Undecidable Unimodal Logic." Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS 2011). Ed. Murlak and Sankowski. Berlin: Springer, 2011. Print.
Hemaspaandra, E. and H. Schnoor. "Minimization for Generalized Boolean Formulas." Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011). Ed. Toby Walsh. Menlo Park, CA: AAAI Press, 2011. Web.
Faliszewski, P., E. Hemaspaandra, and L. Hemaspaandra. "The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates." Proceedings of the Theoretical Aspects of Rationality and Knowledge (TARK XIII). Ed. Apt. Groningen: ACM, 2011. Web.
External Scholarly Fellowships/National Review Committee
10/1/2018 - 9/30/2021
     NSF-DUE IUSE
     Amount: $299,471
10/1/2018 - 3/31/2019
     Alexander von Humboldt Foundation: Renewed Research Stay
     Amount: 16,150 euros
8/1/2011 - 7/31/2015
     NSF
     Amount: $249,264
1/1/2007 - 12/31/2012
     Humboldt Foundation
     Amount: 50,000 euros
7/1/2007 - 6/30/2011
     NSF
     Amount: $214,445
Journal Paper
Hemaspaandra, E., L. Hemaspaandra, and J. Rothe. "The Complexity of Controlling Candidate-Sequential Elections." Theoretical Computer Science 678. (2017): 14-21. Print.
Hemaspaandra, E., L. Hemaspaandra, and J. Rothe. "The Complexity of Online Voter Control in Sequential Elections." Journal of Autonomous Agents and Multi-Agent Systems 31. (2017): 1055—1076. Print.
Hemaspaandra, E., L. Hemaspaandra, and J. Rothe. "The Complexity of Online Voter Control in Sequential Elections." Journal of Autonomous Agents and Multi-Agent Systems. (2016): 1-22. Web.
Fitzsimmons, Z., E. Hemaspaandra, and L. Hemaspaandra. "Manipulation of Same-System Runoff Elections." Annals of Mathematics and Artificial Intelligence 77. 3-4 (2016): 159—189. Print.
Brandt, F., et al. "Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates." Journal of Artificial Intelligence Research 53. (2015): 439-496. Web.
Faliszewski, P., Hemaspaandra, E., and Hemaspaandra, L. "Weighted Electoral Control." Journal of Artificial Intelligence Research 52. (2015): 507-542. Web.
Hemaspaandra, E., L. Hemaspaandra, and J. Rothe. "The Complexity of Online Manipulation of Sequential Elections." Journal of Computer and System Sciences 80. 4 (2014): 697-710. Print.
Faliszewski, P., E. Hemaspaandra, and L. Hemaspaandra. "The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates." Artificial Intelligence 207. (2014): 69-99. Print.
Faliszewski, P., et al. "The Shield that Never Was: Societies with Single-Peaked Preferences Are More Open to Manipulation and Control." Information and Computation 209. 2 (2011): 89-107. Print.
Faliszewski, P., E. Hemaspaandra, and L. Hemaspaandra. "Multimode Control Attacks on Elections." Journal of Artificial Intelligence Research 40. (2011): 305-351. Print.
Book Chapter
Caragiannis, I., E. Hemaspaandra, and L. Hemaspaandra. "Dodgson's Rule and Young's Rule." Handbook of Computational Social Choice. Cambridge, England: Handbook of Computational Social Choice, 2016. 103-126. Print.
Hemaspaandra, E., Hemaspaandra, L., and Rothe, J. "The Complexity of Manipulative Actions in Single-Peaked Societies." Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, & Fair Division. ., .: Springer, 2015. 327-360. Print.
Invited Article/Publication
Faliszewski, P., Hemaspaandra, E., and Hemaspaandra, L. "The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates." Proceedings of the 24th International Joint Conference on Artificial Intelligence. (2015). Web.
Journal Editor
Hemaspaandra, E., ed. Electronic Commerce Research (2006-2014). Berlin: Springer, 2014. Print.
Hemaspaandra, E., ed. Journal of Universal Computer Science (1998-). Graz: n.p., 2016. Web.
Published Article
Faliszewski, Piotr, Edith Hemaspaandra, and Lane A. Hemaspaandra. “Using Complexity to Protect Elections.” Communications of the ACM, 53.11 (2010): 74-82. Print. É  *
Hemaspaandra, Edith, Henning Schnoor, and Ilka Schnoor. “Generalized Modal Satisfiability.” Journal of Computer and System Sciences, 76.7 (2010): 561-578. Print. É  *
Brandt, Felix, Markus Brill, Edith Hemaspaandra, and Lane A. Hemaspaandra. “Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.” 24th AAAI Conference on Artificial Intelligence and the 22nd Innovative Applications of ArtificialIntelligence Conference, 11-15 July 2010. 715-722. Print. É  *
Faliszewski, Piotr, Edith Hemaspaandra, and Henning Schnoor. “Manipulation of Copeland Elections.” Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, 10-14 May 2010. 367-374. Print.