The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Edith Hemaspaandra: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
    The Complexity of Bribery in Elections. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  2. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
    Anyone but Him: The Complexity of Precluding an Alternative. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:95-101 [Conf]
  3. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:49-60 [Conf]
  4. Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
    Equivalence and Isomorphism for Boolean Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:412-426 [Conf]
  5. Edith Hemaspaandra
    Modal Satisfiability Is in Deterministic Linear Space. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:332-342 [Conf]
  6. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Query Order in the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:222-232 [Conf]
  7. Edith Hemaspaandra, Gerd Wechsung
    The Minimization Problem for Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:575-584 [Conf]
  8. 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. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:214-224 [Conf]
  9. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
    Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:1308-1314 [Conf]
  10. Edith Hemaspaandra, Holger Spakowski, Mayur Thakur
    Complexity of Cycle Length Modularity Problems in Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:509-518 [Conf]
  11. Edith Hemaspaandra
    Complexity Transfer for Modal Logic (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1994, pp:164-173 [Conf]
  12. Michael Bauland, Edith Hemaspaandra
    Isomorphic Implication. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:119-130 [Conf]
  13. Edith Hemaspaandra, Lane A. Hemaspaandra
    Computational Politics: Electoral Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:64-83 [Conf]
  14. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    All Superlinear Inverse Schemes Are coNP-Hard. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:368-379 [Conf]
  15. Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi
    Complexity Results in Graph Reconstruction. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:287-297 [Conf]
  16. Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
    Generalized Modal Satisfiability. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:500-511 [Conf]
  17. Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
    The Complexity of Boolean Constraint Isomorphism. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:164-175 [Conf]
  18. Edith Hemaspaandra
    The Complexity of Poor Man's Logic. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:230-242 [Conf]
  19. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    A Downward Translation in the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:319-328 [Conf]
  20. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:269-280 [Conf]
  21. Edith Hemaspaandra, Jörg Rothe, Holger Spakowski
    Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:258-269 [Conf]
  22. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
    Anyone but him: The complexity of precluding an alternative. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2007, v:171, n:5-6, pp:255-285 [Journal]
  23. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Using the No-Search Easy-Hard Technique for Downward Collapse [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  24. Edith Hemaspaandra, Jörg Rothe, Holger Spakowski
    Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  25. Elmar Boöler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
    Equivalence and Isomorphism for Boolean Constraint Satisfaction [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  26. Edith Hemaspaandra, Holger Spakowski, Mayur Thakur
    Complexity of Cycle Length Modularity Problems in Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  27. Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
    The Complexity of Boolean Constraint Isomorphism [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  28. Edith Hemaspaandra
    Dichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  29. Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi
    Complexity Results in Graph Reconstruction [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  30. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    All Superlinear Inverse Schemes are coNP-Hard [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  31. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Downward Collapse from a Weaker Hypothesis [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  32. Edith Hemaspaandra
    On the Power of Positive Turing Reductions [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  33. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  34. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
    Raising NP Lower Bounds to Parallel NP Lower Bounds [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  35. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  36. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    R1-ttSN(NP) Distinguishes Robust Many-One and Turing Completeness [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  37. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    An Introduction to Query Order [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  38. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Query Order and the Polynomial Hierarchy [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  39. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    A Downward Collapse within the Polynomial Hierarchy [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  40. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Translating Equality Downwards [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  41. Edith Hemaspaandra
    The Complexity of Poor Man's Logic [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  42. Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand
    Almost-Everywhere Superiority for Quantum Computing [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  43. Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi
    Complexity results in graph reconstruction. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:2, pp:103-118 [Journal]
  44. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    An Introduction to Query Order. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1997, v:63, n:, pp:- [Journal]
  45. Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand
    Almost-Everywhere Superiority for Quantum Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:175, n:2, pp:171-181 [Journal]
  46. Edith Hemaspaandra
    Census Techniques Collapse Space Classes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:2, pp:79-84 [Journal]
  47. Edith Hemaspaandra, Jörg Rothe
    Recognizing when Greed can Approximate Maximum Independent Sets is Complete for Parallel Access to NP. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:3, pp:151-156 [Journal]
  48. 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. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:6, pp:806-825 [Journal]
  49. Edith Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
    P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:2, pp:194-209 [Journal]
  50. Edith Hemaspaandra, Lane A. Hemaspaandra
    Dichotomy for voting systems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:1, pp:73-83 [Journal]
  51. Edith Hemaspaandra
    On the Power of Positive Turing Reductions. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1999, v:5, n:12, pp:828-832 [Journal]
  52. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Query Order and the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1998, v:4, n:6, pp:574-588 [Journal]
  53. Edith Hemaspaandra
    The Complexity of Poor Man's Logic. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2001, v:11, n:4, pp:609-622 [Journal]
  54. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    RS N1-tt (NP) Distinguishes Robust Many-One and Turing Completeness. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:3, pp:307-325 [Journal]
  55. Edith Hemaspaandra
    The Price of Universality. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1996, v:37, n:2, pp:174-203 [Journal]
  56. Harry Buhrman, Edith Hemaspaandra, Luc Longpré
    SPARSE Reduces Conjunctively to TALLY. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:4, pp:673-681 [Journal]
  57. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    A Downward Collapse within the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:383-393 [Journal]
  58. Edith Hemaspaandra, Gerd Wechsung
    The Minimization Problem for Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1948-1958 [Journal]
  59. Edith Hemaspaandra, Lane A. Hemaspaandra
    Quasi-injective Reductions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:123, n:2, pp:407-413 [Journal]
  60. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    All superlinear inverse schemes are coNP-hard. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:345, n:2-3, pp:345-358 [Journal]
  61. Edith Hemaspaandra, Holger Spakowski, Jörg Vogel
    The complexity of Kemeny elections. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:3, pp:382-391 [Journal]
  62. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
    Llull and Copeland Voting Broadly Resist Bribery and Control. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:724-730 [Conf]
  63. Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe
    On the Complexity of Kings. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:328-340 [Conf]
  64. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
    A Richer Understanding of the Complexity of Election Systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  65. Edith Hemaspaandra, Lane A. Hemaspaandra
    Dichotomy for Voting Systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  66. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
    Hybrid Elections Broaden Complexity-Theoretic Resistance to Control [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  67. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
    How Hard Is Bribery in Elections? [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  68. Michael Bauland, Edith Hemaspaandra
    Isomorphic Implication [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]

  69. Approximability of Manipulating Elections. [Citation Graph (, )][DBLP]


  70. Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. [Citation Graph (, )][DBLP]


  71. Copeland Voting Fully Resists Constructive Control. [Citation Graph (, )][DBLP]


  72. Copeland voting: ties matter. [Citation Graph (, )][DBLP]


  73. Manipulation of copeland elections. [Citation Graph (, )][DBLP]


  74. Multimode Control Attacks on Elections. [Citation Graph (, )][DBLP]


  75. On the Complexity of Elementary Modal Logics. [Citation Graph (, )][DBLP]


  76. The shield that never was: societies with single-peaked preferences are more open to manipulation and control. [Citation Graph (, )][DBLP]


  77. The Complexity of Kings [Citation Graph (, )][DBLP]


  78. Anyone but Him: The Complexity of Precluding an Alternative [Citation Graph (, )][DBLP]


  79. Copeland Voting Fully Resists Constructive Control [Citation Graph (, )][DBLP]


  80. On the Complexity of Elementary Modal Logics [Citation Graph (, )][DBLP]


  81. Generalized Modal Satisfiability [Citation Graph (, )][DBLP]


  82. Llull and Copeland Voting Computationally Resist Bribery and Control [Citation Graph (, )][DBLP]


  83. The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control [Citation Graph (, )][DBLP]


  84. Multimode Control Attacks on Elections [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002