Lane A. Hemaspaandra

350 papers A* 13A 12B 23C 8Misc 5Journal 271Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	Conceptual Models for Teaching and Learning Computer Science Theory. SIGCSE (2) Kimberly Fluet, Lane A. Hemaspaandra, Christopher Homan
2024	J	`jnl`	Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting. ACM Trans. Comput. Theory Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah, Patrick A. Phillips
2024	C	`conf`	Search Versus Search for Collapsing Electoral Control Types. EUMAS Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles
2024	J	`jnl`	Separating and Collapsing Electoral Control Types. J. Artif. Intell. Res. Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles
2023	J	`jnl`	SIGACT News Complexity Theory Column 116. SIGACT News Lane A. Hemaspaandra
2023	J	`jnl`	SIGACT News Complexity Theory Column 117: Thirty Years of Complexity Theory (Columns). SIGACT News Lane A. Hemaspaandra
2023	A	`conf`	Search versus Search for Collapsing Electoral Control Types. AAMAS Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles
2023	A	`conf`	Separating and Collapsing Electoral Control Types. AAMAS Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles
2022	B	`conf`	Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting. MFCS Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah, Patrick A. Phillips
2022	J	`jnl`	SIGACT News Complexity Theory Column 112. SIGACT News Lane A. Hemaspaandra
2022	J	`jnl`	SIGACT News Complexity Theory Column 113. SIGACT News Lane A. Hemaspaandra
2022	J	`jnl`	SIGACT News Complexity Theory Column 115: Juris Hartmanis and Two Golden Rules. SIGACT News Lane A. Hemaspaandra
2022	J	`jnl`	SIGACT news complexity theory column 114. SIGACT News Lane A. Hemaspaandra
2022	J	`jnl`	Search versus Search for Collapsing Electoral Control Types. CoRR Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles
2022	J	`jnl`	Separating and Collapsing Electoral Control Types. CoRR Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles
2022	J	`jnl`	The complexity of online bribery in sequential elections. J. Comput. Syst. Sci. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2021	J	`jnl`	Closure and nonclosure properties of the classes of compressible and rankable sets. J. Comput. Syst. Sci. Jackson Abascal, Lane A. Hemaspaandra, Shir Maimon, Daniel Rubery
2021	J	`jnl`	Existence versus exploitation: the opacity of backdoors and backbones. Prog. Artif. Intell. Lane A. Hemaspaandra, David E. Narváez
2021	J	`jnl`	Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting. CoRR Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah, Patrick A. Phillips
2021	J	`jnl`	SIGACT News Complexity Theory Column 108. SIGACT News Lane A. Hemaspaandra
2021	J	`jnl`	SIGACT News Complexity Theory Column 109. SIGACT News Lane A. Hemaspaandra
2021	J	`jnl`	SIGACT News Complexity Theory Column 110. SIGACT News Lane A. Hemaspaandra
2021	J	`jnl`	SIGACT News Complexity Theory Column 111. SIGACT News Lane A. Hemaspaandra
2021	J	`jnl`	The opacity of backbones. Inf. Comput. Lane A. Hemaspaandra, David E. Narváez
2021	J	`jnl`	Thoughts on Alan Selman (1941-2021). Bull. EATCS Lane A. Hemaspaandra
2020	J	`jnl`	Control in the presence of manipulators: cooperative and competitive cases. Auton. Agents Multi Agent Syst. Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
2020	J	`jnl`	Correction to: Control in the presence of manipulators: cooperative and competitive cases. Auton. Agents Multi Agent Syst. Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
2020	J	`jnl`	SIGACT News Complexity Theory Column 104. SIGACT News Lane A. Hemaspaandra
2020	J	`jnl`	SIGACT News Complexity Theory Column 105. SIGACT News Lane A. Hemaspaandra
2020	J	`jnl`	SIGACT News Complexity Theory Column 106: Teaching Models, Computability, and Complexity in Time of COVID-19. SIGACT News Lane A. Hemaspaandra
2020	J	`jnl`	SIGACT News Complexity Theory Column 107. SIGACT News Lane A. Hemaspaandra
2020	J	`jnl`	Search versus Decision for Election Manipulation Problems. ACM Trans. Comput. Theory Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton
2020	—	`conf`	The Power of Self-Reducibility: Selectivity, Information, and Approximation. Complexity and Approximation Lane A. Hemaspaandra
2020	J	`jnl`	The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. Comput. Complex. Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe
2019	C	`conf`	Closure and Nonclosure Properties of the Compressible and Rankable Sets. LATA Jackson Abascal, Lane A. Hemaspaandra, Shir Maimon, Daniel Rubery
2019	B	`conf`	Existence Versus Exploitation: The Opacity of Backdoors and Backbones Under a Weak Assumption. SOFSEM Lane A. Hemaspaandra, David E. Narváez
2019	J	`jnl`	Recursion-theoretic ranking and compression. J. Comput. Syst. Sci. Lane A. Hemaspaandra, Daniel Rubery
2019	J	`jnl`	SIGACT News Complexity Theory Column 100. SIGACT News Lane A. Hemaspaandra
2019	J	`jnl`	SIGACT News Complexity Theory Column 101. SIGACT News Lane A. Hemaspaandra
2019	J	`jnl`	SIGACT News Complexity Theory Column 102. SIGACT News Lane A. Hemaspaandra
2019	J	`jnl`	SIGACT News Complexity Theory Column 103. SIGACT News Lane A. Hemaspaandra
2019	B	`conf`	The Complexity of Online Bribery in Sequential Elections (Extended Abstract). TARK Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2019	J	`jnl`	The Complexity of Online Bribery in Sequential Elections. CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2019	J	`jnl`	The Power of Self-Reducibility: Selectivity, Information, and Approximation. CoRR Lane A. Hemaspaandra
2018	J	`jnl`	Column: Team Diagonalization. SIGACT News Lane A. Hemaspaandra, Holger Spakowski
2018	A*	`conf`	Computational Social Choice and Computational Complexity: BFFs? AAAI Lane A. Hemaspaandra
2018	J	`jnl`	SIGACT News Complexity Theory Column 97. SIGACT News Lane A. Hemaspaandra
2018	J	`jnl`	SIGACT News Complexity Theory Column 98. SIGACT News Lane A. Hemaspaandra
2018	J	`jnl`	SIGACT News Complexity Theory Column 99. SIGACT News Lane A. Hemaspaandra
2018	J	`jnl`	Team Diagonalization. CoRR Lane A. Hemaspaandra, Holger Spakowski
2018	—	`conf`	That Most Important Intersection. Adventures Between Lower Bounds and Higher Altitudes Lane A. Hemaspaandra
2018	B	`conf`	The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. MFCS Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe
2017	J	`jnl`	Computational Social Choice and Computational Complexity: BFFs? CoRR Lane A. Hemaspaandra
2017	J	`jnl`	Credimus. CoRR Edith Hemaspaandra, Lane A. Hemaspaandra
2017	J	`jnl`	SIGACT News Complexity Theory Column 93. SIGACT News Lane A. Hemaspaandra
2017	J	`jnl`	SIGACT News Complexity Theory Column 94. SIGACT News Lane A. Hemaspaandra
2017	J	`jnl`	SIGACT News Complexity Theory Column 96. SIGACT News Lane A. Hemaspaandra
2017	J	`jnl`	The Opacity of Backbones and Backdoors Under a Weak Assumption. CoRR Lane A. Hemaspaandra, David E. Narváez
2017	A*	`conf`	The Opacity of Backbones. AAAI Lane A. Hemaspaandra, David E. Narváez
2017	J	`jnl`	The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe
2017	J	`jnl`	The complexity of controlling candidate-sequential elections. Theor. Comput. Sci. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2017	J	`jnl`	The complexity of online voter control in sequential elections. Auton. Agents Multi Agent Syst. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2016	—	`ch.`	Dodgson's Rule and Young's Rule. Handbook of Computational Social Choice Ioannis Caragiannis, Edith Hemaspaandra, Lane A. Hemaspaandra
2016	J	`jnl`	Manipulation Complexity of Same-System Runoff Elections. Ann. Math. Artif. Intell. Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
2016	J	`jnl`	More on Compression and Ranking. CoRR Lane A. Hemaspaandra, Daniel Rubery
2016	J	`jnl`	Recursion-Theoretic Ranking and Compression. CoRR Lane A. Hemaspaandra, Daniel Rubery
2016	J	`jnl`	SIGACT News Complexity Theory Column 90: Introduction to Complexity Theory Column 90. SIGACT News Lane A. Hemaspaandra
2016	J	`jnl`	SIGACT News Complexity Theory Column 91. SIGACT News Lane A. Hemaspaandra
2016	J	`jnl`	SIGACT News Complexity Theory Column 93. SIGACT News Lane A. Hemaspaandra
2016	J	`jnl`	Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control. Ann. Math. Artif. Intell. Lane A. Hemaspaandra, Rahman Lavaee, Curtis Menton
2016	—	`ch.`	The Complexity of Manipulative Actions in Single-Peaked Societies. Economics and Computation Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2016	J	`jnl`	The Opacity of Backbones. CoRR Lane A. Hemaspaandra, David E. Narváez
2015	J	`jnl`	Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. J. Artif. Intell. Res. Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra
2015	—	`conf`	More Natural Models of Electoral Control by Partition. ADT Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra
2015	J	`jnl`	SIGACT News Complexity Theory Column 85. SIGACT News Lane A. Hemaspaandra
2015	J	`jnl`	SIGACT News Complexity Theory Column 86: Introduction to Complexity Theory Column 86. SIGACT News Lane A. Hemaspaandra
2015	J	`jnl`	SIGACT News Complexity Theory Column 87: Introduction to Complexity Theory Column 87. SIGACT News Lane A. Hemaspaandra
2015	J	`jnl`	SIGACT News Complexity Theory Column 88/89: Introduction to Complexity Theory Column 88/89. SIGACT News Lane A. Hemaspaandra
2015	A*	`conf`	The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract). IJCAI Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2015	J	`jnl`	Weighted Electoral Control. J. Artif. Intell. Res. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2014	A*	`conf`	A Control Dichotomy for Pure Scoring Rules. AAAI Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor
2014	J	`jnl`	A Control Dichotomy for Pure Scoring Rules. CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor
2014	J	`jnl`	Beautiful Structures: An Appreciation of the Contributions of Alan Selman. CoRR Lane A. Hemaspaandra
2014	J	`jnl`	Beautiful structures: an appreciation of the contributions of Alan Selman. SIGACT News Lane A. Hemaspaandra
2014	A	`conf`	Bribery and voter control under voting-rule uncertainty. AAMAS Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra
2014	J	`jnl`	More Natural Models of Electoral Control by Partition. CoRR Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra
2014	J	`jnl`	SIGACT News Complexity Theory Column 84. SIGACT News Lane A. Hemaspaandra
2014	J	`jnl`	SIGACT news complexity theory column 81. SIGACT News Lane A. Hemaspaandra
2014	J	`jnl`	SIGACT news complexity theory column 82. SIGACT News Lane A. Hemaspaandra
2014	J	`jnl`	SIGACT news complexity theory column 82. SIGACT News Lane A. Hemaspaandra
2014	J	`jnl`	The complexity of manipulative attacks in nearly single-peaked electorates. Artif. Intell. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2014	J	`jnl`	The complexity of online manipulation of sequential elections. J. Comput. Syst. Sci. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2013	—	`conf`	A Richer Understanding of the Complexity of Election Systems. Fundamental Problems in Computing Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2013	A*	`conf`	Control in the Presence of Manipulators: Cooperative and Competitive Cases. IJCAI Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
2013	J	`jnl`	Control in the Presence of Manipulators: Cooperative and Competitive Cases. CoRR Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
2013	J	`jnl`	SIGACT news complexity theory column 77. SIGACT News Lane A. Hemaspaandra
2013	J	`jnl`	SIGACT news complexity theory column 78. SIGACT News Lane A. Hemaspaandra
2013	J	`jnl`	SIGACT news complexity theory column 80. SIGACT News Lane A. Hemaspaandra
2013	A	`conf`	Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control. AAMAS Lane A. Hemaspaandra, Rahman Lavaee, Curtis Menton
2013	A	`conf`	Search versus Decision for Election Manipulation Problems. STACS Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton
2013	B	`conf`	The Complexity of Online Manipulation of Sequential Elections. TARK Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2013	J	`jnl`	The Complexity of Online Manipulation of Sequential Elections. CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2013	J	`jnl`	Three hierarchies of simple games parameterized by "resource" parameters. Int. J. Game Theory Tatiana Gvozdeva, Lane A. Hemaspaandra, Arkadii M. Slinko
2013	J	`jnl`	Weighted Electoral Control CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2013	A	`conf`	Weighted electoral control. AAMAS Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2013	J	`jnl`	X THEN X: Manipulation of Same-System Runoff Elections CoRR Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
2012	J	`jnl`	An Atypical Survey of Typical-Case Heuristic Algorithms CoRR Lane A. Hemaspaandra, Ryan Williams
2012	J	`jnl`	Controlling Candidate-Sequential Elections CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2012	A	`conf`	Controlling Candidate-Sequential Elections. ECAI Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2012	J	`jnl`	Online Voter Control in Sequential Elections CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2012	A	`conf`	Online Voter Control in Sequential Elections. ECAI Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2012	J	`jnl`	SIGACT News Complexity Theory Column 76: an atypical survey of typical-case heuristic algorithms. SIGACT News Lane A. Hemaspaandra, Ryan Williams
2012	J	`jnl`	SIGACT news complexity theory column 73. SIGACT News Lane A. Hemaspaandra
2012	J	`jnl`	SIGACT news complexity theory column 74. SIGACT News Lane A. Hemaspaandra
2012	J	`jnl`	SIGACT news complexity theory column 75. SIGACT News Lane A. Hemaspaandra
2012	J	`jnl`	Schulze and Ranked-Pairs Voting are Fixed-Parameter Tractable to Bribe, Manipulate, and Control CoRR Lane A. Hemaspaandra, Rahman Lavaee, Curtis Menton
2012	J	`jnl`	Search versus Decision for Election Manipulation Problems CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton
2012	J	`jnl`	The Complexity of Online Manipulation of Sequential Elections CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2011	J	`jnl`	Barbosa, Uniform Polynomial Time Bounds, and Promises CoRR Lane A. Hemaspaandra, Kyle Murray, Xiaoqing Tang
2011	J	`jnl`	Multimode Control Attacks on Elections. J. Artif. Intell. Res. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2011	J	`jnl`	SIGACT news complexity theory column 69. SIGACT News Lane A. Hemaspaandra
2011	J	`jnl`	SIGACT news complexity theory column 70. SIGACT News Lane A. Hemaspaandra
2011	J	`jnl`	SIGACT news complexity theory column 71. SIGACT News Lane A. Hemaspaandra
2011	J	`jnl`	SIGACT news complexity theory column 72. SIGACT News Lane A. Hemaspaandra
2011	J	`jnl`	The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2011	B	`conf`	The complexity of manipulative attacks in nearly single-peaked electorates. TARK Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2011	J	`jnl`	The shield that never was: Societies with single-peaked preferences are more open to manipulation and control. Inf. Comput. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2010	—	`conf`	10101 Abstracts Collection - Computational Foundations of Social Choice. Computational Foundations of Social Choice Felix Brandt, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, William S. Zwicker
2010	—	`conf`	10101 Executive Summary - Computational Foundations of Social Choice. Computational Foundations of Social Choice Felix Brandt, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, William S. Zwicker
2010	J	`jnl`	A Note on Nonuniform versus Uniform ACC^k Circuits for NE CoRR Lane A. Hemaspaandra
2010	A*	`conf`	Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. AAAI Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra
2010	—	`ed.`	Computational Foundations of Social Choice, 07.03. - 12.03.2010 Computational Foundations of Social Choice Felix Brandt, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, William S. Zwicker
2010	J	`jnl`	Multimode Control Attacks on Elections CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2010	J	`jnl`	On the complexity of kings. Theor. Comput. Sci. Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe
2010	J	`jnl`	SIGACT News Complexity Theory Column 67. SIGACT News Lane A. Hemaspaandra
2010	J	`jnl`	SIGACT news complexity theory column 68. SIGACT News Lane A. Hemaspaandra
2010	J	`jnl`	Using complexity to protect elections. Commun. ACM Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2009	J	`jnl`	Frequency of correctness versus average polynomial time. Inf. Process. Lett. Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
2009	J	`jnl`	Generalized juntas and NP-hard sets. Theor. Comput. Sci. Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
2009	J	`jnl`	Guarantees for the success frequency of an algorithm for finding Dodgson-election winners. J. Heuristics Christopher M. Homan, Lane A. Hemaspaandra
2009	J	`jnl`	How Hard Is Bribery in Elections? J. Artif. Intell. Res. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2009	J	`jnl`	Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. Math. Log. Q. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2009	J	`jnl`	Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. J. Artif. Intell. Res. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2009	A*	`conf`	Multimode Control Attacks on Elections. IJCAI Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2009	J	`jnl`	SIGACT news complexity theory column 62. SIGACT News Lane A. Hemaspaandra
2009	J	`jnl`	SIGACT news complexity theory column 63. SIGACT News Lane A. Hemaspaandra
2009	J	`jnl`	SIGACT news complexity theory column 64. SIGACT News Lane A. Hemaspaandra
2009	J	`jnl`	SIGACT news complexity theory column 65. SIGACT News Lane A. Hemaspaandra
2009	J	`jnl`	The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2009	J	`jnl`	The complexity of power-index comparison. Theor. Comput. Sci. Piotr Faliszewski, Lane A. Hemaspaandra
2009	B	`conf`	The shield that never was: societies with single-peaked preferences are more open to manipulation and control. TARK Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2008	C	`conf`	Copeland Voting Fully Resists Constructive Control. AAIM Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2008	J	`jnl`	Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions. Theor. Comput. Sci. Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena
2008	J	`jnl`	Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas CoRR Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
2008	J	`jnl`	Llull and Copeland Voting Computationally Resist Bribery and Control CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2008	J	`jnl`	SIGACT news complexity theory column 59: introduction. SIGACT News Lane A. Hemaspaandra
2008	J	`jnl`	SIGACT news complexity theory column 61. SIGACT News Lane A. Hemaspaandra
2008	J	`jnl`	The Complexity of Power-Index Comparison CoRR Piotr Faliszewski, Lane A. Hemaspaandra
2008	C	`conf`	The Complexity of Power-Index Comparison. AAIM Piotr Faliszewski, Lane A. Hemaspaandra
2008	J	`jnl`	The consequences of eliminating NP solutions. Comput. Sci. Rev. Piotr Faliszewski, Lane A. Hemaspaandra
2007	J	`jnl`	Anyone but him: The complexity of precluding an alternative. Artif. Intell. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2007	J	`jnl`	Cluster computing and the power of edge recognition. Inf. Comput. Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub
2007	J	`jnl`	Complexity results in graph reconstruction. Discret. Appl. Math. Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi
2007	J	`jnl`	Copeland Voting Fully Resists Constructive Control CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2007	J	`jnl`	Dichotomy for voting systems. J. Comput. Syst. Sci. Edith Hemaspaandra, Lane A. Hemaspaandra
2007	A*	`conf`	Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. IJCAI Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2007	J	`jnl`	Introduction. SIGACT News Lane A. Hemaspaandra
2007	J	`jnl`	Introduction. SIGACT News Lane A. Hemaspaandra
2007	A*	`conf`	Llull and Copeland Voting Broadly Resist Bribery and Control. AAAI Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2007	B	`conf`	On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time. FCT Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
2007	J	`jnl`	On Approximating Optimal Weighted Lobbying, and Frequency of Correctness versus Average-Case Polynomial Time CoRR Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
2007	B	`conf`	On the Complexity of Kings. FCT Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe
2007	J	`jnl`	Query-monotonic Turing reductions. Theor. Comput. Sci. Lane A. Hemaspaandra, Mayur Thakur
2007	J	`jnl`	The Complexity of Computing the Size of an Interval. SIAM J. Comput. Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner
2006	J	`jnl`	A Richer Understanding of the Complexity of Election Systems CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2006	C	`conf`	Cluster Computing and the Power of Edge Recognition. TAMC Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub
2006	B	`conf`	Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners. MFCS Christopher M. Homan, Lane A. Hemaspaandra
2006	J	`jnl`	How Hard Is Bribery in Elections? CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2006	J	`jnl`	Hybrid Elections Broaden Complexity-Theoretic Resistance to Control CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2006	J	`jnl`	If P neq NP then some strongly noninvertible functions are invertible. Theor. Comput. Sci. Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe
2006	J	`jnl`	Open questions in the theory of semifeasible computation. SIGACT News Piotr Faliszewski, Lane A. Hemaspaandra
2006	B	`conf`	P-Selectivity, Immunity, and the Power of One Bit. SOFSEM Lane A. Hemaspaandra, Leen Torenvliet
2006	J	`jnl`	Query-Monotonic Turing Reductions CoRR Lane A. Hemaspaandra, Mayur Thakur
2006	J	`jnl`	SIGACT news complexity theory column 51. SIGACT News Lane A. Hemaspaandra
2006	J	`jnl`	SIGACT news complexity theory column 52. SIGACT News Lane A. Hemaspaandra
2006	J	`jnl`	SIGACT news complexity theory column 53. SIGACT News Lane A. Hemaspaandra
2006	A*	`conf`	The Complexity of Bribery in Elections. AAAI Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2006	J	`jnl`	The Complexity of Finding Top-Toda-Equivalence-Class Members. Theory Comput. Syst. Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed J. Zaki, Marius Zimand
2006	J	`jnl`	The Consequences of Eliminating NP Solutions CoRR Piotr Faliszewski, Lane A. Hemaspaandra
2006	—	`conf`	The Consequences of Eliminating NP Solutions. DCFS Piotr Faliszewski, Lane A. Hemaspaandra
2005	J	`jnl`	Advice for semifeasible sets and the complexity-theoretic cost(lessness) of algebraic properties. Int. J. Found. Comput. Sci. Piotr Faliszewski, Lane A. Hemaspaandra
2005	J	`jnl`	Algebraic Properties for Selector Functions CoRR Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
2005	J	`jnl`	All superlinear inverse schemes are coNP-hard. Theor. Comput. Sci. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
2005	J	`jnl`	Anyone but Him: The Complexity of Precluding an Alternative CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2005	A*	`conf`	Anyone but Him: The Complexity of Precluding an Alternative. AAAI Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2005	J	`jnl`	Cluster Computing and the Power of Edge Recognition CoRR Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub
2005	J	`jnl`	Competing provers yield improved Karp-Lipton collapse results. Inf. Comput. Jin-Yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara
2005	J	`jnl`	Context-free languages can be accepted with absolutely no space overhead. Inf. Comput. Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau
2005	J	`jnl`	Dichotomy for Voting Systems CoRR Edith Hemaspaandra, Lane A. Hemaspaandra
2005	J	`jnl`	Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory CoRR Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena
2005	—	`conf`	Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory. ICTCS Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena
2005	J	`jnl`	Extending Downward Collapse from 1-versus-2 Queries to m-versus-m + 1 Queries. SIAM J. Comput. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
2005	J	`jnl`	Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners CoRR Christopher M. Homan, Lane A. Hemaspaandra
2005	J	`jnl`	Open Questions in the Theory of Semifeasible Computation CoRR Piotr Faliszewski, Lane A. Hemaspaandra
2005	J	`jnl`	P-Selectivity, Immunity, and the Power of One Bit CoRR Lane A. Hemaspaandra, Leen Torenvliet
2005	Misc	`conf`	Query-Monotonic Turing Reductions. COCOON Lane A. Hemaspaandra, Mayur Thakur
2005	J	`jnl`	SIGACT news complexity theory column 48. SIGACT News Lane A. Hemaspaandra
2005	J	`jnl`	SIGACT news complexity theory column 49. SIGACT News Lane A. Hemaspaandra
2005	J	`jnl`	The Complexity of Computing the Size of an Interval CoRR Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner
2005	J	`jnl`	The Complexity of Kings CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Osamu Watanabe
2004	—	`conf`	Advice for Semifeasible Sets and the Complexity-Theoretic Cost(lessness) of Algebraic Properties. DCFS Lane A. Hemaspaandra
2004	J	`jnl`	Algebraic Properties for Selector Functions. SIAM J. Comput. Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
2004	B	`conf`	All Superlinear Inverse Schemes Are coNP-Hard. MFCS Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
2004	J	`jnl`	All Superlinear Inverse Schemes are coNP-Hard CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
2004	J	`jnl`	Complexity Results in Graph Reconstruction CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi
2004	B	`conf`	Complexity Results in Graph Reconstruction. MFCS Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi
2004	J	`jnl`	Lower bounds and the hardness of counting properties. Theor. Comput. Sci. Lane A. Hemaspaandra, Mayur Thakur
2004	J	`jnl`	Overhead-Free Computation, DCFLs, and CFLs CoRR Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau
2004	J	`jnl`	SIGACT news complexity theory column 43. SIGACT News Lane A. Hemaspaandra
2004	B	`conf`	The Complexity of Finding Top-Toda-Equivalence-Class Members. LATIN Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed Javeed Zaki, Marius Zimand
2003	A	`conf`	Competing Provers Yield Improved Karp-Lipton Collapse Results. STACS Jin-Yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara
2003	C	`conf`	Computation with Absolutely No Space Overhead. Developments in Language Theory Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau
2003	J	`jnl`	P-immune sets with holes lack self-reducibility properties. Theor. Comput. Sci. Lane A. Hemaspaandra, Harald Hempel
2003	J	`jnl`	SIGACT News complexity theory column 41. SIGACT News Lane A. Hemaspaandra
2003	J	`jnl`	SIGACT news complexity theory column 40. SIGACT News Lane A. Hemaspaandra
2003	J	`jnl`	SIGACT news complexity theory column 42. SIGACT News Lane A. Hemaspaandra
2003	—	`book`	Theory of Semi-Feasible Algorithms Lane A. Hemaspaandra, Leen Torenvliet
2002	J	`jnl`	Almost-Everywhere Superiority for Quantum Polynomial Time. Inf. Comput. Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand
2002	—	`conf`	Lower Bounds and the Hardness of Counting Properties. IFIP TCS Lane A. Hemaspaandra, Mayur Thakur
2002	J	`jnl`	On characterizing the existence of partial one-way permutations. Inf. Process. Lett. Jörg Rothe, Lane A. Hemaspaandra
2002	J	`jnl`	Optimal Series-Parallel Trade-offs for Reducing a Function to Its Own Graph. Inf. Comput. Richard Beigel, Lane A. Hemaspaandra, Harald Hempel, Jörg Vogel
2002	J	`jnl`	Reducing the Number of Solutions of NP Functions. J. Comput. Syst. Sci. Lane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung
2002	J	`jnl`	SIGACT news complexity theory column 35. SIGACT News Lane A. Hemaspaandra
2002	J	`jnl`	SIGACT news complexity theory column 36. SIGACT News Lane A. Hemaspaandra
2002	J	`jnl`	SIGACT news complexity theory column 38. SIGACT News Lane A. Hemaspaandra
2002	J	`jnl`	SIGACT news complexity theory comun 37. SIGACT News Lane A. Hemaspaandra
2002	—	`book`	The Complexity Theory Companion Lane A. Hemaspaandra, Mitsunori Ogihara
2001	Misc	`conf`	Algebraic Properties for P-Selectivity. COCOON Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
2001	J	`jnl`	Complexity theory. SIGACT News Lane A. Hemaspaandra
2001	B	`conf`	If P != NP Then Some Strongly Noninvertible Functions Are Invertible. FCT Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe
2001	J	`jnl`	P-Immune Sets with Holes Lack Self-Reducibility Properties CoRR Lane A. Hemaspaandra, Harald Hempel
2001	—	`conf`	P-Immune Sets with Holes Lack Self-Reducibility Properties. DMTCS Lane A. Hemaspaandra, Harald Hempel
2001	J	`jnl`	SIGACT News complexity theory column 32. SIGACT News Lane A. Hemaspaandra
2001	J	`jnl`	SIGACT news complexity theory column 31. SIGACT News Lane A. Hemaspaandra
2001	J	`jnl`	SIGACT news complexity theory column 34. SIGACT News Lane A. Hemaspaandra
2001	A*	`conf`	The Complexity of Computing the Size of an Interval. ICALP Lane A. Hemaspaandra, Sven Kosub, Klaus W. Wagner
2001	J	`jnl`	The complexity theory companion. SIGACT News Lane A. Hemaspaandra, Mitsunori Ogihara
2001	J	`jnl`	Using the No-Search Easy-Hard Technique for Downward Collapse CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
2000	J	`jnl`	A Moment of Perfect Clarity I: The Parallel Census Technique CoRR Christian Glaßer, Lane A. Hemaspaandra
2000	J	`jnl`	A Moment of Perfect Clarity II: Consequences of Sparse Sets Hard for NP with Respect to Weak Reductions CoRR Christian Glaßer, Lane A. Hemaspaandra
2000	J	`jnl`	A moment of perfect clarity I: the parallel census technique. SIGACT News Lane A. Hemaspaandra, Christian Glaßer
2000	J	`jnl`	A moment of perfect clarity II: consequences of sparse sets hard for NP with respect to weak reductions. SIGACT News Christian Glaßer, Lane A. Hemaspaandra
2000	J	`jnl`	A second step towards complexity-theoretic analogs of Rice's Theorem. Theor. Comput. Sci. Lane A. Hemaspaandra, Jörg Rothe
2000	J	`jnl`	Characterizing the existence of one-way permutations. Theor. Comput. Sci. Lane A. Hemaspaandra, Jörg Rothe
2000	B	`conf`	Computational Politics: Electoral Systems. MFCS Edith Hemaspaandra, Lane A. Hemaspaandra
2000	J	`jnl`	Erratum to "Reducibility classes of P-selective sets". Theor. Comput. Sci. Lane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara
2000	J	`jnl`	If P \neq NP then Some Strongly Noninvertible Functions are Invertible CoRR Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe
2000	B	`conf`	Reducing the Number of Solutions of NP Functions. MFCS Lane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung
2000	J	`jnl`	Restrictive Acceptance Suffices for Equivalence Problems. LMS J. Comput. Math. Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
2000	J	`jnl`	Take-home Complexity CoRR Lane A. Hemaspaandra
1999	J	`jnl`	A Downward Collapse within the Polynomial Hierarchy CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1999	J	`jnl`	A Note on Bounded-Weight Error-Correcting Codes. J. Univers. Comput. Sci. Russell Bent, Michael Schear, Lane A. Hemaspaandra, Gabriel Istrate
1999	J	`jnl`	A Second Step Towards Complexity-Theoretic Analogs of Rice's Theorem CoRR Lane A. Hemaspaandra, Jörg Rothe
1999	J	`jnl`	Almost-Everywhere Superiority for Quantum Computing CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand
1999	J	`jnl`	An Introduction to Query Order CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1999	J	`jnl`	Biomolecular computing: recent theoretical and experimental advances. SIGACT News Lane A. Hemaspaandra
1999	J	`jnl`	Boolean Operations, Joins, and the Extended Low Hierarchy CoRR Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
1999	J	`jnl`	Characterizations of the Existence of Partial and Total One-Way Permutations CoRR Jörg Rothe, Lane A. Hemaspaandra
1999	J	`jnl`	Creating Strong, Total, Commutative, Associative One-Way Functions from Any One-Way Function in Complexity Theory. J. Comput. Syst. Sci. Lane A. Hemaspaandra, Jörg Rothe
1999	J	`jnl`	Easy Sets and Hard Certificate Schemes CoRR Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung
1999	J	`jnl`	Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
1999	A	`conf`	Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries. STACS Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1999	J	`jnl`	On Bounded-Weight Error-Correcting Codes CoRR Russell Bent, Michael Schear, Lane A. Hemaspaandra, Gabriel Istrate
1999	J	`jnl`	One-Way Functions in Worst-Case Cryptography: Algebraic and Security Properties CoRR Alina Beygelzimer, Lane A. Hemaspaandra, Christopher M. Homan, Jörg Rothe
1999	J	`jnl`	One-way functions in worst-case cryptography: algebraic and security properties are on the house. SIGACT News Alina Beygelzimer, Lane A. Hemaspaandra, Christopher M. Homan, Jörg Rothe
1999	J	`jnl`	Polynomial-Time Multi-Selectivity CoRR Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
1999	J	`jnl`	Query Order CoRR Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
1999	J	`jnl`	Query Order and the Polynomial Hierarchy CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1999	J	`jnl`	R CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1999	J	`jnl`	Raising NP Lower Bounds to Parallel NP Lower Bounds CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
1999	J	`jnl`	Restrictive Acceptance Suffices for Equivalence Problems CoRR Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
1999	B	`conf`	Restrictive Acceptance Suffices for Equivalence Problems. FCT Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
1999	J	`jnl`	Robust Reductions CoRR Jin-Yi Cai, Lane A. Hemaspaandra, Gerd Wechsung
1999	J	`jnl`	Robust Reductions. Theory Comput. Syst. Jin-Yi Cai, Lane A. Hemaspaandra, Gerd Wechsung
1999	J	`jnl`	Self-Specifying Machines CoRR Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
1999	J	`jnl`	Self-Specifying Machines. Int. J. Found. Comput. Sci. Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
1999	—	`ch.`	Theoretical Computer Science. Handbook of Discrete and Combinatorial Mathematics William I. Gasarch, Arto Salomaa, Thomas H. Cormen, Lane A. Hemaspaandra, Milena Mihail
1999	J	`jnl`	Translating Equality Downwards CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1999	J	`jnl`	Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets CoRR Lane A. Hemaspaandra, Jörg Rothe
1999	J	`jnl`	What's Up with Downward Collapse: Using the Easy-Hard Technique to Link Boolean and Polynomial Hierarchy Collapses CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1998	J	`jnl`	A Downward Collapse within the Polynomial Hierarchy. SIAM J. Comput. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1998	J	`jnl`	A Note on Linear-Nondeterminism, Linear-Sized, Karp-Lipton Advice for the P-Selective Sets. J. Univers. Comput. Sci. Lane A. Hemaspaandra, Christopher Nasipak, Keith Parkins
1998	B	`conf`	A Second Step Towards Circuit Complexity-Theoretic Analogs of Rice's Theorem. MFCS Lane A. Hemaspaandra, Jörg Rothe
1998	J	`jnl`	Boolean Operations, Joins, and the Extended Low Hierarchy. Theor. Comput. Sci. Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
1998	J	`jnl`	Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function CoRR Lane A. Hemaspaandra, Jörg Rothe
1998	J	`jnl`	Downward Collapse from a Weaker Hypothesis CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1998	J	`jnl`	Power Balance and Apportionment Algorithms for the United States Congress. ACM J. Exp. Algorithmics Lane A. Hemaspaandra, Kulathur S. Rajasethupathy, Prasanna Sethupathy, Marius Zimand
1998	J	`jnl`	Query Order and the Polynomial Hierarchy. J. Univers. Comput. Sci. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1998	J	`jnl`	Query Order. SIAM J. Comput. Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
1998	J	`jnl`	R Theory Comput. Syst. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1998	Misc	`conf`	Robust Reductions. COCOON Jin-Yi Cai, Lane A. Hemaspaandra, Gerd Wechsung
1998	J	`jnl`	Take-home complexity. SIGACT News Lane A. Hemaspaandra
1998	J	`jnl`	What's up with downward collapse: using the easy-hard technique to link Boolean and polynomial hierarchy collapses. SIGACT News Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1998	J	`jnl`	Writing and Editing Complexity Theory: Tales and Tools CoRR Lane A. Hemaspaandra, Alan L. Selman
1998	J	`jnl`	Writing and editing complexity theory: tales and tools. SIGACT News Lane A. Hemaspaandra, Alan L. Selman
1997	A	`conf`	A Downward Translation in the Polynomial Hierarchy. STACS Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1997	J	`jnl`	An Introduction to Query Order. Bull. EATCS Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1997	J	`jnl`	Easy Sets and Hard Certificate Schemes. Acta Informatica Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung
1997	A*	`conf`	Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP. ICALP Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
1997	J	`jnl`	Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP. J. ACM Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
1997	J	`jnl`	Journals to Die For. SIGACT News Lane A. Hemaspaandra
1997	J	`jnl`	Logspace Reducibility: Models and Equivalences. Int. J. Found. Comput. Sci. Lane A. Hemaspaandra, Zhigen Jiang
1997	C	`conf`	On Sets with Easy Certificates and the Existence of One-Way Permutations. CIAC Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung
1997	J	`jnl`	Polynomial-Time Multi-Selectivity. J. Univers. Comput. Sci. Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
1997	B	`conf`	Query Order in the Polynomial Hierarchy. FCT Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1997	C	`conf`	R CIAC Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1997	J	`jnl`	Raising NP lower bounds to parallel NP lower bounds. SIGACT News Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
1997	J	`jnl`	SIGACT News complexity theory column 18. SIGACT News Lane A. Hemaspaandra
1997	J	`jnl`	Threshold Computation and Cryptographic Security. SIAM J. Comput. Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf
1997	J	`jnl`	Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets. SIAM J. Comput. Lane A. Hemaspaandra, Jörg Rothe
1997	J	`jnl`	Universally Serializable Computation. J. Comput. Syst. Sci. Lane A. Hemaspaandra, Mitsunori Ogihara
1996	J	`jnl`	Computing Solutions Uniquely Collapses the Polynomial Hierarchy Electron. Colloquium Comput. Complex. Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
1996	J	`jnl`	Computing Solutions Uniquely Collapses the Polynomial Hierarchy. SIAM J. Comput. Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
1996	J	`jnl`	Optimal Advice. Theor. Comput. Sci. Lane A. Hemaspaandra, Leen Torenvliet
1996	J	`jnl`	Powers-of-Two Acceptance Suffices for Equivalence and Bounded Ambiguity Problems Electron. Colloquium Comput. Complex. Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
1996	J	`jnl`	Pseudorandom Generators and the Frequency of Simplicity. J. Cryptol. Yenjo Han, Lane A. Hemaspaandra
1996	J	`jnl`	Reducibility Classes of P-Selective Sets. Theor. Comput. Sci. Lane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara
1996	J	`jnl`	SIGACT News Complexity Theory Column 12. SIGACT News Lane A. Hemaspaandra
1996	J	`jnl`	Strong Self-Reducibility Precludes Strong Immunity. Math. Syst. Theory Lane A. Hemaspaandra, Marius Zimand
1996	Misc	`conf`	The Join Can Lower Complexity. COCOON Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
1995	J	`jnl`	Defying Upward and Downward Separation Inf. Comput. Lane A. Hemaspaandra, Sudhir K. Jha
1995	J	`jnl`	Easily Checked Generalized Self-Reducibility. SIAM J. Comput. Lane A. Hemaspaandra, Riccardo Silvestri
1995	Misc	`conf`	Intersection Suffices for Boolean Hierarchy Equivalence. COCOON Lane A. Hemaspaandra, Jörg Rothe
1995	J	`jnl`	Nondeterministically Selective Sets. Int. J. Found. Comput. Sci. Lane A. Hemaspaandra, Albrecht Hoene, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman, Thomas Thierauf, Jie Wang
1995	J	`jnl`	P-Selectivity: Intersections and Indices. Theor. Comput. Sci. Lane A. Hemaspaandra, Zhigen Jiang
1995	A	`conf`	Pseudorandom Generators and the Frequency of Simplicity. STACS Yenjo Han, Lane A. Hemaspaandra
1995	J	`jnl`	SIGACT News Complexity Theory Column 10. SIGACT News Lane A. Hemaspaandra
1995	J	`jnl`	The satanic notations: counting classes beyond #P and other definitional adventures. SIGACT News Lane A. Hemaspaandra, Heribert Vollmer
1995	B	`conf`	Witness-Isomorphic Reductions and the Local Search Problem (Extended Abstract). MFCS Sophie Fischer, Lane A. Hemaspaandra, Leen Torenvliet
1995	J	`jnl`	Worlds to die for. SIGACT News Lane A. Hemaspaandra, Ajit Ramachandran, Marius Zimand
1994	J	`jnl`	Complexity theory column 5: the not-ready-for-prime-time conjectures. SIGACT News Lane A. Hemaspaandra
1994	B	`conf`	Computing Solutions Uniquely collapses the Polynomial Hierarchy. ISAAC Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
1994	J	`jnl`	On the Complexity of Graph Reconstruction. Math. Syst. Theory Dieter Kratsch, Lane A. Hemaspaandra
1994	J	`jnl`	Quasi-injective Reductions. Theor. Comput. Sci. Edith Hemaspaandra, Lane A. Hemaspaandra
1994	J	`jnl`	Semi-membership algorithms: some recent advances. SIGACT News Derek Denny-Brown, Yenjo Han, Lane A. Hemaspaandra, Leen Torenvliet
1994	J	`jnl`	Space-Efficient Recognition of Sparse Self-Reducible Languages. Comput. Complex. Lane A. Hemaspaandra, Mitsunori Ogihara, Seinosuke Toda
1994	J	`jnl`	Teaching Computational Complexity: Resources to Treasure. SIGACT News Lane A. Hemaspaandra
1993	J	`jnl`	Banishing Robust Turing Completeness. Int. J. Found. Comput. Sci. Lane A. Hemaspaandra, Sanjay Jain, Nikolai K. Vereshchagin
1993	J	`jnl`	Lowness: a yardstick for NP-P. SIGACT News Lane A. Hemaspaandra
1993	B	`conf`	Threshold Computation and Cryptographic Security. ISAAC Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf