The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Lane A. 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. Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung
    On Sets with Easy Certificates and the Existence of One-Way Permutations. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:264-275 [Conf]
  5. Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung
    Robust Reductions. [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:174-183 [Conf]
  6. Lane A. Hemaspaandra, Mayur Thakur
    Query-Monotonic Turing Reductions. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:895-904 [Conf]
  7. Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
    Algebraic Properties for P-Selectivity. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:49-58 [Conf]
  8. Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
    The Join Can Lower Complexity. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:260-267 [Conf]
  9. Lane A. Hemaspaandra, Jörg Rothe
    Intersection Suffices for Boolean Hierarchy Equivalence. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:430-435 [Conf]
  10. Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau
    Computation with Absolutely No Space Overhead. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:325-336 [Conf]
  11. Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
    Restrictive Acceptance Suffices for Equivalence Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:124-135 [Conf]
  12. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Query Order in the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:222-232 [Conf]
  13. Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe
    If P != NP Then Some Strongly Noninvertible Functions Are Invertible. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:162-171 [Conf]
  14. 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]
  15. Lane A. Hemaspaandra, Sven Kosub, Klaus W. Wagner
    The Complexity of Computing the Size of an Interval. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:1040-1051 [Conf]
  16. Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena
    Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:265-279 [Conf]
  17. Lane A. Hemaspaandra, Mayur Thakur
    Lower Bounds and the Hardness of Counting Properties. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:217-229 [Conf]
  18. 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]
  19. Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf
    Threshold Computation and Cryptographic Security. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:230-239 [Conf]
  20. Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
    Computing Solutions Uniquely collapses the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:56-64 [Conf]
  21. Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed Javeed Zaki, Marius Zimand
    The Complexity of Finding Top-Toda-Equivalence-Class Members. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:90-99 [Conf]
  22. Sophie Fischer, Lane A. Hemaspaandra, Leen Torenvliet
    Witness-Isomorphic Reductions and the Local Search Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:277-287 [Conf]
  23. Edith Hemaspaandra, Lane A. Hemaspaandra
    Computational Politics: Electoral Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:64-83 [Conf]
  24. 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]
  25. 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]
  26. Lane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung
    Reducing the Number of Solutions of NP Functions. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:394-404 [Conf]
  27. Lane A. Hemaspaandra, Jörg Rothe
    A Second Step Towards Circuit Complexity-Theoretic Analogs of Rice's Theorem. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:418-426 [Conf]
  28. Christopher M. Homan, Lane A. Hemaspaandra
    Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:528-539 [Conf]
  29. Lane A. Hemaspaandra, Leen Torenvliet
    P-Selectivity, Immunity, and the Power of One Bit. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:323-331 [Conf]
  30. Jin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara
    Competing Provers Yield Improved Karp-Lipton Collapse Results. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:535-546 [Conf]
  31. Yenjo Han, Lane A. Hemaspaandra
    Pseudorandom Generators and the Frequency of Simplicity. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:50-59 [Conf]
  32. 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]
  33. 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]
  34. Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub
    Cluster Computing and the Power of Edge Recognition. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:283-294 [Conf]
  35. Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung
    Easy Sets and Hard Certificate Schemes. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1997, v:34, n:11, pp:859-879 [Journal]
  36. 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]
  37. Lane A. Hemaspaandra, Mitsunori Ogihara, Seinosuke Toda
    Space-Efficient Recognition of Sparse Self-Reducible Languages. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:262-296 [Journal]
  38. Christian Glaßer, Lane A. Hemaspaandra
    A Moment of Perfect Clarity I: The Parallel Census Technique [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  39. Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe
    If P \neq NP then Some Strongly Noninvertible Functions are Invertible [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  40. Christian Glaßer, Lane A. Hemaspaandra
    A Moment of Perfect Clarity II: Consequences of Sparse Sets Hard for NP with Respect to Weak Reductions [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  41. Lane A. Hemaspaandra, Harald Hempel
    P-Immune Sets with Holes Lack Self-Reducibility Properties [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  42. 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]
  43. 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]
  44. 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]
  45. Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau
    Overhead-Free Computation, DCFLs, and CFLs [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  46. 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]
  47. Lane A. Hemaspaandra, Jörg Rothe
    Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  48. Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung
    Robust Reductions [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  49. Lane A. Hemaspaandra, Jörg Rothe
    Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  50. Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
    Polynomial-Time Multi-Selectivity [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  51. Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung
    Easy Sets and Hard Certificate Schemes [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  52. 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]
  53. Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
    Boolean Operations, Joins, and the Extended Low Hierarchy [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  54. Lane A. Hemaspaandra, Jörg Rothe
    A Second Step Towards Complexity-Theoretic Analogs of Rice's Theorem [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  55. 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]
  56. Jörg Rothe, Lane A. Hemaspaandra
    Characterizations of the Existence of Partial and Total One-Way Permutations [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  57. Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
    Restrictive Acceptance Suffices for Equivalence Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  58. Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
    Query Order [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  59. 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]
  60. 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]
  61. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    An Introduction to Query Order [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  62. 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]
  63. Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
    Self-Specifying Machines [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  64. 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]
  65. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Translating Equality Downwards [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  66. Alina Beygelzimer, Lane A. Hemaspaandra, Christopher M. Homan, Jörg Rothe
    One-Way Functions in Worst-Case Cryptography: Algebraic and Security Properties [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  67. Lane A. Hemaspaandra
    Take-home Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  68. Lane A. Hemaspaandra, Alan L. Selman
    Writing and Editing Complexity Theory: Tales and Tools [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  69. Russell Bent, Michael Schear, Lane A. Hemaspaandra, Gabriel Istrate
    On Bounded-Weight Error-Correcting Codes [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  70. 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]
  71. 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]
  72. 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]
  73. Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
    Computing Solutions Uniquely Collapses the Polynomial Hierarchy [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:27, pp:- [Journal]
  74. Richard Beigel, Lane A. Hemaspaandra, Harald Hempel, Jörg Vogel
    Optimal Series-Parallel Trade-offs for Reducing a Function to Its Own Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:173, n:2, pp:123-131 [Journal]
  75. Jin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara
    Competing provers yield improved Karp-Lipton collapse results. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:198, n:1, pp:1-23 [Journal]
  76. 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]
  77. Lane A. Hemaspaandra, Sudhir K. Jha
    Defying Upward and Downward Separation [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:121, n:1, pp:1-13 [Journal]
  78. Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau
    Context-free languages can be accepted with absolutely no space overhead. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:203, n:2, pp:163-180 [Journal]
  79. Piotr Faliszewski, Lane A. Hemaspaandra
    Advice for semifeasible sets and the complexity-theoretic cost(lessness) of algebraic properties. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:913-928 [Journal]
  80. Lane A. Hemaspaandra, Albrecht Hoene, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman, Thomas Thierauf, Jie Wang
    Nondeterministically Selective Sets. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1995, v:6, n:4, pp:403-416 [Journal]
  81. Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
    Self-Specifying Machines. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:3, pp:263-276 [Journal]
  82. Lane A. Hemaspaandra, Z. Jiang
    Logspace Reducibility: Models and Equivalences. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1997, v:8, n:1, pp:95-0 [Journal]
  83. Lane A. Hemaspaandra, Sanjay Jain, Nikolai K. Vereshchagin
    Banishing Robust Turing Completeness. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:3, pp:245-265 [Journal]
  84. Jörg Rothe, Lane A. Hemaspaandra
    On characterizing the existence of partial one-way permutations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:82, n:3, pp:165-171 [Journal]
  85. 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]
  86. Lane A. Hemaspaandra, Mitsunori Ogihara
    Universally Serializable Computation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:55, n:3, pp:547-560 [Journal]
  87. Lane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung
    Reducing the Number of Solutions of NP Functions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:64, n:2, pp:311-328 [Journal]
  88. Lane A. Hemaspaandra, Jörg Rothe
    Creating Strong, Total, Commutative, Associative One-Way Functions from Any One-Way Function in Complexity Theory. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:3, pp:648-659 [Journal]
  89. 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]
  90. Lane A. Hemaspaandra, Kulathur S. Rajasethupathy, Prasanna Sethupathy, Marius Zimand
    Power Balance and Apportionment Algorithms for the United States Congress. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 1998, v:3, n:, pp:1- [Journal]
  91. Yenjo Han, Lane A. Hemaspaandra
    Pseudorandom Generators and the Frequency of Simplicity. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1996, v:9, n:4, pp:251-261 [Journal]
  92. Russell Bent, Michael Schear, Lane A. Hemaspaandra, Gabriel Istrate
    A Note on Bounded-Weight Error-Correcting Codes. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1999, v:5, n:12, pp:817-827 [Journal]
  93. 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]
  94. Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
    Polynomial-Time Multi-Selectivity. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1997, v:3, n:3, pp:197-229 [Journal]
  95. Lane A. Hemaspaandra, Christopher Nasipak, Keith Parkins
    A Note on Linear-Nondeterminism, Linear-Sized, Karp-Lipton Advice for the P-Selective Sets. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1998, v:4, n:8, pp:670-674 [Journal]
  96. Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung
    Robust Reductions. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1999, v:32, n:6, pp:625-647 [Journal]
  97. 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]
  98. Lane A. Hemaspaandra, Marius Zimand
    Strong Self-Reducibility Precludes Strong Immunity. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:5, pp:535-548 [Journal]
  99. Dieter Kratsch, Lane A. Hemaspaandra
    On the Complexity of Graph Reconstruction. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:3, pp:257-273 [Journal]
  100. Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf
    Threshold Computation and Cryptographic Security. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:59-78 [Journal]
  101. 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]
  102. Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
    Algebraic Properties for Selector Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:6, pp:1309-1337 [Journal]
  103. Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
    Query Order. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:637-651 [Journal]
  104. Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
    Computing Solutions Uniquely Collapses the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:4, pp:697-708 [Journal]
  105. Lane A. Hemaspaandra, Jörg Rothe
    Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:3, pp:634-653 [Journal]
  106. Lane A. Hemaspaandra, Riccardo Silvestri
    Easily Checked Generalized Self-Reducibility. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:4, pp:840-858 [Journal]
  107. Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner
    The Complexity of Computing the Size of an Interval. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1264-1300 [Journal]
  108. Lane A. Hemaspaandra, Harald Hempel
    P-immune sets with holes lack self-reducibility properties. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:457-466 [Journal]
  109. 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]
  110. 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]
  111. Lane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara
    Erratum to "Reducibility classes of P-selective sets". [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:323- [Journal]
  112. Lane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara
    Reducibility Classes of P-Selective Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:155, n:2, pp:447-457 [Journal]
  113. Lane A. Hemaspaandra, Zhigen Jiang
    P-Selectivity: Intersections and Indices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:145, n:1&2, pp:371-380 [Journal]
  114. Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
    Boolean Operations, Joins, and the Extended Low Hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:205, n:1-2, pp:317-327 [Journal]
  115. Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe
    If P neq NP then some strongly noninvertible functions are invertible. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:54-62 [Journal]
  116. Lane A. Hemaspaandra, Jörg Rothe
    A second step towards complexity-theoretic analogs of Rice's Theorem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:244, n:1-2, pp:205-217 [Journal]
  117. Lane A. Hemaspaandra, Jörg Rothe
    Characterizing the existence of one-way permutations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:244, n:1-2, pp:257-261 [Journal]
  118. Lane A. Hemaspaandra, Mayur Thakur
    Lower bounds and the hardness of counting properties. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:1-28 [Journal]
  119. Lane A. Hemaspaandra, Leen Torenvliet
    Optimal Advice. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:154, n:2, pp:367-377 [Journal]
  120. 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]
  121. Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
    On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:300-311 [Conf]
  122. 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]
  123. Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
    On Approximating Optimal Weighted Lobbying, and Frequency of Correctness versus Average-Case Polynomial Time [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  124. 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]
  125. Lane A. Hemaspaandra, Mayur Thakur
    Query-Monotonic Turing Reductions [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  126. Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
    Algebraic Properties for Selector Functions [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  127. Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner
    The Complexity of Computing the Size of an Interval [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  128. Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena
    Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  129. Piotr Faliszewski, Lane A. Hemaspaandra
    The Consequences of Eliminating NP Solutions [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  130. Edith Hemaspaandra, Lane A. Hemaspaandra
    Dichotomy for Voting Systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  131. Lane A. Hemaspaandra, Leen Torenvliet
    P-Selectivity, Immunity, and the Power of One Bit [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  132. 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]
  133. 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]
  134. Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub
    Cluster computing and the power of edge recognition. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:8, pp:1274-1293 [Journal]
  135. Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed J. Zaki, Marius Zimand
    The Complexity of Finding Top-Toda-Equivalence-Class Members. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:5, pp:669-684 [Journal]
  136. Lane A. Hemaspaandra, Mayur Thakur
    Query-monotonic Turing reductions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:383, n:2-3, pp:153-186 [Journal]

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


  138. The Complexity of Power-Index Comparison. [Citation Graph (, )][DBLP]


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


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


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


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


  143. Open Questions in the Theory of Semifeasible Computation [Citation Graph (, )][DBLP]


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


  145. Cluster Computing and the Power of Edge Recognition [Citation Graph (, )][DBLP]


  146. Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners [Citation Graph (, )][DBLP]


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


  148. The Complexity of Power-Index Comparison [Citation Graph (, )][DBLP]


  149. Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas [Citation Graph (, )][DBLP]


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


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


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


Search in 0.101secs, Finished in 0.107secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002