dblp.uni-trier.dewww.uni-trier.de

Piotr Faliszewski

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
24EEPiotr Faliszewski, Lane A. Hemaspaandra: The complexity of power-index comparison. Theor. Comput. Sci. 410(1): 101-107 (2009)
2008
23 Michael Zuckerman, Piotr Faliszewski, Yoram Bachrach, Edith Elkind: Manipulating the Quota in Weighted Voting Games. AAAI 2008: 215-220
22 Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Approximability of Manipulating Elections. AAAI 2008: 44-49
21EEPiotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Copeland Voting Fully Resists Constructive Control. AAIM 2008: 165-176
20EEPiotr Faliszewski, Lane A. Hemaspaandra: The Complexity of Power-Index Comparison. AAIM 2008: 177-187
19EEPiotr Faliszewski, Edith Hemaspaandra, Henning Schnoor: Copeland voting: ties matter. AAMAS (2) 2008: 983-990
18EEPiotr Faliszewski: Nonuniform bribery. AAMAS (3) 2008: 1569-1572
17EEPiotr Faliszewski, Lane A. Hemaspaandra: The Complexity of Power-Index Comparison CoRR abs/0801.4585: (2008)
16EEPiotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Llull and Copeland Voting Computationally Resist Bribery and Control CoRR abs/0809.4484: (2008)
15EEPiotr Faliszewski, Lane A. Hemaspaandra: The consequences of eliminating NP solutions. Computer Science Review 2(1): 40-54 (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
13EEPiotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Copeland Voting Fully Resists Constructive Control CoRR abs/0711.4759: (2007)
12EEPiotr Faliszewski: Nonuniform Bribery CoRR abs/0711.4924: (2007)
11EEPiotr 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
9EEPiotr Faliszewski, Lane A. Hemaspaandra: The Consequences of Eliminating NP Solutions CoRR abs/cs/0606009: (2006)
8EEPiotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: How Hard Is Bribery in Elections? CoRR abs/cs/0608081: (2006)
7EEPiotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: A Richer Understanding of the Complexity of Election Systems CoRR abs/cs/0609112: (2006)
6EEPiotr Faliszewski, Lane A. Hemaspaandra: Open questions in the theory of semifeasible computation. SIGACT News 37(1): 47-65 (2006)
2005
5EEPiotr Faliszewski, Mitsunori Ogihara: Separating the Notions of Self- and Autoreducibility. MFCS 2005: 308-315
4EEPiotr Faliszewski, Lane A. Hemaspaandra: Open Questions in the Theory of Semifeasible Computation CoRR abs/cs/0506082: (2005)
3EEPiotr Faliszewski, Janusz Jarosz: Properties of uniformly hard languages. Inf. Process. Lett. 95(1): 329-332 (2005)
2EEPiotr 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
1EEPiotr Faliszewski: Exponential time reductions and sparse languages in NEXP Electronic Colloquium on Computational Complexity (ECCC)(064): (2004)

Coauthor Index

1Yoram Bachrach [23]
2Eric Brelsford [22]
3Edith Elkind [23]
4Edith Hemaspaandra (Edith Spaan) [7] [8] [10] [13] [14] [16] [19] [21] [22]
5Lane A. Hemaspaandra (Lane A. Hemachandra) [2] [4] [6] [7] [8] [9] [10] [13] [14] [15] [16] [17] [20] [21] [24]
6Janusz Jarosz [3]
7Mitsunori Ogihara (Mitsunori Ogiwara) [5]
8Jörg Rothe [7] [13] [14] [16] [21]
9Henning Schnoor [19] [22]
10Ilka Schnoor [22]
11Michael Zuckerman [23]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)