Edith Hemaspaandra Home Page Coauthor index pubzone.org

Edith Spaan

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
c43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton: Search versus Decision for Election Manipulation Problems. STACS 2013: 377-388
i41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra: X THEN X: Manipulation of Same-System Runoff Elections. CoRR abs/1301.6118 (2013)
2012
c42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor: Weighted Manipulation for Four-Candidate Llull Is Easy. ECAI 2012: 318-323
c41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Online Voter Control in Sequential Elections. ECAI 2012: 396-401
c40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Controlling Candidate-Sequential Elections. ECAI 2012: 905-906
i40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton: Search versus Decision for Election Manipulation Problems. CoRR abs/1202.6641 (2012)
i39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Controlling Candidate-Sequential Elections. CoRR abs/1202.6649 (2012)
i38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: The Complexity of Online Manipulation of Sequential Elections. CoRR abs/1202.6655 (2012)
i37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Online Voter Control in Sequential Elections. CoRR abs/1203.0411 (2012)
2011
j35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Multimode Control Attacks on Elections. J. Artif. Intell. Res. (JAIR) 40: 305-351 (2011)
c39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Henning Schnoor: Minimization for Generalized Boolean Formulas. IJCAI 2011: 566-571
c38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Henning Schnoor: A Universally Defined Undecidable Unimodal Logic. MFCS 2011: 364-375
c37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: The complexity of manipulative attacks in nearly single-peaked electorates. TARK 2011: 228-237
i36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Henning Schnoor: Minimization for Generalized Boolean Formulas. CoRR abs/1104.2312 (2011)
i35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Henning Schnoor: A Simplest Undecidable Modal Logic. CoRR abs/1105.0845 (2011)
i34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates. CoRR abs/1105.5032 (2011)
2010
j33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Using complexity to protect elections. Commun. ACM 53(11): 74-82 (2010)
j32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Generalized modal satisfiability. J. Comput. Syst. Sci. 76(7): 561-578 (2010)
j31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe: On the complexity of kings. Theor. Comput. Sci. 411(4-5): 783-798 (2010)
c36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra: Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. AAAI 2010
c35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor: Manipulation of copeland elections. AAMAS 2010: 367-374
i33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Multimode Control Attacks on Elections. CoRR abs/1007.1800 (2010)
2009
j30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: How Hard Is Bribery in Elections? J. Artif. Intell. Res. (JAIR) 35: 485-532 (2009)
j28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. Math. Log. Q. 55(4): 397-424 (2009)
j27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael Bauland, Edith Hemaspaandra: Isomorphic Implication. Theory Comput. Syst. 44(1): 117-139 (2009)
c34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Multimode Control Attacks on Elections. IJCAI 2009: 128-133
c33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
i32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
2008
c32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Approximability of Manipulating Elections. AAAI 2008: 44-49
c31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Copeland Voting Fully Resists Constructive Control. AAIM 2008: 165-176
c30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor: Copeland voting: ties matter. AAMAS (2) 2008: 983-990
c29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Henning Schnoor: On the Complexity of Elementary Modal Logics. STACS 2008: 349-360
i31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Henning Schnoor: On the Complexity of Elementary Modal Logics. CoRR abs/0802.1884 (2008)
i30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Generalized Modal Satisfiability. CoRR abs/0804.2729 (2008)
i29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi: Complexity results in graph reconstruction. Discrete Applied Mathematics 155(2): 103-118 (2007)
j24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra: Dichotomy for voting systems. J. Comput. Syst. Sci. 73(1): 73-83 (2007)
c28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Llull and Copeland Voting Broadly Resist Bribery and Control. AAAI 2007: 724-730
c27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe: On the Complexity of Kings. FCT 2007: 328-340
c26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. IJCAI 2007: 1308-1314
i28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Copeland Voting Fully Resists Constructive Control. CoRR abs/0711.4759 (2007)
2006
j23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
c25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: The Complexity of Bribery in Elections. AAAI 2006: 641-646
c24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Generalized Modal Satisfiability. STACS 2006: 500-511
i27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. CoRR abs/cs/0608057 (2006)
i26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: How Hard Is Bribery in Elections? CoRR abs/cs/0608081 (2006)
i25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: All superlinear inverse schemes are coNP-hard. Theor. Comput. Sci. 345(2-3): 345-358 (2005)
j20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Holger Spakowski, Jörg Vogel: The complexity of Kemeny elections. Theor. Comput. Sci. 349(3): 382-391 (2005)
c23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Anyone but Him: The Complexity of Precluding an Alternative. AAAI 2005: 95-101
c22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael Bauland, Edith Hemaspaandra: Isomorphic Implication. MFCS 2005: 119-130
i24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra: Dichotomy for Voting Systems. CoRR abs/cs/0504075 (2005)
i23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Osamu Watanabe: The Complexity of Kings. CoRR abs/cs/0506055 (2005)
i22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Anyone but Him: The Complexity of Precluding an Alternative. CoRR abs/cs/0507027 (2005)
2004
c21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Holger Spakowski, Mayur Thakur: Complexity of Cycle Length Modularity Problems in Graphs. LATIN 2004: 509-518
c20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi: Complexity Results in Graph Reconstruction. MFCS 2004: 287-297
c19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: All Superlinear Inverse Schemes Are coNP-Hard. MFCS 2004: 368-379
c18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: The Complexity of Boolean Constraint Isomorphism. STACS 2004: 164-175
i21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael Bauland, Edith Hemaspaandra: Isomorphic Implication. CoRR abs/cs/0412062 (2004)
i20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra: Dichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas. CoRR cs.CC/0406006 (2004)
i19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi: Complexity Results in Graph Reconstruction. CoRR cs.CC/0410021 (2004)
i18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: All Superlinear Inverse Schemes are coNP-Hard. CoRR cs.CC/0410023 (2004)
2003
i17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Holger Spakowski, Mayur Thakur: Complexity of Cycle Length Modularity Problems in Graphs. CoRR cs.CC/0306131 (2003)
i16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: The Complexity of Boolean Constraint Isomorphism. CoRR cs.CC/0306134 (2003)
2002
j19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand: Almost-Everywhere Superiority for Quantum Polynomial Time. Inf. Comput. 175(2): 171-181 (2002)
j18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Gerd Wechsung: The Minimization Problem for Boolean Formulas. SIAM J. Comput. 31(6): 1948-1958 (2002)
c17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: Equivalence and Isomorphism for Boolean Constraint Satisfaction. CSL 2002: 412-426
c16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
i15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: Equivalence and Isomorphism for Boolean Constraint Satisfaction. CoRR cs.CC/0202036 (2002)
2001
j17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra: The Complexity of Poor Man's Logic. J. Log. Comput. 11(4): 609-622 (2001)
i14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Using the No-Search Easy-Hard Technique for Downward Collapse. CoRR cs.CC/0106037 (2001)
i13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
2000
c15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra: Modal Satisfiability Is in Deterministic Linear Space. CSL 2000: 332-342
c14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra: Computational Politics: Electoral Systems. MFCS 2000: 64-83
c13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra: The Complexity of Poor Man's Logic. STACS 2000: 230-242
1999
j16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra: On the Power of Positive Turing Reductions. J. UCS 5(12): 828-832 (1999)
c12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
i12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra: On the Power of Positive Turing Reductions. CoRR cs.CC/9906028 (1999)
i11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
i10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Raising NP Lower Bounds to Parallel NP Lower Bounds. CoRR cs.CC/9907039 (1999)
i9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
i8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: R1-ttSN(NP) Distinguishes Robust Many-One and Turing Completeness. CoRR cs.CC/9910003 (1999)
i7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: An Introduction to Query Order. CoRR cs.CC/9910004 (1999)
i6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Query Order and the Polynomial Hierarchy. CoRR cs.CC/9910005 (1999)
i5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: A Downward Collapse within the Polynomial Hierarchy. CoRR cs.CC/9910007 (1999)
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Translating Equality Downwards. CoRR cs.CC/9910008 (1999)
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra: The Complexity of Poor Man's Logic. CoRR cs.LO/9911014 (1999)
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand: Almost-Everywhere Superiority for Quantum Computing. CoRR quant-ph/9910033 (1999)
1998
j15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Query Order and the Polynomial Hierarchy. J. UCS 4(6): 574-588 (1998)
j13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: A Downward Collapse within the Polynomial Hierarchy. SIAM J. Comput. 28(2): 383-393 (1998)
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Downward Collapse from a Weaker Hypothesis. CoRR cs.CC/9808002 (1998)
1997
j10no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: An Introduction to Query Order. Bulletin of the EATCS 63 (1997)
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Raising NP lower bounds to parallel NP lower bounds. SIGACT News 28(2): 2-13 (1997)
c11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness. CIAC 1997: 49-60
c10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Query Order in the Polynomial Hierarchy. FCT 1997: 222-232
c9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Gerd Wechsung: The Minimization Problem for Boolean Formulas. FOCS 1997: 575-584
c8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: A Downward Translation in the Polynomial Hierarchy. STACS 1997: 319-328
1996
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra: The Price of Universality. Notre Dame Journal of Formal Logic 37(2): 174-203 (1996)
1995
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Harry Buhrman, Edith Hemaspaandra, Luc Longpré: SPARSE Reduces Conjunctively to TALLY. SIAM J. Comput. 24(4): 673-681 (1995)
1994
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra: Census Techniques Collapse Space Classes. Inf. Process. Lett. 51(2): 79-84 (1994)
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra, Lane A. Hemaspaandra: Quasi-injective Reductions. Theor. Comput. Sci. 123(2): 407-413 (1994)
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Hemaspaandra: Complexity Transfer for Modal Logic (Extended Abstract). LICS 1994: 164-173
1993
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Harry Buhrman, Edith Spaan, Leen Torenvliet: The Relative Power of Logspace and Polynomial Time Reductions. Computational Complexity 3: 231-244 (1993)
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Harry Buhrman, Luc Longpré, Edith Spaan: SPARSE reduces conjunctively to TALLY. Structure in Complexity Theory Conference 1993: 208-214
1992
c4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Harry Buhrman, Edith Spaan, Leen Torenvliet: Bounded Reductions. Complexity Theory: Current Research 1992: 83-99
1991
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Sieger van Denneheuvel, Karen L. Kwast, Gerard R. Renardel de Lavalette, Edith Spaan: Query Optimization Using Rewrite Rules. RTA 1991: 252-263
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Harry Buhrman, Edith Spaan, Leen Torenvliet: Bounded Reductions. STACS 1991: 410-421
1990
c1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Spaan: Nexttime is not Necessary. TARK 1990: 241-256
1989
j1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Edith Spaan, Leen Torenvliet, Peter van Emde Boas: Nondeterminism fairness and a fundamental analogy. Bulletin of the EATCS 37: 186-193 (1989)

