| 2008 |
|---|
| 15 | EE | Piotr Faliszewski,
Lane A. Hemaspaandra:
The Complexity of Power-Index Comparison
CoRR abs/0801.4585: (2008) |
| 2007 |
|---|
| 14 | | Piotr Faliszewski,
Edith Hemaspaandra,
Lane A. Hemaspaandra,
Jörg Rothe:
Llull and Copeland Voting Broadly Resist Bribery and Control.
AAAI 2007: 724-730 |
| 13 | EE | Piotr Faliszewski,
Edith Hemaspaandra,
Lane A. Hemaspaandra,
Jörg Rothe:
Copeland Voting Fully Resists Constructive Control
CoRR abs/0711.4759: (2007) |
| 12 | EE | Piotr Faliszewski:
Nonuniform Bribery
CoRR abs/0711.4924: (2007) |
| 11 | EE | Piotr Faliszewski:
Review of "Complexity Theory and Cryptology: An Introduction to Cryptocomplexity by Jörg Rothe", Springer, 2005, 484 pages.
SIGACT News 38(2): 20-22 (2007) |
| 2006 |
|---|
| 10 | | Piotr Faliszewski,
Edith Hemaspaandra,
Lane A. Hemaspaandra:
The Complexity of Bribery in Elections.
AAAI 2006 |
| 9 | EE | Piotr Faliszewski,
Lane A. Hemaspaandra:
The Consequences of Eliminating NP Solutions
CoRR abs/cs/0606009: (2006) |
| 8 | EE | Piotr Faliszewski,
Edith Hemaspaandra,
Lane A. Hemaspaandra:
How Hard Is Bribery in Elections?
CoRR abs/cs/0608081: (2006) |
| 7 | EE | Piotr Faliszewski,
Edith Hemaspaandra,
Lane A. Hemaspaandra,
Jörg Rothe:
A Richer Understanding of the Complexity of Election Systems
CoRR abs/cs/0609112: (2006) |
| 6 | EE | Piotr Faliszewski,
Lane A. Hemaspaandra:
Open questions in the theory of semifeasible computation.
SIGACT News 37(1): 47-65 (2006) |
| 2005 |
|---|
| 5 | EE | Piotr Faliszewski,
Mitsunori Ogihara:
Separating the Notions of Self- and Autoreducibility.
MFCS 2005: 308-315 |
| 4 | EE | Piotr Faliszewski,
Lane A. Hemaspaandra:
Open Questions in the Theory of Semifeasible Computation
CoRR abs/cs/0506082: (2005) |
| 3 | EE | Piotr Faliszewski,
Janusz Jarosz:
Properties of uniformly hard languages.
Inf. Process. Lett. 95(1): 329-332 (2005) |
| 2 | EE | Piotr Faliszewski,
Lane A. Hemaspaandra:
Advice for semifeasible sets and the complexity-theoretic cost(lessness) of algebraic properties.
Int. J. Found. Comput. Sci. 16(5): 913-928 (2005) |
| 2004 |
|---|
| 1 | EE | Piotr Faliszewski:
Exponential time reductions and sparse languages in NEXP
Electronic Colloquium on Computational Complexity (ECCC)(064): (2004) |
