Edith Hemaspaandra

Edith Spaan

	2012
114		Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton: Search versus Decision for Election Manipulation Problems CoRR abs/1202.6641: (2012)
113		Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Controlling Candidate-Sequential Elections CoRR abs/1202.6649: (2012)
112		Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: The Complexity of Online Manipulation of Sequential Elections CoRR abs/1202.6655: (2012)
111		Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Online Voter Control in Sequential Elections CoRR abs/1203.0411: (2012)
	2011
110		Edith Hemaspaandra, Henning Schnoor: Minimization for Generalized Boolean Formulas. IJCAI 2011: 566-571
109		Edith Hemaspaandra, Henning Schnoor: A Universally Defined Undecidable Unimodal Logic. MFCS 2011: 364-375
108		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: The complexity of manipulative attacks in nearly single-peaked electorates. TARK 2011: 228-237
107		Edith Hemaspaandra, Henning Schnoor: Minimization for Generalized Boolean Formulas CoRR abs/1104.2312: (2011)
106		Edith Hemaspaandra, Henning Schnoor: A Simplest Undecidable Modal Logic CoRR abs/1105.0845: (2011)
105		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates CoRR abs/1105.5032: (2011)
104		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. Inf. Comput. 209(2): 89-107 (2011)
103		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Multimode Control Attacks on Elections. J. Artif. Intell. Res. (JAIR) 40: 305-351 (2011)
	2010
102		Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra: Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. AAAI 2010
101		Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor: Manipulation of copeland elections. AAMAS 2010: 367-374
100		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Multimode Control Attacks on Elections CoRR abs/1007.1800: (2010)
99		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Using complexity to protect elections. Commun. ACM 53(11): 74-82 (2010)
98		Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Generalized modal satisfiability. J. Comput. Syst. Sci. 76(7): 561-578 (2010)
97		Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe: On the complexity of kings. Theor. Comput. Sci. 411(4-5): 783-798 (2010)
	2009
96		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Multimode Control Attacks on Elections. IJCAI 2009: 128-133
95		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
94		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)
93		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. J. Artif. Intell. Res. (JAIR) 35: 275-341 (2009)
92		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: How Hard Is Bribery in Elections? J. Artif. Intell. Res. (JAIR) 35: 485-532 (2009)
91		Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. Math. Log. Q. 55(4): 397-424 (2009)
90		Michael Bauland, Edith Hemaspaandra: Isomorphic Implication. Theory Comput. Syst. 44(1): 117-139 (2009)
	2008
89		Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Approximability of Manipulating Elections. AAAI 2008: 44-49
88		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Copeland Voting Fully Resists Constructive Control. AAIM 2008: 165-176
87		Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor: Copeland voting: ties matter. AAMAS (2) 2008: 983-990
86		Edith Hemaspaandra, Henning Schnoor: On the Complexity of Elementary Modal Logics. STACS 2008: 349-360
85		Edith Hemaspaandra, Henning Schnoor: On the Complexity of Elementary Modal Logics CoRR abs/0802.1884: (2008)
84		Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Generalized Modal Satisfiability CoRR abs/0804.2729: (2008)
83		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Llull and Copeland Voting Computationally Resist Bribery and Control CoRR abs/0809.4484: (2008)
	2007
82		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Llull and Copeland Voting Broadly Resist Bribery and Control. AAAI 2007: 724-730
81		Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe: On the Complexity of Kings. FCT 2007: 328-340
80		Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. IJCAI 2007: 1308-1314
79		Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Anyone but him: The complexity of precluding an alternative. Artif. Intell. 171(5-6): 255-285 (2007)
78		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Copeland Voting Fully Resists Constructive Control CoRR abs/0711.4759: (2007)
77		Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi: Complexity results in graph reconstruction. Discrete Applied Mathematics 155(2): 103-118 (2007)
76		Edith Hemaspaandra, Lane A. Hemaspaandra: Dichotomy for voting systems. J. Comput. Syst. Sci. 73(1): 73-83 (2007)
	2006
