| Advice for Semifeasible Sets and the Complexity-Theoretic Cost(lessness) of Algebraic Properties
| 2004-10-19 15:25:05.0 | 1 | Lane A. Hemaspaandra | Author | 471 |
| Algebraic Properties for Deterministic Selectivit
| 2004-08-04 15:04:13.0 | 1 | Lane A. Hemaspaandra | Author | 65 |
| Algebraic Properties for Selector Functions
| 2004-08-04 13:55:40.0 | 1 | Lane A. Hemaspaandra | Author | 117 |
| Algorithms from Complexity Theory: Polynomical-Time Operations for Complex Sets
| 2008-02-28 21:17:50.0 | 1 | Lane A. Hemachandra | Author | 218 |
| All Superlinear Inverse Schemes are coNP-Hard
| 2004-10-19 16:02:09.0 | 1 | Lane A. Hemaspaandra | Author | 542 |
| Almost-Everywhere Superiority for Quantum Polynomial Time
| 2004-08-06 16:43:15.0 | 1 | Lane A. Hemaspaandra | Author | 69 |
| Almost-Everywhere Superiority for Quantum Polynomial-Time Languages
| 2004-08-04 15:20:23.0 | 1 | Lane A. Hemaspaandra | Author | 126 |
| Anyone but Him: The Complexity of Precluding an Alternative
| 2005-10-27 15:21:54.0 | 1 | Lane A. Hemaspaandra | Author | 546 |
| Attacking and defending popular election systems
| 2013-05-20 15:09:06.506 | 1 | Lane A. Hemaspaandra | Thesis Advisor | 1163 |
| An Atypical Survey of Typical-Case Heuristic Algorithms
| 2012-11-08 10:32:58.419 | 1 | Lane A. Hemaspaandra | Author | 240 |
| Banishing Robust Turing Completeness
| 2008-02-07 21:19:26.0 | 1 | Lane A. Hemachandra | Author | 555 |
| Barbosa, Uniform Polynomial Time Bounds, and Promises
| 2011-06-06 16:24:07.099 | 1 | Lane A. Hemaspaandra | Author | 293 |
| Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
| 2010-04-27 14:32:04.106 | 1 | Lane A. Hemaspaandra | Author | 1109 |
| Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
| 2013-10-14 11:49:28.766 | 1 | Lane A. Hemaspaandra | Author | 1354 |
| Bypassing Combinatorial Protections: Polynomial-Time Algortihms for Single-Peaked Electorates
| 2010-06-11 10:56:53.541 | 1 | Lane A. Hemaspaandra | Author | 1109 |
| Cluster Computing and the Power of Edge Recognition
| 2005-10-07 13:50:38.0 | 1 | Lane A. Hemaspaandra | Author | 442 |
| Collapsing Degrees via Strong Computation
| 2008-01-31 19:29:03.0 | 1 | Lane A. Hemachandra | Author | 895 |
| Competing Provers Yield Improved Karp-Lipton Collapse Results
| 2004-08-06 13:32:05.0 | 1 | Lane A. Hemaspaandra | Author | 86 |
| The Complexity of Computing the Size of an Interval
| 2005-02-15 16:57:34.0 | 1 | Lane A. Hemaspaandra | Author | 243 |
| The Complexity of Finding Top-Toda-Equivalence-Class Members
| 2004-08-04 20:57:05.0 | 1 | Lane A. Hemaspaandra | Author | 111 |
| The Complexity of Kings
| 2005-06-15 15:04:41.0 | 1 | Lane A. Hemaspaandra | Author | 125 |
| The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates
| 2011-05-31 14:22:33.561 | 1 | Lane A. Hemaspaandra | Author | 391 |
| The Complexity of Online Manipulation of Sequential Elections
| 2012-03-23 10:05:48.564 | 1 | Lane A. Hemaspaandra | Author | 941 |
| The Complexity of Online Manipulation of Sequential Elections
| 2012-10-24 09:29:22.227 | 1 | Lane A. Hemaspaandra | Author | 1165 |
| The Complexity of Power-Index Comparison
| 2008-03-03 20:35:34.0 | 1 | Lane Hemaspaandra | Author | 580 |
