| Quantum cryptography: A survey D Bruss, G Erdélyi, T Meyer, T Riege, J Rothe ACM Computing Surveys (CSUR) 39 (2), 6-es, 2007 | 119 | 2007 |
| 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 | 100 | 2009 |
| Computational aspects of approval voting D Baumeister, G Erdélyi, E Hemaspaandra, LA Hemaspaandra, J Rothe Handbook on approval voting, 199-251, 2010 | 76 | 2010 |
| Control complexity in Bucklin and fallback voting: A theoretical analysis G Erdélyi, MR Fellows, J Rothe, L Schend Journal of Computer and System Sciences 81 (4), 632-660, 2015 | 55 | 2015 |
| Control complexity in fallback voting G Erdélyi, L Piras, J Rothe arXiv preprint arXiv:1004.3398, 2010 | 52 | 2010 |
| Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules D Baumeister, G Erdélyi, OJ Erdélyi, J Rothe Mathematical Social Sciences 76, 19-30, 2015 | 50 | 2015 |
| Computational aspects of nearly single-peaked electorates G Erdélyi, M Lackner, A Pfandler Proceedings of the AAAI Conference on Artificial Intelligence 27 (1), 283-289, 2013 | 48 | 2013 |
| The complexity of voter partition in Bucklin and fallback voting: Solving three open problems G Erdélyi, L Piras, J Rothe The 10th International Conference on Autonomous Agents and Multiagent …, 2011 | 47 | 2011 |
| More natural models of electoral control by partition G Erdélyi, E Hemaspaandra, LA Hemaspaandra Algorithmic Decision Theory: 4th International Conference, ADT 2015 …, 2015 | 44 | 2015 |
| The complexity of probabilistic lobbying D Binkele-Raible, G Erdélyi, H Fernau, J Goldsmith, N Mattei, J Rothe Discrete Optimization 11, 1-21, 2014 | 35 | 2014 |
| How hard is it to bribe the judges? A study of the complexity of bribery in judgment aggregation D Baumeister, G Erdélyi, J Rothe Algorithmic Decision Theory: Second International Conference, ADT 2011 …, 2011 | 35 | 2011 |
| Computational aspects of nearly single-peaked electorates G Erdélyi, M Lackner, A Pfandler Journal of Artificial Intelligence Research 58, 297-337, 2017 | 33 | 2017 |
| Computational aspects of manipulation and control in judgment aggregation D Baumeister, G Erdélyi, OJ Erdélyi, J Rothe Algorithmic Decision Theory: Third International Conference, ADT 2013 …, 2013 | 32 | 2013 |
| On approximating optimal weighted lobbying, and frequency of correctness versus average-case polynomial time G Erdélyi, LA Hemaspaandra, J Rothe, H Spakowski International Symposium on Fundamentals of Computation Theory, 300-311, 2007 | 32 | 2007 |
| The complexity of bribery and control in group identification G Erdélyi, C Reger, Y Yang Autonomous Agents and Multi-Agent Systems 34 (1), 8, 2020 | 31 | 2020 |
| The complexity of probabilistic lobbying G Erdélyi, H Fernau, J Goldsmith, N Mattei, D Raible, J Rothe International Conference on Algorithmic Decision Theory, 86-97, 2009 | 31 | 2009 |
| Control complexity in Bucklin and fallback voting: An experimental analysis G Erdélyi, MR Fellows, J Rothe, L Schend Journal of Computer and System Sciences 81 (4), 661-670, 2015 | 28 | 2015 |
| Manipulation under voting rule uncertainty. E Elkind, G Erdélyi AAMAS, 627-634, 2012 | 27 | 2012 |
| Generalized juntas and NP-hard sets G Erdélyi, LA Hemaspaandra, J Rothe, H Spakowski Theoretical Computer Science 410 (38-40), 3995-4000, 2009 | 24 | 2009 |
| Sincere-strategy preference-based approval voting broadly resists control G Erdélyi, M Nowak, J Rothe Mathematical Foundations of Computer Science 2008: 33rd International …, 2008 | 24 | 2008 |