75		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: The Complexity of Bribery in Elections. AAAI 2006: 641-646
74		Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Generalized Modal Satisfiability. STACS 2006: 500-511
73		Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control CoRR abs/cs/0608057: (2006)
72		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: How Hard Is Bribery in Elections? CoRR abs/cs/0608081: (2006)
71		Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: A Richer Understanding of the Complexity of Election Systems CoRR abs/cs/0609112: (2006)
70		Edith Hemaspaandra, Jörg Rothe, Holger Spakowski: Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. ITA 40(1): 75-91 (2006)
	2005
69		Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Anyone but Him: The Complexity of Precluding an Alternative. AAAI 2005: 95-101
68		Michael Bauland, Edith Hemaspaandra: Isomorphic Implication. MFCS 2005: 119-130
67		Edith Hemaspaandra, Lane A. Hemaspaandra: Dichotomy for Voting Systems CoRR abs/cs/0504075: (2005)
66		Edith Hemaspaandra, Lane A. Hemaspaandra, Osamu Watanabe: The Complexity of Kings CoRR abs/cs/0506055: (2005)
65		Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Anyone but Him: The Complexity of Precluding an Alternative CoRR abs/cs/0507027: (2005)
64		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Extending Downward Collapse from 1-versus-2 Queries to m-versus-m + 1 Queries. SIAM J. Comput. 34(6): 1352-1369 (2005)
63		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: All superlinear inverse schemes are coNP-hard. Theor. Comput. Sci. 345(2-3): 345-358 (2005)
62		Edith Hemaspaandra, Holger Spakowski, Jörg Vogel: The complexity of Kemeny elections. Theor. Comput. Sci. 349(3): 382-391 (2005)
	2004
61		Edith Hemaspaandra, Holger Spakowski, Mayur Thakur: Complexity of Cycle Length Modularity Problems in Graphs. LATIN 2004: 509-518
60		Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi: Complexity Results in Graph Reconstruction. MFCS 2004: 287-297
59		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: All Superlinear Inverse Schemes Are coNP-Hard. MFCS 2004: 368-379
58		Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: The Complexity of Boolean Constraint Isomorphism. STACS 2004: 164-175
57		Michael Bauland, Edith Hemaspaandra: Isomorphic Implication CoRR abs/cs/0412062: (2004)
56		Edith Hemaspaandra: Dichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas CoRR cs.CC/0406006: (2004)
55		Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi: Complexity Results in Graph Reconstruction CoRR cs.CC/0410021: (2004)
54		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: All Superlinear Inverse Schemes are coNP-Hard CoRR cs.CC/0410023: (2004)
	2003
53		Edith Hemaspaandra, Holger Spakowski, Mayur Thakur: Complexity of Cycle Length Modularity Problems in Graphs CoRR cs.CC/0306131: (2003)
52		Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: The Complexity of Boolean Constraint Isomorphism CoRR cs.CC/0306134: (2003)
	2002
51		Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: Equivalence and Isomorphism for Boolean Constraint Satisfaction. CSL 2002: 412-426
50		Edith Hemaspaandra, Jörg Rothe, Holger Spakowski: Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. WG 2002: 258-269
49		Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: Equivalence and Isomorphism for Boolean Constraint Satisfaction CoRR cs.CC/0202036: (2002)
48		Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand: Almost-Everywhere Superiority for Quantum Polynomial Time. Inf. Comput. 175(2): 171-181 (2002)
47		Edith Hemaspaandra, Gerd Wechsung: The Minimization Problem for Boolean Formulas. SIAM J. Comput. 31(6): 1948-1958 (2002)
	2001
46		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Using the No-Search Easy-Hard Technique for Downward Collapse CoRR cs.CC/0106037: (2001)
45		Edith Hemaspaandra, Jörg Rothe, Holger Spakowski: Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP CoRR cs.CC/0110025: (2001)
44		Edith Hemaspaandra: The Complexity of Poor Man's Logic. J. Log. Comput. 11(4): 609-622 (2001)
	2000
