20 citations · 184 across the 69 of their papers we have counts for
85 papers
Fortune's Bounty: Taming Complexity by Trimming Trees --- A Hands-On Problem-Solving Experience in Advanced Complexity Suitable for Introductory Students
Kimberly Fluet, Lane A. Hemaspaandra, Christopher M. Homan
This article provides an assignment designed to let undergraduate students who have completed an undergraduate CS1/CS2 sequence try to themselves, in groups, prove Fortune's Theore…
Linked Fates: How Small of an Ambiguity Increase Can Make the Difference Between Equaling and Separating from P?
Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra +3
Ambiguity-bounded versions of , denoted , bound by the number of accepting paths the nondeterministic polynomial-time Turing machine ca…
Axiomatic Tools for Separating Electoral Control Types, with Applications to Concrete Systems
Michael C. Chavrimootoo, Ian Clingerman, Ethan Ferland +5
Electoral control is the study of whether an attacker, by structural changes on an election such as adding/deleting/partitioning voters or candidates, can affect the winner in some…
Search versus Search for Collapsing Electoral Control Types
Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra +3
Electoral control types are ways of trying to change the outcome of elections by altering aspects of their composition and structure [BTT92]. We say two compatible (i.e., having th…
Separating and Collapsing Electoral Control Types
Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra +3
[HHM20] discovered, for 7 pairs (C,D) of seemingly distinct standard electoral control types, that C and D are identical: For each input I and each election system, I is a Yes inst…
Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting
Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah +1
Cai and Hemachandra used iterative constant-setting to prove that Few P (and thus that FewP P). In this paper, we note that there is a tensi…