DEEN
Magazin Humboldt Kosmos Newsroom Newsletter

Suche

Preise und Stipendien Recherche im Humboldt-Netzwerk

Suche nach Tags

Prof. Dr. Lane A. Hemaspaandra

Profil

Derzeitige StellungProfessor W-3 und Äquivalente
FachgebietTheoretische Informatik,Politische Theorie
Keywordscomputational complexity theory, computational social choice, electoral control, heuristics and approximation, manipulation of voting systems

Aktuelle Kontaktadresse

LandUSA
OrtRochester
Universität/InstitutionUniversity of Rochester
Institut/AbteilungDepartment of Computer Science
Websitehttps://www.cs.rochester.edu/u/lane/

Gastgeber*innen während der Förderung

Prof. Dr. Jörg RotheInstitut für Informatik, Heinrich-Heine-Universität Düsseldorf, Düsseldorf
Beginn der ersten Förderung01.11.2005

Programm(e)

2006Friedrich Wilhelm Bessel-Forschungspreis-Programm

Projektbeschreibung der*des Nominierenden

Lane Hemaspaandra is one of the leading scientists in complexity theory. He has shaped this field like only very few others and made pathbreaking contributions to computational politics and to the complexity of voting, which is central to preference aggregation and decision-making in artificial intelligence, social choice theory, operations research, and economics. He initiated the theory of query order and studied semi-feasible computation, one-way functions, and network structure recovery problems. His research project in Germany is entitled "Complexity and Elections."

Publikationen (Auswahl)

2011Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe: The Shield that Never Was: Societies with Single-Peaked Preferences Are More Open to Manipulation and Control. In: Information and Computation, 2011, 89-107
2010Dorthea Baumeister, Gabor Erdelyi, Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe: Computational Aspects of Approval Voting. In: J. Laslier, M. Sanver, Handbook on Approval Voting. Springer, 2010. 199-251
2009Gabor Erdelyi, Lane A. Hemaspaandra, Joerg Rothe, Holger Spakowski: Frequency of Correctness versus Average Polynomial Time. In: Information Processing Letters, 2009, 946-949
2009Gabor Erdelyi, Lane A. Hemaspaandra, Joerg Rothe, Holger Spakowski: Generalized Juntas and NP-Hard Sets. In: Theoretical Computer Science, 2009, 3995-4000
2009Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. In: Mathematical Logic Quarterly, 2009, 397-424
2009Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe : Llull and Copeland Voting Computationally Resist Bribery and Control. In: Journal of Artificial Intelligence Research, 2009, 275-341
2008Lane A. Hemaspaandra, Joerg Rothe, Amitabh Saxena: Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for Worst-Case One-Way Functions. In: Theoretical Computer Science, 2008, 27-35
2007Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe: Anyone but Him: The Complexity of Precluding an Alternative. In: Artificial Intelligence, 2007, 255-285
2007Lane A. Hemaspaandra, Christopher Homan, Sven Kosub: Cluster Computing and the Power of Edge Recognition. In: Information and Computation, 2007, 1274-1293