Jörg Rothe
Jörg Rothe
Professor of Computer Science, Heinrich-Heine-Universität Düsseldorf
Adresse e-mail validée de cs.uni-duesseldorf.de - Page d'accueil
Titre
Citée par
Citée par
Année
Texts in Theoretical Computer Science An EATCS Series
A Board, GAMBCS Calude, ACDHJ Hartmanis, T Henzinger, ...
2532005
Anyone but him: The complexity of precluding an alternative
E Hemaspaandra, LA Hemaspaandra, J Rothe
Artificial Intelligence 171 (5-6), 255-285, 2007
2522007
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
2282009
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
2261997
Elasto-magnetic sensor utilization on steel cable stress measurement
S Sumitro, A Jarosevic, ML Wang
The First fib Congress, Concrete Structures in the 21th Century, Osaka, 13-19, 2002
167*2002
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
Information and Computation 209 (2), 89-107, 2011
1532011
Control and Bribery in Voting.
P Faliszewski, J Rothe
Handbook of computational social choice, 146-168, 2016
1412016
Exact complexity of the winner problem for Young elections
J Rothe, H Spakowski, J Vogel
Theory of Computing Systems 36 (4), 375-386, 2003
1412003
A richer understanding of the complexity of election systems
P Faliszewski, E Hemaspaandra, LA Hemaspaandra, J Rothe
Fundamental problems in computing, 375-406, 2009
1312009
The cost of stability in coalitional games
Y Bachrach, E Elkind, R Meir, D Pasechnik, M Zuckerman, J Rothe, ...
International Symposium on Algorithmic Game Theory, 122-134, 2009
1092009
Hybrid Elections Broaden Complexity‐Theoretic Resistance to Control
E Hemaspaandra, LA Hemaspaandra, J Rothe
Mathematical Logic Quarterly 55 (4), 397-424, 2009
972009
Sincere‐Strategy Preference‐Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control
G Erdélyi, M Nowak, J Rothe
Mathematical Logic Quarterly 55 (4), 425-443, 2009
942009
Campaigns for lazy voters: Truncated ballots
D Baumeister, P Faliszewski, J Lang, J Rothe
872012
Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules
D Baumeister, J Rothe
Information Processing Letters 112 (5), 186-190, 2012
802012
Economics and computation
J Rothe
Springer, 2015
782015
Quantum cryptography: A survey
D Bruss, G Erdélyi, T Meyer, T Riege, J Rothe
ACM Computing Surveys (CSUR) 39 (2), 6-es, 2007
752007
Investigating topological chaos by elementary cellular automata dynamics
G Cattaneo, M Finelli, L Margara
Theoretical computer science 244 (1-2), 219-241, 2000
732000
Computational aspects of approval voting
D Baumeister, G Erdélyi, E Hemaspaandra, LA Hemaspaandra, J Rothe
Handbook on Approval Voting, 199-251, 2010
692010
Computational complexity and approximability of social welfare optimization in multiagent resource allocation
NT Nguyen, TT Nguyen, M Roos, J Rothe
Autonomous agents and multi-agent systems 28 (2), 256-289, 2014
622014
Llull and Copeland voting broadly resist bribery and control
P Faliszewski, E Hemaspaandra, LA Hemaspaandra, J Rothe
AAAI 7, 724-730, 2007
592007
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20