URCS Theory research group featured in Communications of the ACM

Piotr Faliszewski (Ph.D. '08), URCS Professor Lane A. Hemaspaandra, and RIT Professor Edith Hemaspaandra are featured as the cover story for this month's Communications of the Association for Computing Machinery for their article, "Using Complexity to Protect Elections." Their work argues that though reasonable election systems cannot make manipulation impossible, that using complexity, they can make manipulation computationally infeasible.