pith. sign in

Lane A. Hemaspaandra

Identifiers

  • name variant Lane A. Hemaspaandra 0.60 · backfill

Papers (76)

  1. The Power of Self-Reducibility: Selectivity, Information, and Approximation cs.CC · 2019 · author #1
  2. Team Diagonalization cs.CC · 2018 · author #1
  3. The Robustness of LWPP and WPP, with an Application to Graph Reconstruction cs.CC · 2017 · author #2
  4. Credimus cs.CC · 2017 · author #2
  5. Computational Social Choice and Computational Complexity: BFFs? cs.MA · 2017 · author #1
  6. Existence versus Exploitation: The Opacity of Backbones and Backdoors Under a Weak Assumption cs.AI · 2017 · author #1
  7. Closure and Nonclosure Properties of the Compressible and Rankable Sets cs.LO · 2016 · author #2
  8. Recursion-Theoretic Ranking and Compression cs.LO · 2016 · author #1
  9. The Opacity of Backbones cs.AI · 2016 · author #1
  10. More Natural Models of Electoral Control by Partition cs.GT · 2014 · author #3
  11. Beautiful Structures: An Appreciation of the Contributions of Alan Selman cs.CC · 2014 · author #1
  12. A Control Dichotomy for Pure Scoring Rules cs.GT · 2014 · author #2
  13. The Complexity of Online Manipulation of Sequential Elections cs.GT · 2013 · author #2
  14. Control in the Presence of Manipulators: Cooperative and Competitive Cases cs.GT · 2013 · author #3
  15. Weighted Electoral Control cs.GT · 2013 · author #3
  16. X THEN X: Manipulation of Same-System Runoff Elections cs.GT · 2013 · author #3
  17. An Atypical Survey of Typical-Case Heuristic Algorithms cs.CC · 2012 · author #1
  18. Schulze and Ranked-Pairs Voting are Fixed-Parameter Tractable to Bribe, Manipulate, and Control cs.GT · 2012 · author #1
  19. The Complexity of Online Voter Control in Sequential Elections cs.GT · 2012 · author #2
  20. The Complexity of Online Manipulation of Sequential Elections cs.GT · 2012 · author #2
  21. The Complexity of Controlling Candidate-Sequential Elections cs.GT · 2012 · author #2
  22. Search versus Decision for Election Manipulation Problems cs.GT · 2012 · author #2
  23. Barbosa, Uniform Polynomial Time Bounds, and Promises cs.CC · 2011 · author #1
  24. The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates cs.GT · 2011 · author #3
  25. A Note on Nonuniform versus Uniform ACC^k Circuits for NE cs.CC · 2010 · author #1
  26. Multimode Control Attacks on Elections cs.GT · 2010 · author #3
  27. Llull and Copeland Voting Computationally Resist Bribery and Control cs.GT · 2008 · author #3
  28. Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas cs.CC · 2008 · author #2
  29. The Complexity of Power-Index Comparison cs.CC · 2008 · author #2
  30. Copeland Voting Fully Resists Constructive Control cs.GT · 2007 · author #3
  31. On Approximating Optimal Weighted Lobbying, and Frequency of Correctness versus Average-Case Polynomial Time cs.GT · 2007 · author #2
  32. A Richer Understanding of the Complexity of Election Systems cs.GT · 2006 · author #3
  33. How Hard Is Bribery in Elections? cs.GT · 2006 · author #3
  34. Hybrid Elections Broaden Complexity-Theoretic Resistance to Control cs.GT · 2006 · author #2
  35. The Consequences of Eliminating NP Solutions cs.CC · 2006 · author #2
  36. Query-Monotonic Turing Reductions cs.CC · 2006 · author #1
  37. Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners cs.DS · 2005 · author #2
  38. Cluster Computing and the Power of Edge Recognition cs.CC · 2005 · author #1
  39. Open Questions in the Theory of Semifeasible Computation cs.CC · 2005 · author #2
  40. The Complexity of Kings cs.CC · 2005 · author #2
  41. P-Selectivity, Immunity, and the Power of One Bit cs.CC · 2005 · author #1
  42. Dichotomy for Voting Systems cs.GT · 2005 · author #2
  43. Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory cs.CC · 2005 · author #1
  44. The Complexity of Computing the Size of an Interval cs.CC · 2005 · author #1
  45. Algebraic Properties for Selector Functions cs.CC · 2005 · author #1
  46. Overhead-Free Computation, DCFLs, and CFLs cs.CC · 2004 · author #1
  47. All Superlinear Inverse Schemes are coNP-Hard cs.CC · 2004 · author #2
  48. Complexity Results in Graph Reconstruction cs.CC · 2004 · author #2
  49. Using the No-Search Easy-Hard Technique for Downward Collapse cs.CC · 2001 · author #2
  50. P-Immune Sets with Holes Lack Self-Reducibility Properties cs.CC · 2001 · author #1
  51. A Moment of Perfect Clarity II: Consequences of Sparse Sets Hard for NP with Respect to Weak Reductions cs.CC · 2000 · author #2
  52. If P \neq NP then Some Strongly Noninvertible Functions are Invertible cs.CC · 2000 · author #1
  53. A Moment of Perfect Clarity I: The Parallel Census Technique cs.CC · 2000 · author #2
  54. Take-home Complexity cs.CY · 2000 · author #1
  55. Translating Equality Downwards cs.CC · 1999 · author #2
  56. A Downward Collapse within the Polynomial Hierarchy cs.CC · 1999 · author #2
  57. Self-Specifying Machines cs.CC · 1999 · author #1
  58. Query Order and the Polynomial Hierarchy cs.CC · 1999 · author #2
  59. An Introduction to Query Order cs.CC · 1999 · author #2
  60. R_{1-tt}^{SN}(NP) Distinguishes Robust Many-One and Turing Completeness cs.CC · 1999 · author #2
  61. What's Up with Downward Collapse: Using the Easy-Hard Technique to Link Boolean and Polynomial Hierarchy Collapses cs.CC · 1999 · author #2
  62. Query Order cs.CC · 1999 · author #1
  63. Restrictive Acceptance Suffices for Equivalence Problems cs.CC · 1999 · author #2
  64. Characterizations of the Existence of Partial and Total One-Way Permutations cs.CC · 1999 · author #2
  65. Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets cs.CC · 1999 · author #1
  66. Raising NP Lower Bounds to Parallel NP Lower Bounds cs.CC · 1999 · author #2
  67. A Second Step Towards Complexity-Theoretic Analogs of Rice's Theorem cs.CC · 1999 · author #1
  68. Boolean Operations, Joins, and the Extended Low Hierarchy cs.CC · 1999 · author #1
  69. Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP cs.CC · 1999 · author #2
  70. Easy Sets and Hard Certificate Schemes cs.CC · 1999 · author #1
  71. Polynomial-Time Multi-Selectivity cs.CC · 1999 · author #1
  72. Robust Reductions cs.CC · 1999 · author #2
  73. On Bounded-Weight Error-Correcting Codes cs.IT · 1999 · author #3
  74. Writing and Editing Complexity Theory: Tales and Tools cs.GL · 1998 · author #1
  75. Downward Collapse from a Weaker Hypothesis cs.CC · 1998 · author #2
  76. Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function cs.CC · 1998 · author #1

