Efficient FPGA implementation of steerable Gaussian smoothers A Joginipelly, A Varela, D Charalampidis, R Schott, Z Fitzsimmons Proceedings of the 2012 44th Southeastern Symposium on System Theory (SSST …, 2012 | 31 | 2012 |
Incomplete preferences in single-peaked electorates Z Fitzsimmons, M Lackner Journal of Artificial Intelligence Research 67, 797-833, 2020 | 18 | 2020 |
Single-Peaked Consistency for Weak Orders Is Easy Z Fitzsimmons Fifteenth Conference on Theoretical Aspects of Rationality and Knowledge …, 2015 | 17 | 2015 |
Control in the Presence of Manipulators: Cooperative and Competitive Cases Z Fitzsimmons, E Hemaspaandra, LA Hemaspaandra Twenty-Third International Joint Conference on Artificial Intelligence, 113-119, 2013 | 15 | 2013 |
Complexity of manipulative actions when voting with ties Z Fitzsimmons, E Hemaspaandra Algorithmic Decision Theory: 4th International Conference, ADT 2015 …, 2015 | 13 | 2015 |
Modeling Single-Peakedness for Votes with Ties Z Fitzsimmons, E Hemaspaandra STAIRS 2016: Proceedings of the Eighth European Starting AI Researcher …, 2016 | 9 | 2016 |
Manipulation complexity of same-system runoff elections Z Fitzsimmons, E Hemaspaandra, LA Hemaspaandra Annals of Mathematics and Artificial Intelligence 77, 159-189, 2016 | 7* | 2016 |
Representative proxy voting E Anshelevich, Z Fitzsimmons, R Vaish, L Xia Proceedings of the AAAI Conference on Artificial Intelligence 35 (6), 5086-5093, 2021 | 6 | 2021 |
Selecting voting locations for fun and profit Z Fitzsimmons, O Lev arXiv preprint arXiv:2003.06879, 2020 | 6 | 2020 |
High-multiplicity election problems Z Fitzsimmons, E Hemaspaandra Autonomous Agents and Multi-Agent Systems 33, 383-402, 2019 | 6 | 2019 |
Insight into voting problem complexity using randomized classes Z Fitzsimmons, E Hemaspaandra arXiv preprint arXiv:2204.12856, 2022 | 5 | 2022 |
Very hard electoral control problems Z Fitzsimmons, E Hemaspaandra, A Hoover, DE Narváez Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1933-1940, 2019 | 5 | 2019 |
Election score can be harder than winner Z Fitzsimmons, E Hemaspaandra arXiv preprint arXiv:1806.08763, 2018 | 4 | 2018 |
The Complexity of Succinct Elections Z Fitzsimmons, E Hemaspaandra Thirty-First AAAI Conference on Artificial Intelligence, 2017 | 4 | 2017 |
Kemeny consensus complexity Z Fitzsimmons, E Hemaspaandra arXiv preprint arXiv:2105.08540, 2021 | 3 | 2021 |
Using weighted matching to solve 2-approval/veto control and bribery Z Fitzsimmons, E Hemaspaandra arXiv preprint arXiv:2305.16889, 2023 | 1 | 2023 |
Control in the presence of manipulators: cooperative and competitive cases Z Fitzsimmons, E Hemaspaandra, LA Hemaspaandra Autonomous Agents and Multi-Agent Systems 34 (2), 52, 2020 | 1 | 2020 |
On the Hardness of Fair Allocation under Ternary Valuations Z Fitzsimmons, V Viswanathan, Y Zick arXiv preprint arXiv:2403.00943, 2024 | | 2024 |
Complexity of conformant election manipulation Z Fitzsimmons, E Hemaspaandra International Symposium on Fundamentals of Computation Theory, 176-189, 2023 | | 2023 |
Election-Attack Complexity for More Natural Models Z Fitzsimmons Rochester Institute of Technology, 2017 | | 2017 |