Piotr Faliszewski

	2009
31		Piotr Faliszewski, Edith Elkind, Michael Wooldridge: Boolean combinations of weighted voting games. AAMAS (1) 2009: 185-192
30		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Multimode Control Attacks on Elections. IJCAI 2009: 128-133
29		Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Swap Bribery. SAGT 2009: 299-310
28		Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: On distance rationalizability of some voting rules. TARK 2009: 108-117
27		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: The shield that never was: societies with single-peaked preferences are more open to manipulation and control. TARK 2009: 118-127
26		Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Swap Bribery CoRR abs/0905.3885: (2009)
25		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control CoRR abs/0909.3257: (2009)
24		Piotr 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
21		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Copeland Voting Fully Resists Constructive Control. AAIM 2008: 165-176
20		Piotr Faliszewski, Lane A. Hemaspaandra: The Complexity of Power-Index Comparison. AAIM 2008: 177-187
19		Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor: Copeland voting: ties matter. AAMAS (2) 2008: 983-990
18		Piotr Faliszewski: Nonuniform bribery. AAMAS (3) 2008: 1569-1572
17		Piotr Faliszewski, Lane A. Hemaspaandra: The Complexity of Power-Index Comparison CoRR abs/0801.4585: (2008)
16		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Llull and Copeland Voting Computationally Resist Bribery and Control CoRR abs/0809.4484: (2008)
15		Piotr 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
13		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Copeland Voting Fully Resists Constructive Control CoRR abs/0711.4759: (2007)
12		Piotr Faliszewski: Nonuniform Bribery CoRR abs/0711.4924: (2007)
11		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		Piotr Faliszewski, Lane A. Hemaspaandra: The Consequences of Eliminating NP Solutions CoRR abs/cs/0606009: (2006)
8		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: How Hard Is Bribery in Elections? CoRR abs/cs/0608081: (2006)
7		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		Piotr Faliszewski, Lane A. Hemaspaandra: Open questions in the theory of semifeasible computation. SIGACT News 37(1): 47-65 (2006)
	2005
5		Piotr Faliszewski, Mitsunori Ogihara: Separating the Notions of Self- and Autoreducibility. MFCS 2005: 308-315
4		Piotr Faliszewski, Lane A. Hemaspaandra: Open Questions in the Theory of Semifeasible Computation CoRR abs/cs/0506082: (2005)
3		Piotr Faliszewski, Janusz Jarosz: Properties of uniformly hard languages. Inf. Process. Lett. 95(1): 329-332 (2005)
2		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		Piotr Faliszewski: Exponential time reductions and sparse languages in NEXP Electronic Colloquium on Computational Complexity (ECCC)(064): (2004)

Coauthor Index

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

Colors in the list of coauthors