43		Edith Hemaspaandra: Modal Satisfiability Is in Deterministic Linear Space. CSL 2000: 332-342
42		Edith Hemaspaandra, Lane A. Hemaspaandra: Computational Politics: Electoral Systems. MFCS 2000: 64-83
41		Edith Hemaspaandra: The Complexity of Poor Man's Logic. STACS 2000: 230-242
	1999
40		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries. STACS 1999: 269-280
39		Edith Hemaspaandra: On the Power of Positive Turing Reductions CoRR cs.CC/9906028: (1999)
38		Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP CoRR cs.CC/9907036: (1999)
37		Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Raising NP Lower Bounds to Parallel NP Lower Bounds CoRR cs.CC/9907039: (1999)
36		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: What's Up with Downward Collapse: Using the Easy-Hard Technique to Link Boolean and Polynomial Hierarchy Collapses CoRR cs.CC/9910002: (1999)
35		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: R1-ttSN(NP) Distinguishes Robust Many-One and Turing Completeness CoRR cs.CC/9910003: (1999)
34		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: An Introduction to Query Order CoRR cs.CC/9910004: (1999)
33		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Query Order and the Polynomial Hierarchy CoRR cs.CC/9910005: (1999)
32		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: A Downward Collapse within the Polynomial Hierarchy CoRR cs.CC/9910007: (1999)
31		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Translating Equality Downwards CoRR cs.CC/9910008: (1999)
30		Edith Hemaspaandra: The Complexity of Poor Man's Logic CoRR cs.LO/9911014: (1999)
29		Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand: Almost-Everywhere Superiority for Quantum Computing CoRR quant-ph/9910033: (1999)
28		Edith Hemaspaandra: On the Power of Positive Turing Reductions. J. UCS 5(12): 828-832 (1999)
	1998
27		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Downward Collapse from a Weaker Hypothesis CoRR cs.CC/9808002: (1998)
26		Edith Hemaspaandra, Jörg Rothe: Recognizing when Greed can Approximate Maximum Independent Sets is Complete for Parallel Access to NP. Inf. Process. Lett. 65(3): 151-156 (1998)
25		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Query Order and the Polynomial Hierarchy. J. UCS 4(6): 574-588 (1998)
24		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: A Downward Collapse within the Polynomial Hierarchy. SIAM J. Comput. 28(2): 383-393 (1998)
23		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: What's up with downward collapse: using the easy-hard technique to link Boolean and polynomial hierarchy collapses. SIGACT News 29(3): 10-22 (1998)
22		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: RS N1-tt (NP) Distinguishes Robust Many-One and Turing Completeness. Theory Comput. Syst. 31(3): 307-325 (1998)
	1997
21		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness. CIAC 1997: 49-60
20		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Query Order in the Polynomial Hierarchy. FCT 1997: 222-232
19		Edith Hemaspaandra, Gerd Wechsung: The Minimization Problem for Boolean Formulas. FOCS 1997: 575-584
18		Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP. ICALP 1997: 214-224
17		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: A Downward Translation in the Polynomial Hierarchy. STACS 1997: 319-328
16		Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: An Introduction to Query Order. Bulletin of the EATCS 63: (1997)
15		Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP. J. ACM 44(6): 806-825 (1997)
14		Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Raising NP lower bounds to parallel NP lower bounds. SIGACT News 28(2): 2-13 (1997)
	1996
13		Edith Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman: P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility. J. Comput. Syst. Sci. 53(2): 194-209 (1996)
12		Edith Hemaspaandra: The Price of Universality. Notre Dame Journal of Formal Logic 37(2): 174-203 (1996)
	1995
11		Harry Buhrman, Edith Hemaspaandra, Luc Longpré: SPARSE Reduces Conjunctively to TALLY. SIAM J. Comput. 24(4): 673-681 (1995)
	1994
10		Edith Hemaspaandra: Complexity Transfer for Modal Logic (Extended Abstract) LICS 1994: 164-173
9		Edith Hemaspaandra: Census Techniques Collapse Space Classes. Inf. Process. Lett. 51(2): 79-84 (1994)
8		Edith Hemaspaandra, Lane A. Hemaspaandra: Quasi-injective Reductions. Theor. Comput. Sci. 123(2): 407-413 (1994)
	1993
