Site-wide links

Scholarly Works

Edith Hemaspaandra
Professor

2011 Submissions

Published Conference Proceedings

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. *

Journal Paper

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. *

Journal Editor

Hemaspaandra, E., ed. Electronic Commerce Research. Berlin: Springer, 2011. Print. *

Hemaspaandra, E., ed. Journal of Universal Computer Science. Graz: n.p., 2011. Web. *

External Scholarly Fellowships

8/1/2011 - 7/31/2014
     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 ≠

2010 Submissions

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 Artificial Intelligence 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.