1.7k citations
- D. Schaile11 profiles108 · h 87
- S. Malik4 profiles108 · h 96
- S. Desai5 profiles102 · h 89
- R. McCarthy11 profiles101 · h 75
- D. Brown4 profiles100 · h 67
- G. Davies4 profiles95 · h 107
- A. Meyer4 profiles94 · h 142
- A. Bean2 profiles92 · h 120
- A. Quadt11 profiles92 · h 86
- A. Sopczak2 profiles92 · h 83
- B. Åsman9 profiles92 · h 98
- C. Bélanger-Champagne2 profiles92 · h 92
- University of MichiganUS139 papers
- Northwestern UniversityUS121 papers
- Michigan State UniversityUS115 papers
- Fermi National Accelerator LaboratoryUS113 papers
- University of Maryland, College ParkUS110 papers
- Joint Institute for Nuclear ResearchRU109 papers
- University of WashingtonUS106 papers
- Columbia UniversityUS103 papers
- Imperial College LondonGB103 papers
- Lomonosov Moscow State UniversityRU103 papers
- Louisiana Tech UniversityUS103 papers
- Sungkyunkwan UniversityKR101 papers
5 papers · 1 filter
The Complexity of Power-Index Comparison
Piotr Faliszewski, Lane A. Hemaspaandra
We study the complexity of the following problem: Given two weighted voting games G' and G'' that each contain a player p, in which of these games is p's power index value higher?…
Query-Monotonic Turing Reductions
Lane A. Hemaspaandra, Mayur Thakur
We study reductions that limit the extreme adaptivity of Turing reductions. In particular, we study reductions that make a rapid, structured progression through the set to which th…
Cluster Computing and the Power of Edge Recognition
Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub
We study the robustness--the invariance under definition changes--of the cluster class CL#P [HHKW05]. This class contains each #P function that is computed by a balanced Turing mac…
Overhead-Free Computation, DCFLs, and CFLs
Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau
We study Turing machines that are allowed absolutely no space overhead. The only work space the machines have, beyond the fixed amount of memory implicit in their finite-state cont…
All Superlinear Inverse Schemes are coNP-Hard
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
How hard is it to invert NP-problems? We show that all superlinearly certified inverses of NP problems are coNP-hard. To do so, we develop a novel proof technique that builds diago…