Lane A. Hemaspaandra

activity

19982010

most citedHybrid Elections Broaden Complexity-Theoretic Resistance to Control

20 citations · 74 across the 18 of their papers we have counts for

collaborators

Showing 1998Show all

3 papers · 1 filter

cs.GL1998

Writing and Editing Complexity Theory: Tales and Tools

Lane A. Hemaspaandra, Alan L. Selman

Each researcher should have a full shelf---physical or virtual---of books on writing and editing prose. Though we make no claim to any special degree of expertise, we recently edit…

cs.CC1998

Downward Collapse from a Weaker Hypothesis

Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel

Hemaspaandra et al. proved that, for $m > 0$ and $0 < i < k - 1$ : if $Σ_i^p \BoldfaceDelta DIFF_m(Σ_k^p)$ is closed under complementation, then $D I F F_{m} (Σ_{k}^{p}) = coD I F F_{m} (Σ_{k}^{p})$ . T…

cs.CC1998

Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function

Lane A. Hemaspaandra, Joerg Rothe

Rabi and Sherman [RS97] presented novel digital signature and unauthenticated secret-key agreement protocols, developed by themselves and by Rivest and Sherman. These protocols use…