| |
Edith Spaan
List of publications from the DBLP Bibliography Server - FAQ
| 2008 | ||
|---|---|---|
| 86 | Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Approximability of Manipulating Elections. AAAI 2008: 44-49 | |
| 85 | EE | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Copeland Voting Fully Resists Constructive Control. AAIM 2008: 165-176 |
| 84 | EE | Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor: Copeland voting: ties matter. AAMAS (2) 2008: 983-990 |
| 83 | EE | Edith Hemaspaandra, Henning Schnoor: On the Complexity of Elementary Modal Logics. STACS 2008: 349-360 |
| 82 | EE | Edith Hemaspaandra, Henning Schnoor: On the Complexity of Elementary Modal Logics CoRR abs/0802.1884: (2008) |
| 81 | EE | Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Generalized Modal Satisfiability CoRR abs/0804.2729: (2008) |
| 80 | EE | 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 | ||
| 79 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Llull and Copeland Voting Broadly Resist Bribery and Control. AAAI 2007: 724-730 | |
| 78 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe: On the Complexity of Kings. FCT 2007: 328-340 |
| 77 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. IJCAI 2007: 1308-1314 |
| 76 | EE | 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) |
| 75 | EE | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Copeland Voting Fully Resists Constructive Control CoRR abs/0711.4759: (2007) |
| 74 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi: Complexity results in graph reconstruction. Discrete Applied Mathematics 155(2): 103-118 (2007) |
| 73 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra: Dichotomy for voting systems. J. Comput. Syst. Sci. 73(1): 73-83 (2007) |
| 2006 | ||
| 72 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: The Complexity of Bribery in Elections. AAAI 2006 | |
| 71 | EE | Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Generalized Modal Satisfiability. STACS 2006: 500-511 |
| 70 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control CoRR abs/cs/0608057: (2006) |
| 69 | EE | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: How Hard Is Bribery in Elections? CoRR abs/cs/0608081: (2006) |
| 68 | 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) |
| 2005 | ||
| 67 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Anyone but Him: The Complexity of Precluding an Alternative. AAAI 2005: 95-101 | |
| 66 | EE | Michael Bauland, Edith Hemaspaandra: Isomorphic Implication. MFCS 2005: 119-130 |
| 65 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra: Dichotomy for Voting Systems CoRR abs/cs/0504075: (2005) |
| 64 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Osamu Watanabe: The Complexity of Kings CoRR abs/cs/0506055: (2005) |
| 63 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Anyone but Him: The Complexity of Precluding an Alternative CoRR abs/cs/0507027: (2005) |
| 62 | EE | 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) |
| 61 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: All superlinear inverse schemes are coNP-hard. Theor. Comput. Sci. 345(2-3): 345-358 (2005) |
| 60 | EE | Edith Hemaspaandra, Holger Spakowski, Jörg Vogel: The complexity of Kemeny elections. Theor. Comput. Sci. 349(3): 382-391 (2005) |
| 2004 | ||
| 59 | EE | Edith Hemaspaandra, Holger Spakowski, Mayur Thakur: Complexity of Cycle Length Modularity Problems in Graphs. LATIN 2004: 509-518 |
| 58 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi: Complexity Results in Graph Reconstruction. MFCS 2004: 287-297 |
| 57 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: All Superlinear Inverse Schemes Are coNP-Hard. MFCS 2004: 368-379 |
| 56 | EE | Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: The Complexity of Boolean Constraint Isomorphism. STACS 2004: 164-175 |
| 55 | EE | Michael Bauland, Edith Hemaspaandra: Isomorphic Implication CoRR abs/cs/0412062: (2004) |
| 54 | EE | Edith Hemaspaandra: Dichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas CoRR cs.CC/0406006: (2004) |
| 53 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi: Complexity Results in Graph Reconstruction CoRR cs.CC/0410021: (2004) |
| 52 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: All Superlinear Inverse Schemes are coNP-Hard CoRR cs.CC/0410023: (2004) |
| 2003 | ||
| 51 | EE | Edith Hemaspaandra, Holger Spakowski, Mayur Thakur: Complexity of Cycle Length Modularity Problems in Graphs CoRR cs.CC/0306131: (2003) |
| 50 | EE | Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: The Complexity of Boolean Constraint Isomorphism CoRR cs.CC/0306134: (2003) |
| 2002 | ||
| 49 | EE | Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: Equivalence and Isomorphism for Boolean Constraint Satisfaction. CSL 2002: 412-426 |
| 48 | EE | 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 |
| 47 | EE | Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: Equivalence and Isomorphism for Boolean Constraint Satisfaction CoRR cs.CC/0202036: (2002) |
| 46 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand: Almost-Everywhere Superiority for Quantum Polynomial Time. Inf. Comput. 175(2): 171-181 (2002) |
| 45 | EE | Edith Hemaspaandra, Gerd Wechsung: The Minimization Problem for Boolean Formulas. SIAM J. Comput. 31(6): 1948-1958 (2002) |
| 2001 | ||
| 44 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Using the No-Search Easy-Hard Technique for Downward Collapse CoRR cs.CC/0106037: (2001) |
| 43 | EE | 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) |
| 42 | EE | Edith Hemaspaandra: The Complexity of Poor Man's Logic. J. Log. Comput. 11(4): 609-622 (2001) |
| 2000 | ||
| 41 | EE | Edith Hemaspaandra: Modal Satisfiability Is in Deterministic Linear Space. CSL 2000: 332-342 |
| 40 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra: Computational Politics: Electoral Systems. MFCS 2000: 64-83 |
| 39 | EE | Edith Hemaspaandra: The Complexity of Poor Man's Logic. STACS 2000: 230-242 |
| 1999 | ||
| 38 | EE | 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 |
| 37 | EE | Edith Hemaspaandra: On the Power of Positive Turing Reductions CoRR cs.CC/9906028: (1999) |
| 36 | EE | 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) |
| 35 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Raising NP Lower Bounds to Parallel NP Lower Bounds CoRR cs.CC/9907039: (1999) |
| 34 | EE | 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) |
| 33 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: R1-ttSN(NP) Distinguishes Robust Many-One and Turing Completeness CoRR cs.CC/9910003: (1999) |
| 32 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: An Introduction to Query Order CoRR cs.CC/9910004: (1999) |
| 31 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Query Order and the Polynomial Hierarchy CoRR cs.CC/9910005: (1999) |
| 30 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: A Downward Collapse within the Polynomial Hierarchy CoRR cs.CC/9910007: (1999) |
| 29 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Translating Equality Downwards CoRR cs.CC/9910008: (1999) |
| 28 | EE | Edith Hemaspaandra: The Complexity of Poor Man's Logic CoRR cs.LO/9911014: (1999) |
| 27 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand: Almost-Everywhere Superiority for Quantum Computing CoRR quant-ph/9910033: (1999) |
| 26 | EE | Edith Hemaspaandra: On the Power of Positive Turing Reductions. J. UCS 5(12): 828-832 (1999) |
| 1998 | ||
| 25 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Downward Collapse from a Weaker Hypothesis CoRR cs.CC/9808002: (1998) |
| 24 | EE | 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) |
| 23 | EE | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Query Order and the Polynomial Hierarchy. J. UCS 4(6): 574-588 (1998) |
| 22 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: A Downward Collapse within the Polynomial Hierarchy. SIAM J. Comput. 28(2): 383-393 (1998) | |
| 21 | 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 | ||
| 20 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness. CIAC 1997: 49-60 | |
| 19 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Query Order in the Polynomial Hierarchy. FCT 1997: 222-232 | |
| 18 | EE | Edith Hemaspaandra, Gerd Wechsung: The Minimization Problem for Boolean Formulas. FOCS 1997: 575-584 |
| 17 | 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 | |
| 16 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: A Downward Translation in the Polynomial Hierarchy. STACS 1997: 319-328 | |
| 15 | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: An Introduction to Query Order. Bulletin of the EATCS 63: (1997) | |
| 14 | EE | 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) |
| 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) | |