Mentions

  • 1305.0943 #3 · backfill · confidence 0.70 Lane A. Hemaspaandra
  • 1301.6118 #3 · backfill · confidence 0.70 Lane A. Hemaspaandra
  • 1210.8099 #1 · backfill · confidence 0.70 Lane A. Hemaspaandra
  • 1210.6963 #1 · backfill · confidence 0.70 Lane A. Hemaspaandra
  • 1203.0411 #2 · backfill · confidence 0.70 Lane A. Hemaspaandra
  • 1202.6655 #2 · backfill · confidence 0.70 Lane A. Hemaspaandra
  • 1202.6649 #2 · backfill · confidence 0.70 Lane A. Hemaspaandra
  • 1202.6641 #2 · backfill · confidence 0.70 Lane A. Hemaspaandra
  • 1106.1150 #1 · backfill · confidence 0.70 Lane A. Hemaspaandra
  • 1105.5032 #3 · backfill · confidence 0.70 Lane A. Hemaspaandra
  • 1012.0556 #1 · backfill · confidence 0.70 Lane A. Hemaspaandra
  • 1007.1800 #3 · backfill · confidence 0.70 Lane A. Hemaspaandra
  • 0809.4484 #3 · backfill · confidence 0.70 Lane A. Hemaspaandra
  • 0806.2555 #2 · backfill · confidence 0.70 Lane A. Hemaspaandra
  • 0801.4585 #2 · backfill · confidence 0.70 Lane A. Hemaspaandra
  • 0711.4759 #3 · backfill · confidence 0.70 Lane A. Hemaspaandra

Frequent Coauthors