Coauthor Index

1Michael Bauland
[j27] [c24] [c22] [i21]
2Peter van Emde Boas
[j1]
3Felix Brandt
[c36]
4Eric Brelsford
[c32]
5Markus Brill
[c36]
6Harry Buhrman
[j5] [j2] [c5] [c4] [c2]
7Elmar Böhler
[c18] [i16] [c17] [i15]
8Sieger van Denneheuvel
[c3]
9Piotr Faliszewski
[c42] [j35] [j34] [c37] [i34] [j33] [c35] [i33] [j30] [j29] [c34] [c33] [i32] [c32] [c31] [c30] [i29] [c28] [i28] [c25] [i26] [i25]
10Zack Fitzsimmons
[i41]
11Lane A. Hemaspaandra (Lane A. Hemachandra)
[c43] [i41] [c41] [c40] [i40] [i39] [i38] [i37] [j35] [j34] [c37] [i34] [j33] [j31] [c36] [i33] [j30] [j29] [j28] [c34] [c33] [i32] [c31] [i29] [j26] [j25] [j24] [c28] [c27] [c26] [i28] [c25] [i27] [i26] [i25] [j22] [j21] [c23] [i24] [i23] [i22] [c20] [c19] [i19] [i18] [j19] [i14] [c14] [c12] [i11] [i10] [i9] [i8] [i7] [i6] [i5] [i4] [i2] [j14] [j13] [j12] [j11] [i1] [j10] [j9] [j8] [c11] [c10] [c8] [c7] [j3]
12Harald Hempel
[j22] [j21] [c19] [i18] [i14] [c12] [i9] [i8] [i7] [i6] [i5] [i4] [j14] [j13] [j12] [j11] [i1] [j10] [c11] [c10] [c7]
13Karen L. Kwast
[c3]
14Gerard R. Renardel de Lavalette
[c3]
15Luc Longpré
[j5] [c5]
16Curtis Menton
[c43] [i40]
17Ashish V. Naik
[j7]
18Mitsunori Ogihara (Mitsunori Ogiwara)
[j7]
19Stanislaw P. Radziszowski
[j25] [c20] [i19]
20Steffen Reith
[c18] [i16] [c17] [i15]
21Jörg Rothe
[c41] [c40] [i39] [i38] [i37] [j35] [j30] [j28] [c33] [i32] [c31] [i29] [j26] [c28] [c26] [i28] [j23] [i27] [i25] [c23] [i22] [c16] [i13] [i11] [i10] [j15] [j9] [j8] [c8]
22Henning Schnoor
[c42] [c39] [c38] [i36] [i35] [j32] [c35] [c32] [c30] [c29] [i31] [i30] [c24]
23Ilka Schnoor
[j32] [c32] [i30] [c24]
24Alan L. Selman
[j7]
25Holger Spakowski
[j23] [j20] [c21] [i17] [c16] [i13]
26Till Tantau
[j31] [c27]
27Mayur Thakur
[c21] [i17]
28Leen Torenvliet
[j2] [c4] [c2] [j1]
29Rahul Tripathi
[j25] [c20] [i19]
30Jörg Vogel
[j20]
31Heribert Vollmer
[c18] [i16] [c17] [i15]
32Osamu Watanabe
[j31] [c27] [i23]
33Gerd Wechsung
[j18] [c9]
34Marius Zimand
[j19] [i2]
Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Fri May 24 19:33:51 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page