7		Harry Buhrman, Luc Longpré, Edith Spaan: SPARSE reduces conjunctively to TALLY. Structure in Complexity Theory Conference 1993: 208-214
6		Harry Buhrman, Edith Spaan, Leen Torenvliet: The Relative Power of Logspace and Polynomial Time Reductions. Computational Complexity 3: 231-244 (1993)
	1992
5		Harry Buhrman, Edith Spaan, Leen Torenvliet: Bounded Reductions. Complexity Theory: Current Research 1992: 83-99
	1991
4		Sieger van Denneheuvel, Karen L. Kwast, Gerard R. Renardel de Lavalette, Edith Spaan: Query Optimization Using Rewrite Rules. RTA 1991: 252-263
3		Harry Buhrman, Edith Spaan, Leen Torenvliet: Bounded Reductions. STACS 1991: 410-421
	1990
2		Edith Spaan: Nexttime is not Necessary. TARK 1990: 241-256
	1989
1		Edith Spaan, Leen Torenvliet, Peter van Emde Boas: Nondeterminism fairness and a fundamental analogy. Bulletin of the EATCS 37: 186-193 (1989)

Coauthor Index

1	Michael Bauland	[57] [68] [74] [90]
2	Peter van Emde Boas	[1]
3	Elmar Böhler	[49] [51] [52] [58]
4	Felix Brandt	[102]
5	Eric Brelsford	[89]
6	Markus Brill	[102]
7	Harry Buhrman	[3] [5] [6] [7] [11]
8	Sieger van Denneheuvel	[4]
9	Piotr Faliszewski	[71] [72] [75] [78] [82] [83] [87] [88] [89] [92] [93] [94] [95] [96] [99] [100] [101] [103] [104] [105] [108]
10	Lane A. Hemaspaandra (Lane A. Hemachandra)	[8] [14] [15] [16] [17] [18] [20] [21] [22] [23] [24] [25] [27] [29] [31] [32] [33] [34] [35] [36] [37] [38] [40] [42] [46] [48] [54] [55] [59] [60] [63] [64] [65] [66] [67] [69] [71] [72] [73] [75] [76] [77] [78] [79] [80] [81] [82] [83] [88] [91] [92] [93] [94] [95] [96] [97] [99] [100] [102] [103] [104] [105] [108] [111] [112] [113] [114]
11	Harald Hempel	[16] [17] [20] [21] [22] [23] [24] [25] [27] [31] [32] [33] [34] [35] [36] [40] [46] [54] [59] [63] [64]
12	Karen L. Kwast	[4]
13	Gerard R. Renardel de Lavalette	[4]
14	Luc Longpré	[7] [11]
15	Curtis Menton	[114]
16	Ashish V. Naik	[13]
17	Mitsunori Ogihara (Mitsunori Ogiwara)	[13]
18	Stanislaw P. Radziszowski	[55] [60] [77]
19	Steffen Reith	[49] [51] [52] [58]
20	Jörg Rothe	[14] [15] [18] [26] [37] [38] [45] [50] [65] [69] [70] [71] [73] [78] [79] [80] [82] [83] [88] [91] [93] [94] [95] [104] [111] [112] [113]
21	Henning Schnoor	[74] [84] [85] [86] [87] [89] [98] [101] [106] [107] [109] [110]
22	Ilka Schnoor	[74] [84] [89] [98]
23	Alan L. Selman	[13]
24	Holger Spakowski	[45] [50] [53] [61] [62] [70]
25	Till Tantau	[81] [97]
26	Mayur Thakur	[53] [61]
27	Leen Torenvliet	[1] [3] [5] [6]
28	Rahul Tripathi	[55] [60] [77]
29	Jörg Vogel	[62]
30	Heribert Vollmer	[49] [51] [52] [58]
31	Osamu Watanabe	[66] [81] [97]
32	Gerd Wechsung	[19] [47]
33	Marius Zimand	[29] [48]

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page