Lane A. Hemaspaandra
Orcid: 0000-0003-0659-5204Affiliations:
- University of Rochester, New York, USA
According to our database1,
Lane A. Hemaspaandra
authored at least 295 papers
between 1986 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on id.loc.gov
On csauthors.net:
Bibliography
2023
SIGACT News Complexity Theory Column 117: Thirty Years of Complexity Theory (Columns).
SIGACT News, March, 2023
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023
2022
SIGACT News, 2022
J. Comput. Syst. Sci., 2022
Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022
2021
Prog. Artif. Intell., 2021
J. Comput. Syst. Sci., 2021
2020
ACM Trans. Comput. Theory, 2020
SIGACT News Complexity Theory Column 106: Teaching Models, Computability, and Complexity in Time of COVID-19.
SIGACT News, 2020
Comput. Complex., 2020
Correction to: Control in the presence of manipulators: cooperative and competitive cases.
Auton. Agents Multi Agent Syst., 2020
Auton. Agents Multi Agent Syst., 2020
Proceedings of the Complexity and Approximation - In Memory of Ker-I Ko, 2020
2019
Proceedings of the Proceedings Seventeenth Conference on Theoretical Aspects of Rationality and Knowledge, 2019
Existence Versus Exploitation: The Opacity of Backdoors and Backbones Under a Weak Assumption.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019
Proceedings of the Language and Automata Theory and Applications, 2019
2018
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018
2017
Theor. Comput. Sci., 2017
Auton. Agents Multi Agent Syst., 2017
2016
Proceedings of the Handbook of Computational Social Choice, 2016
SIGACT News Complexity Theory Column 90: Introduction to Complexity Theory Column 90.
SIGACT News, 2016
Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control.
Ann. Math. Artif. Intell., 2016
Ann. Math. Artif. Intell., 2016
Proceedings of the Economics and Computation, 2016
2015
SIGACT News Complexity Theory Column 88/89: Introduction to Complexity Theory Column 88/89.
SIGACT News, 2015
SIGACT News Complexity Theory Column 87: Introduction to Complexity Theory Column 87.
SIGACT News, 2015
SIGACT News Complexity Theory Column 86: Introduction to Complexity Theory Column 86.
SIGACT News, 2015
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.
J. Artif. Intell. Res., 2015
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract).
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015
2014
SIGACT News, 2014
J. Comput. Syst. Sci., 2014
Artif. Intell., 2014
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014
2013
Int. J. Game Theory, 2013
Proceedings of the Fundamental Problems in Computing, 2013
2012
SIGACT News Complexity Theory Column 76: an atypical survey of typical-case heuristic algorithms.
SIGACT News, 2012
2011
The shield that never was: Societies with single-peaked preferences are more open to manipulation and control.
Inf. Comput., 2011
2010
Proceedings of the Computational Foundations of Social Choice, 07.03. - 12.03.2010, 2010
Proceedings of the Computational Foundations of Social Choice, 07.03. - 12.03.2010, 2010
2009
Math. Log. Q., 2009
J. Artif. Intell. Res., 2009
Guarantees for the success frequency of an algorithm for finding Dodgson-election winners.
J. Heuristics, 2009
2008
Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions.
Theor. Comput. Sci., 2008
CoRR, 2008
Proceedings of the Algorithmic Aspects in Information and Management, 2008
2007
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007
2006
Theor. Comput. Sci., 2006
Theory Comput. Syst., 2006
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006
2005
SIAM J. Comput., 2005
Advice for semifeasible sets and the complexity-theoretic cost(lessness) of algebraic properties.
Int. J. Found. Comput. Sci., 2005
Inf. Comput., 2005
Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory.
Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005
2004
Advice for Semifeasible Sets and the Complexity-Theoretic Cost(lessness) of Algebraic Properties.
Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004
2003
Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-05080-4, 2003
Theor. Comput. Sci., 2003
Proceedings of the Developments in Language Theory, 7th International Conference, 2003
2002
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-04880-1, 2002
Inf. Process. Lett., 2002
Inf. Comput., 2002
2001
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001
2000
Theor. Comput. Sci., 2000
A moment of perfect clarity II: consequences of sparse sets hard for NP with respect to weak reductions.
SIGACT News, 2000
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000
1999
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999
SIGACT News, 1999
One-way functions in worst-case cryptography: algebraic and security properties are on the house.
SIGACT News, 1999
Creating Strong, Total, Commutative, Associative One-Way Functions from Any One-Way Function in Complexity Theory.
J. Comput. Syst. Sci., 1999
CoRR, 1999
R<sub>1-tt</sub><sup>SN</sup>(NP) Distinguishes Robust Many-One and Turing Completeness
CoRR, 1999
CoRR, 1999
Proceedings of the STACS 99, 1999
1998
What's up with downward collapse: using the easy-hard technique to link Boolean and polynomial hierarchy collapses.
SIGACT News, 1998
R<sup><i>S N</i></sup><sub>1-tt</sub> (NP) Distinguishes Robust Many-One and Turing Completeness.
Theory Comput. Syst., 1998
A Note on Linear-Nondeterminism, Linear-Sized, Karp-Lipton Advice for the P-Selective Sets.
J. Univers. Comput. Sci., 1998
ACM J. Exp. Algorithmics, 1998
Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function
CoRR, 1998
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998
1997
SIAM J. Comput., 1997
Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP.
J. ACM, 1997
An Introduction to Query Order.
Bull. EATCS, 1997
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997
R<sup>SN</sup><sub>1-tt</sub>(NP) Distinguishes Robust Many-One and Turing Completeness.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997
1996
Electron. Colloquium Comput. Complex., 1996
Electron. Colloquium Comput. Complex., 1996
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996
1995
SIGACT News, 1995
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995
1994
SIGACT News, 1994
Comput. Complex., 1994
1993
Inf. Comput., January, 1993
Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993
Selectivity.
Proceedings of the Computing and Information, 1993
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993
1992
Math. Syst. Theory, 1992
Is #P Closed under Substraction?
Bull. EATCS, 1992
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992
Promise Problems and Guarded Access to Unambiguous Computation.
Proceedings of the Complexity Theory: Current Research, 1992
Reductions to Sets of Low Information Content.
Proceedings of the Complexity Theory: Current Research, 1992
Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992
1991
Theor. Comput. Sci., 1991
Inf. Process. Lett., 1991
Int. J. Found. Comput. Sci., 1991
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991
On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991
1990
Proceedings of the Algorithms, 1990
Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990
1989
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989
Using Randomness to Characterize the Complexity of Computation.
Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989
Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989
1988
Theor. Comput. Sci., 1988
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988
Proceedings of the Advances in Cryptology, 1988
1987
Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987
Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987
1986
Proceedings of the Structure in Complexity Theory, 1986