default search action
Lane A. Hemaspaandra
Person information
- affiliation: University of Rochester, New York, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j213]Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles:
Separating and Collapsing Electoral Control Types. J. Artif. Intell. Res. 81: 71-116 (2024) - [j212]Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah, Patrick A. Phillips:
Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting. ACM Trans. Comput. Theory 16(4): 20:1-20:26 (2024) - 2023
- [j211]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 116. SIGACT News 54(1): 62 (2023) - [j210]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 117: Thirty Years of Complexity Theory (Columns). SIGACT News 54(1): 82-89 (2023) - [c105]Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles:
Separating and Collapsing Electoral Control Types. AAMAS 2023: 1743-1751 - [c104]Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles:
Search versus Search for Collapsing Electoral Control Types. AAMAS 2023: 2682-2684 - 2022
- [j209]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The complexity of online bribery in sequential elections. J. Comput. Syst. Sci. 127: 66-90 (2022) - [j208]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 112. SIGACT News 53(1): 58 (2022) - [j207]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 113. SIGACT News 53(2): 39 (2022) - [j206]Lane A. Hemaspaandra:
SIGACT news complexity theory column 114. SIGACT News 53(3): 41-45 (2022) - [j205]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 115: Juris Hartmanis and Two Golden Rules. SIGACT News 53(4): 35-40 (2022) - [c103]Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah, Patrick A. Phillips:
Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting. MFCS 2022: 57:1-57:15 - [i88]Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles:
Separating and Collapsing Electoral Control Types. CoRR abs/2207.00710 (2022) - [i87]Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles:
Search versus Search for Collapsing Electoral Control Types. CoRR abs/2207.03049 (2022) - 2021
- [j204]Lane A. Hemaspaandra:
Thoughts on Alan Selman (1941-2021). Bull. EATCS 133 (2021) - [j203]Lane A. Hemaspaandra, David E. Narváez:
The opacity of backbones. Inf. Comput. 281: 104772 (2021) - [j202]Jackson Abascal, Lane A. Hemaspaandra, Shir Maimon, Daniel Rubery:
Closure and nonclosure properties of the classes of compressible and rankable sets. J. Comput. Syst. Sci. 120: 162-176 (2021) - [j201]Lane A. Hemaspaandra, David E. Narváez:
Existence versus exploitation: the opacity of backdoors and backbones. Prog. Artif. Intell. 10(3): 297-308 (2021) - [j200]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 108. SIGACT News 52(1): 41-46 (2021) - [j199]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 109. SIGACT News 52(2): 45 (2021) - [j198]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 110. SIGACT News 52(3): 37 (2021) - [j197]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 111. SIGACT News 52(4): 55 (2021) - [i86]Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah, Patrick A. Phillips:
Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting. CoRR abs/2109.14764 (2021) - 2020
- [j196]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
Control in the presence of manipulators: cooperative and competitive cases. Auton. Agents Multi Agent Syst. 34(2): 52 (2020) - [j195]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
Correction to: Control in the presence of manipulators: cooperative and competitive cases. Auton. Agents Multi Agent Syst. 34(2): 56 (2020) - [j194]Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe:
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. Comput. Complex. 29(2): 7 (2020) - [j193]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 104. SIGACT News 51(1): 37 (2020) - [j192]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 105. SIGACT News 51(2): 36-37 (2020) - [j191]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 106: Teaching Models, Computability, and Complexity in Time of COVID-19. SIGACT News 51(3): 55-58 (2020) - [j190]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 107. SIGACT News 51(4): 47 (2020) - [j189]Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton:
Search versus Decision for Election Manipulation Problems. ACM Trans. Comput. Theory 12(1): 3:1-3:42 (2020) - [c102]Lane A. Hemaspaandra:
The Power of Self-Reducibility: Selectivity, Information, and Approximation. Complexity and Approximation 2020: 19-47
2010 – 2019
- 2019
- [j188]Lane A. Hemaspaandra, Daniel Rubery:
Recursion-theoretic ranking and compression. J. Comput. Syst. Sci. 101: 31-41 (2019) - [j187]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 100. SIGACT News 50(1): 35-37 (2019) - [j186]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 101. SIGACT News 50(2): 29-30 (2019) - [j185]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 102. SIGACT News 50(3): 51 (2019) - [j184]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 103. SIGACT News 50(4): 56 (2019) - [c101]Jackson Abascal, Lane A. Hemaspaandra, Shir Maimon, Daniel Rubery:
Closure and Nonclosure Properties of the Compressible and Rankable Sets. LATA 2019: 177-189 - [c100]Lane A. Hemaspaandra, David E. Narváez:
Existence Versus Exploitation: The Opacity of Backdoors and Backbones Under a Weak Assumption. SOFSEM 2019: 247-259 - [c99]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Bribery in Sequential Elections (Extended Abstract). TARK 2019: 233-251 - [i85]Lane A. Hemaspaandra:
The Power of Self-Reducibility: Selectivity, Information, and Approximation. CoRR abs/1902.08299 (2019) - [i84]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Bribery in Sequential Elections. CoRR abs/1906.08308 (2019) - 2018
- [j183]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 97. SIGACT News 49(1): 54 (2018) - [j182]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 98. SIGACT News 49(2): 32 (2018) - [j181]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 99. SIGACT News 49(3): 48-50 (2018) - [j180]Lane A. Hemaspaandra, Holger Spakowski:
Column: Team Diagonalization. SIGACT News 49(3): 51-61 (2018) - [c98]Lane A. Hemaspaandra:
Computational Social Choice and Computational Complexity: BFFs? AAAI 2018: 7971-7977 - [c97]Lane A. Hemaspaandra:
That Most Important Intersection. Adventures Between Lower Bounds and Higher Altitudes 2018: 568-589 - [c96]Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe:
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. MFCS 2018: 51:1-51:14 - [i83]Lane A. Hemaspaandra, Holger Spakowski:
Team Diagonalization. CoRR abs/1807.10983 (2018) - 2017
- [j179]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The complexity of online voter control in sequential elections. Auton. Agents Multi Agent Syst. 31(5): 1055-1076 (2017) - [j178]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 93. SIGACT News 48(1): 101 (2017) - [j177]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 94. SIGACT News 48(2): 40 (2017) - [j176]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 96. SIGACT News 48(4): 42 (2017) - [j175]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The complexity of controlling candidate-sequential elections. Theor. Comput. Sci. 678: 14-21 (2017) - [c95]Lane A. Hemaspaandra, David E. Narváez:
The Opacity of Backbones. AAAI 2017: 3900-3906 - [i82]Lane A. Hemaspaandra, David E. Narváez:
The Opacity of Backbones and Backdoors Under a Weak Assumption. CoRR abs/1706.04582 (2017) - [i81]Lane A. Hemaspaandra:
Computational Social Choice and Computational Complexity: BFFs? CoRR abs/1710.10753 (2017) - [i80]Edith Hemaspaandra, Lane A. Hemaspaandra:
Credimus. CoRR abs/1711.00201 (2017) - [i79]Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe:
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. CoRR abs/1711.01250 (2017) - 2016
- [j174]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
Manipulation Complexity of Same-System Runoff Elections. Ann. Math. Artif. Intell. 77(3-4): 159-189 (2016) - [j173]Lane A. Hemaspaandra, Rahman Lavaee, Curtis Menton:
Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control. Ann. Math. Artif. Intell. 77(3-4): 191-223 (2016) - [j172]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 90: Introduction to Complexity Theory Column 90. SIGACT News 47(1): 41 (2016) - [j171]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 91. SIGACT News 47(2): 65 (2016) - [j170]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 93. SIGACT News 47(3): 44-45 (2016) - [p2]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Manipulative Actions in Single-Peaked Societies. Economics and Computation 2016: 327-360 - [r2]Ioannis Caragiannis, Edith Hemaspaandra, Lane A. Hemaspaandra:
Dodgson's Rule and Young's Rule. Handbook of Computational Social Choice 2016: 103-126 - [i78]Lane A. Hemaspaandra, David E. Narváez:
The Opacity of Backbones. CoRR abs/1606.03634 (2016) - [i77]Lane A. Hemaspaandra, Daniel Rubery:
Recursion-Theoretic Ranking and Compression. CoRR abs/1610.01185 (2016) - [i76]Lane A. Hemaspaandra, Daniel Rubery:
More on Compression and Ranking. CoRR abs/1611.01696 (2016) - 2015
- [j169]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Weighted Electoral Control. J. Artif. Intell. Res. 52: 507-542 (2015) - [j168]Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra:
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. J. Artif. Intell. Res. 53: 439-496 (2015) - [j167]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 85. SIGACT News 46(1): 39 (2015) - [j166]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 86: Introduction to Complexity Theory Column 86. SIGACT News 46(2): 40 (2015) - [j165]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 87: Introduction to Complexity Theory Column 87. SIGACT News 46(3): 36 (2015) - [j164]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 88/89: Introduction to Complexity Theory Column 88/89. SIGACT News 46(4): 31 (2015) - [c94]Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra:
More Natural Models of Electoral Control by Partition. ADT 2015: 396-413 - [c93]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract). IJCAI 2015: 4178-4182 - 2014
- [j163]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
The complexity of manipulative attacks in nearly single-peaked electorates. Artif. Intell. 207: 69-99 (2014) - [j162]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The complexity of online manipulation of sequential elections. J. Comput. Syst. Sci. 80(4): 697-710 (2014) - [j161]Lane A. Hemaspaandra:
SIGACT news complexity theory column 81. SIGACT News 45(1): 47 (2014) - [j160]Lane A. Hemaspaandra:
SIGACT news complexity theory column 82. SIGACT News 45(2): 46 (2014) - [j159]Lane A. Hemaspaandra:
SIGACT news complexity theory column 82. SIGACT News 45(3): 53 (2014) - [j158]Lane A. Hemaspaandra:
Beautiful structures: an appreciation of the contributions of Alan Selman. SIGACT News 45(3): 54-70 (2014) - [j157]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 84. SIGACT News 45(4): 58 (2014) - [c92]Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor:
A Control Dichotomy for Pure Scoring Rules. AAAI 2014: 712-720 - [c91]Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra:
Bribery and voter control under voting-rule uncertainty. AAMAS 2014: 61-68 - [i75]Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor:
A Control Dichotomy for Pure Scoring Rules. CoRR abs/1404.4560 (2014) - [i74]Lane A. Hemaspaandra:
Beautiful Structures: An Appreciation of the Contributions of Alan Selman. CoRR abs/1406.4106 (2014) - [i73]Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra:
More Natural Models of Electoral Control by Partition. CoRR abs/1410.2652 (2014) - 2013
- [j156]Tatiana Gvozdeva, Lane A. Hemaspaandra, Arkadii M. Slinko:
Three hierarchies of simple games parameterized by "resource" parameters. Int. J. Game Theory 42(1): 1-17 (2013) - [j155]Lane A. Hemaspaandra:
SIGACT news complexity theory column 77. SIGACT News 44(1): 49 (2013) - [j154]Lane A. Hemaspaandra:
SIGACT news complexity theory column 78. SIGACT News 44(2): 45-46 (2013) - [j153]Lane A. Hemaspaandra:
SIGACT news complexity theory column 80. SIGACT News 44(4): 52 (2013) - [c90]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Weighted electoral control. AAMAS 2013: 367-374 - [c89]Lane A. Hemaspaandra, Rahman Lavaee, Curtis Menton:
Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control. AAMAS 2013: 1345-1346 - [c88]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
A Richer Understanding of the Complexity of Election Systems. Fundamental Problems in Computing 2013: 375-406 - [c87]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
Control in the Presence of Manipulators: Cooperative and Competitive Cases. IJCAI 2013: 113-119 - [c86]Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton:
Search versus Decision for Election Manipulation Problems. STACS 2013: 377-388 - [c85]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Manipulation of Sequential Elections. TARK 2013 - [i72]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
X THEN X: Manipulation of Same-System Runoff Elections. CoRR abs/1301.6118 (2013) - [i71]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Weighted Electoral Control. CoRR abs/1305.0943 (2013) - [i70]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
Control in the Presence of Manipulators: Cooperative and Competitive Cases. CoRR abs/1308.0544 (2013) - [i69]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Manipulation of Sequential Elections. CoRR abs/1310.6997 (2013) - 2012
- [j152]Lane A. Hemaspaandra:
SIGACT news complexity theory column 73. SIGACT News 43(1): 61 (2012) - [j151]Lane A. Hemaspaandra:
SIGACT news complexity theory column 74. SIGACT News 43(2): 51-52 (2012) - [j150]Lane A. Hemaspaandra:
SIGACT news complexity theory column 75. SIGACT News 43(3): 65-66 (2012) - [j149]Lane A. Hemaspaandra, Ryan Williams:
SIGACT News Complexity Theory Column 76: an atypical survey of typical-case heuristic algorithms. SIGACT News 43(4): 70-89 (2012) - [c84]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Online Voter Control in Sequential Elections. ECAI 2012: 396-401 - [c83]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Controlling Candidate-Sequential Elections. ECAI 2012: 905-906 - [i68]Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton:
Search versus Decision for Election Manipulation Problems. CoRR abs/1202.6641 (2012) - [i67]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Controlling Candidate-Sequential Elections. CoRR abs/1202.6649 (2012) - [i66]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Manipulation of Sequential Elections. CoRR abs/1202.6655 (2012) - [i65]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Online Voter Control in Sequential Elections. CoRR abs/1203.0411 (2012) - [i64]Lane A. Hemaspaandra, Rahman Lavaee, Curtis Menton:
Schulze and Ranked-Pairs Voting are Fixed-Parameter Tractable to Bribe, Manipulate, and Control. CoRR abs/1210.6963 (2012) - [i63]Lane A. Hemaspaandra, Ryan Williams:
An Atypical Survey of Typical-Case Heuristic Algorithms. CoRR abs/1210.8099 (2012) - 2011
- [j148]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The shield that never was: Societies with single-peaked preferences are more open to manipulation and control. Inf. Comput. 209(2): 89-107 (2011) - [j147]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Multimode Control Attacks on Elections. J. Artif. Intell. Res. 40: 305-351 (2011) - [j146]Lane A. Hemaspaandra:
SIGACT news complexity theory column 69. SIGACT News 42(1): 58 (2011) - [j145]Lane A. Hemaspaandra:
SIGACT news complexity theory column 70. SIGACT News 42(2): 51 (2011) - [j144]Lane A. Hemaspaandra:
SIGACT news complexity theory column 71. SIGACT News 42(3): 53-54 (2011) - [j143]Lane A. Hemaspaandra:
SIGACT news complexity theory column 72. SIGACT News 42(4): 53 (2011) - [c82]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
The complexity of manipulative attacks in nearly single-peaked electorates. TARK 2011: 228-237 - [i62]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates. CoRR abs/1105.5032 (2011) - [i61]Lane A. Hemaspaandra, Kyle Murray, Xiaoqing Tang:
Barbosa, Uniform Polynomial Time Bounds, and Promises. CoRR abs/1106.1150 (2011) - 2010
- [j142]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Using complexity to protect elections. Commun. ACM 53(11): 74-82 (2010) - [j141]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 67. SIGACT News 41(3): 58 (2010) - [j140]Lane A. Hemaspaandra:
SIGACT news complexity theory column 68. SIGACT News 41(4): 73-94 (2010) - [j139]Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe:
On the complexity of kings. Theor. Comput. Sci. 411(4-5): 783-798 (2010) - [c81]Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra:
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. AAAI 2010: 715-722 - [e1]Felix Brandt, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, William S. Zwicker:
Computational Foundations of Social Choice, 07.03. - 12.03.2010. Dagstuhl Seminar Proceedings 10101, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i60]Felix Brandt, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, William S. Zwicker:
10101 Abstracts Collection - Computational Foundations of Social Choice. Computational Foundations of Social Choice 2010 - [i59]Felix Brandt, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, William S. Zwicker:
10101 Executive Summary - Computational Foundations of Social Choice. Computational Foundations of Social Choice 2010 - [i58]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Multimode Control Attacks on Elections. CoRR abs/1007.1800 (2010) - [i57]Lane A. Hemaspaandra:
A Note on Nonuniform versus Uniform ACC^k Circuits for NE. CoRR abs/1012.0556 (2010)
2000 – 2009
- 2009
- [j138]Christopher M. Homan, Lane A. Hemaspaandra:
Guarantees for the success frequency of an algorithm for finding Dodgson-election winners. J. Heuristics 15(4): 403-423 (2009) - [j137]Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski:
Frequency of correctness versus average polynomial time. Inf. Process. Lett. 109(16): 946-949 (2009) - [j136]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. J. Artif. Intell. Res. 35: 275-341 (2009) - [j135]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
How Hard Is Bribery in Elections? J. Artif. Intell. Res. 35: 485-532 (2009) - [j134]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. Math. Log. Q. 55(4): 397-424 (2009) - [j133]Lane A. Hemaspaandra:
SIGACT news complexity theory column 62. SIGACT News 40(1): 26 (2009) - [j132]Lane A. Hemaspaandra:
SIGACT news complexity theory column 63. SIGACT News 40(2): 49 (2009) - [j131]Lane A. Hemaspaandra:
SIGACT news complexity theory column 64. SIGACT News 40(3): 60-76 (2009) - [j130]Lane A. Hemaspaandra:
SIGACT news complexity theory column 65. SIGACT News 40(4): 45 (2009) - [j129]Piotr Faliszewski, Lane A. Hemaspaandra:
The complexity of power-index comparison. Theor. Comput. Sci. 410(1): 101-107 (2009) - [j128]Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski:
Generalized juntas and NP-hard sets. Theor. Comput. Sci. 410(38-40): 3995-4000 (2009) - [c80]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Multimode Control Attacks on Elections. IJCAI 2009: 128-133 - [c79]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The shield that never was: societies with single-peaked preferences are more open to manipulation and control. TARK 2009: 118-127 - [i56]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control. CoRR abs/0909.3257 (2009) - 2008
- [j127]Piotr Faliszewski, Lane A. Hemaspaandra:
The consequences of eliminating NP solutions. Comput. Sci. Rev. 2(1): 40-54 (2008) - [j126]Lane A. Hemaspaandra:
SIGACT news complexity theory column 59: introduction. SIGACT News 39(2): 50 (2008) - [j125]Lane A. Hemaspaandra:
SIGACT news complexity theory column 61. SIGACT News 39(4): 35-36 (2008) - [j124]Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena:
Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions. Theor. Comput. Sci. 401(1-3): 27-35 (2008) - [c78]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Copeland Voting Fully Resists Constructive Control. AAIM 2008: 165-176 - [c77]Piotr Faliszewski, Lane A. Hemaspaandra:
The Complexity of Power-Index Comparison. AAIM 2008: 177-187 - [i55]Piotr Faliszewski, Lane A. Hemaspaandra:
The Complexity of Power-Index Comparison. CoRR abs/0801.4585 (2008) - [i54]Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski:
Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas. CoRR abs/0806.2555 (2008) - [i53]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Llull and Copeland Voting Computationally Resist Bribery and Control. CoRR abs/0809.4484 (2008) - 2007
- [j123]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Anyone but him: The complexity of precluding an alternative. Artif. Intell. 171(5-6): 255-285 (2007) - [j122]Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi:
Complexity results in graph reconstruction. Discret. Appl. Math. 155(2): 103-118 (2007) - [j121]Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub:
Cluster computing and the power of edge recognition. Inf. Comput. 205(8): 1274-1293 (2007) - [j120]Edith Hemaspaandra, Lane A. Hemaspaandra:
Dichotomy for voting systems. J. Comput. Syst. Sci. 73(1): 73-83 (2007) - [j119]Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner:
The Complexity of Computing the Size of an Interval. SIAM J. Comput. 36(5): 1264-1300 (2007) - [j118]Lane A. Hemaspaandra:
Introduction. SIGACT News 38(3): 34-38 (2007) - [j117]Lane A. Hemaspaandra:
Introduction. SIGACT News 38(4): 39-40 (2007) - [j116]Lane A. Hemaspaandra, Mayur Thakur:
Query-monotonic Turing reductions. Theor. Comput. Sci. 383(2-3): 153-186 (2007) - [c76]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Llull and Copeland Voting Broadly Resist Bribery and Control. AAAI 2007: 724-730 - [c75]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. FCT 2007: 300-311 - [c74]Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe:
On the Complexity of Kings. FCT 2007: 328-340 - [c73]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. IJCAI 2007: 1308-1314 - [i52]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Copeland Voting Fully Resists Constructive Control. CoRR abs/0711.4759 (2007) - [i51]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. CoRR abs/cs/0703097 (2007) - 2006
- [j115]Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed J. Zaki, Marius Zimand:
The Complexity of Finding Top-Toda-Equivalence-Class Members. Theory Comput. Syst. 39(5): 669-684 (2006) - [j114]Piotr Faliszewski, Lane A. Hemaspaandra:
Open questions in the theory of semifeasible computation. SIGACT News 37(1): 47-65 (2006) - [j113]Lane A. Hemaspaandra:
SIGACT news complexity theory column 51. SIGACT News 37(2): 31-46 (2006) - [j112]Lane A. Hemaspaandra:
SIGACT news complexity theory column 52. SIGACT News 37(3): 36-54 (2006) - [j111]Lane A. Hemaspaandra:
SIGACT news complexity theory column 53. SIGACT News 37(4): 47-55 (2006) - [j110]Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe:
If P neq NP then some strongly noninvertible functions are invertible. Theor. Comput. Sci. 362(1-3): 54-62 (2006) - [c72]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
The Complexity of Bribery in Elections. AAAI 2006: 641-646 - [c71]Piotr Faliszewski, Lane A. Hemaspaandra:
The Consequences of Eliminating NP Solutions. DCFS 2006: 1-15 - [c70]Christopher M. Homan, Lane A. Hemaspaandra:
Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners. MFCS 2006: 528-539 - [c69]Lane A. Hemaspaandra, Leen Torenvliet:
P-Selectivity, Immunity, and the Power of One Bit. SOFSEM 2006: 323-331 - [c68]Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub:
Cluster Computing and the Power of Edge Recognition. TAMC 2006: 283-294 - [i50]Lane A. Hemaspaandra, Mayur Thakur:
Query-Monotonic Turing Reductions. CoRR abs/cs/0602001 (2006) - [i49]Piotr Faliszewski, Lane A. Hemaspaandra:
The Consequences of Eliminating NP Solutions. CoRR abs/cs/0606009 (2006) - [i48]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. CoRR abs/cs/0608057 (2006) - [i47]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
How Hard Is Bribery in Elections? CoRR abs/cs/0608081 (2006) - [i46]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
A Richer Understanding of the Complexity of Election Systems. CoRR abs/cs/0609112 (2006) - 2005
- [j109]Jin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara:
Competing provers yield improved Karp-Lipton collapse results. Inf. Comput. 198(1): 1-23 (2005) - [j108]Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau:
Context-free languages can be accepted with absolutely no space overhead. Inf. Comput. 203(2): 163-180 (2005) - [j107]Piotr Faliszewski, Lane A. Hemaspaandra:
Advice for semifeasible sets and the complexity-theoretic cost(lessness) of algebraic properties. Int. J. Found. Comput. Sci. 16(5): 913-928 (2005) - [j106]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Extending Downward Collapse from 1-versus-2 Queries to m-versus-m + 1 Queries. SIAM J. Comput. 34(6): 1352-1369 (2005) - [j105]Lane A. Hemaspaandra:
SIGACT news complexity theory column 48. SIGACT News 36(3): 24-38 (2005) - [j104]Lane A. Hemaspaandra:
SIGACT news complexity theory column 49. SIGACT News 36(4): 24-35 (2005) - [j103]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
All superlinear inverse schemes are coNP-hard. Theor. Comput. Sci. 345(2-3): 345-358 (2005) - [c67]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Anyone but Him: The Complexity of Precluding an Alternative. AAAI 2005: 95-101 - [c66]Lane A. Hemaspaandra, Mayur Thakur:
Query-Monotonic Turing Reductions. COCOON 2005: 895-904 - [c65]Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena:
Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory. ICTCS 2005: 265-279 - [i45]Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen:
Algebraic Properties for Selector Functions. CoRR abs/cs/0501022 (2005) - [i44]Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner:
The Complexity of Computing the Size of an Interval. CoRR abs/cs/0502058 (2005) - [i43]Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena:
Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory. CoRR abs/cs/0503049 (2005) - [i42]Edith Hemaspaandra, Lane A. Hemaspaandra:
Dichotomy for Voting Systems. CoRR abs/cs/0504075 (2005) - [i41]Lane A. Hemaspaandra, Leen Torenvliet:
P-Selectivity, Immunity, and the Power of One Bit. CoRR abs/cs/0504096 (2005) - [i40]Edith Hemaspaandra, Lane A. Hemaspaandra, Osamu Watanabe:
The Complexity of Kings. CoRR abs/cs/0506055 (2005) - [i39]Piotr Faliszewski, Lane A. Hemaspaandra:
Open Questions in the Theory of Semifeasible Computation. CoRR abs/cs/0506082 (2005) - [i38]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Anyone but Him: The Complexity of Precluding an Alternative. CoRR abs/cs/0507027 (2005) - [i37]Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub:
Cluster Computing and the Power of Edge Recognition. CoRR abs/cs/0509060 (2005) - [i36]Christopher M. Homan, Lane A. Hemaspaandra:
Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners. CoRR abs/cs/0509061 (2005) - 2004
- [j102]Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen:
Algebraic Properties for Selector Functions. SIAM J. Comput. 33(6): 1309-1337 (2004) - [j101]Lane A. Hemaspaandra:
SIGACT news complexity theory column 43. SIGACT News 35(1): 22-35 (2004) - [j100]Lane A. Hemaspaandra, Mayur Thakur:
Lower bounds and the hardness of counting properties. Theor. Comput. Sci. 326(1-3): 1-28 (2004) - [c64]Lane A. Hemaspaandra:
Advice for Semifeasible Sets and the Complexity-Theoretic Cost(lessness) of Algebraic Properties. DCFS 2004: 52-66 - [c63]Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed Javeed Zaki, Marius Zimand:
The Complexity of Finding Top-Toda-Equivalence-Class Members. LATIN 2004: 90-99 - [c62]Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi:
Complexity Results in Graph Reconstruction. MFCS 2004: 287-297 - [c61]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
All Superlinear Inverse Schemes Are coNP-Hard. MFCS 2004: 368-379 - [i35]Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi:
Complexity Results in Graph Reconstruction. CoRR cs.CC/0410021 (2004) - [i34]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
All Superlinear Inverse Schemes are coNP-Hard. CoRR cs.CC/0410023 (2004) - [i33]Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau:
Overhead-Free Computation, DCFLs, and CFLs. CoRR cs.CC/0410035 (2004) - 2003
- [b2]Lane A. Hemaspaandra, Leen Torenvliet:
Theory of Semi-Feasible Algorithms. Monographs in Theoretical Computer Science. An EATCS Series, Springer 2003, ISBN 978-3-642-07581-0, pp. i-x, 1-149 - [j99]Lane A. Hemaspaandra:
SIGACT news complexity theory column 40. SIGACT News 34(2): 27-41 (2003) - [j98]Lane A. Hemaspaandra:
SIGACT News complexity theory column 41. SIGACT News 34(3): 26-39 (2003) - [j97]Lane A. Hemaspaandra:
SIGACT news complexity theory column 42. SIGACT News 34(4): 38-52 (2003) - [j96]Lane A. Hemaspaandra, Harald Hempel:
P-immune sets with holes lack self-reducibility properties. Theor. Comput. Sci. 302(1-3): 457-466 (2003) - [c60]Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau:
Computation with Absolutely No Space Overhead. Developments in Language Theory 2003: 325-336 - [c59]Jin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara:
Competing Provers Yield Improved Karp-Lipton Collapse Results. STACS 2003: 535-546 - 2002
- [b1]Lane A. Hemaspaandra, Mitsunori Ogihara:
The Complexity Theory Companion. Texts in Theoretical Computer Science. An EATCS Series, Springer 2002, ISBN 978-3-642-08684-7, pp. 1-372 - [j95]Richard Beigel, Lane A. Hemaspaandra, Harald Hempel, Jörg Vogel:
Optimal Series-Parallel Trade-offs for Reducing a Function to Its Own Graph. Inf. Comput. 173(2): 123-131 (2002) - [j94]Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand:
Almost-Everywhere Superiority for Quantum Polynomial Time. Inf. Comput. 175(2): 171-181 (2002) - [j93]Jörg Rothe, Lane A. Hemaspaandra:
On characterizing the existence of partial one-way permutations. Inf. Process. Lett. 82(3): 165-171 (2002) - [j92]Lane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung:
Reducing the Number of Solutions of NP Functions. J. Comput. Syst. Sci. 64(2): 311-328 (2002) - [j91]Lane A. Hemaspaandra:
SIGACT news complexity theory column 35. SIGACT News 33(1): 32-45 (2002) - [j90]Lane A. Hemaspaandra:
SIGACT news complexity theory column 36. SIGACT News 33(2): 34-47 (2002) - [j89]Lane A. Hemaspaandra:
SIGACT news complexity theory comun 37. SIGACT News 33(3): 32-49 (2002) - [j88]Lane A. Hemaspaandra:
SIGACT news complexity theory column 38. SIGACT News 33(4): 22-36 (2002) - [c58]Lane A. Hemaspaandra, Mayur Thakur:
Lower Bounds and the Hardness of Counting Properties. IFIP TCS 2002: 217-229 - 2001
- [j87]Lane A. Hemaspaandra:
SIGACT news complexity theory column 31. SIGACT News 32(1): 21-31 (2001) - [j86]Lane A. Hemaspaandra:
SIGACT News complexity theory column 32. SIGACT News 32(2): 32-43 (2001) - [j85]Lane A. Hemaspaandra:
Complexity theory. SIGACT News 32(3): 40-52 (2001) - [j84]Lane A. Hemaspaandra:
SIGACT news complexity theory column 34. SIGACT News 32(4): 24-33 (2001) - [j83]Lane A. Hemaspaandra, Mitsunori Ogihara:
The complexity theory companion. SIGACT News 32(4): 66-68 (2001) - [c57]Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen:
Algebraic Properties for P-Selectivity. COCOON 2001: 49-58 - [c56]Lane A. Hemaspaandra, Harald Hempel:
P-Immune Sets with Holes Lack Self-Reducibility Properties. DMTCS 2001: 115-124 - [c55]Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe:
If P != NP Then Some Strongly Noninvertible Functions Are Invertible. FCT 2001: 162-171 - [c54]Lane A. Hemaspaandra, Sven Kosub, Klaus W. Wagner:
The Complexity of Computing the Size of an Interval. ICALP 2001: 1040-1051 - [i32]Lane A. Hemaspaandra, Harald Hempel:
P-Immune Sets with Holes Lack Self-Reducibility Properties. CoRR cs.CC/0102024 (2001) - [i31]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Using the No-Search Easy-Hard Technique for Downward Collapse. CoRR cs.CC/0106037 (2001) - 2000
- [j82]Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe:
Restrictive Acceptance Suffices for Equivalence Problems. LMS J. Comput. Math. 3: 86-95 (2000) - [j81]Lane A. Hemaspaandra, Christian Glaßer:
A moment of perfect clarity I: the parallel census technique. SIGACT News 31(3): 37-42 (2000) - [j80]Christian Glaßer, Lane A. Hemaspaandra:
A moment of perfect clarity II: consequences of sparse sets hard for NP with respect to weak reductions. SIGACT News 31(4): 39-51 (2000) - [j79]Lane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara:
Erratum to "Reducibility classes of P-selective sets". Theor. Comput. Sci. 234(1-2): 323 (2000) - [j78]Lane A. Hemaspaandra, Jörg Rothe:
A second step towards complexity-theoretic analogs of Rice's Theorem. Theor. Comput. Sci. 244(1-2): 205-217 (2000) - [j77]Lane A. Hemaspaandra, Jörg Rothe:
Characterizing the existence of one-way permutations. Theor. Comput. Sci. 244(1-2): 257-261 (2000) - [c53]Edith Hemaspaandra, Lane A. Hemaspaandra:
Computational Politics: Electoral Systems. MFCS 2000: 64-83 - [c52]Lane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung:
Reducing the Number of Solutions of NP Functions. MFCS 2000: 394-404 - [i30]Christian Glaßer, Lane A. Hemaspaandra:
A Moment of Perfect Clarity I: The Parallel Census Technique. CoRR cs.CC/0007025 (2000) - [i29]Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe:
If P \neq NP then Some Strongly Noninvertible Functions are Invertible. CoRR cs.CC/0010011 (2000) - [i28]Christian Glaßer, Lane A. Hemaspaandra:
A Moment of Perfect Clarity II: Consequences of Sparse Sets Hard for NP with Respect to Weak Reductions. CoRR cs.CC/0011019 (2000) - [i27]Lane A. Hemaspaandra:
Take-home Complexity. CoRR cs.CY/0001016 (2000)
1990 – 1999
- 1999
- [j76]Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung:
Self-Specifying Machines. Int. J. Found. Comput. Sci. 10(3): 263-276 (1999) - [j75]Lane A. Hemaspaandra, Jörg Rothe:
Creating Strong, Total, Commutative, Associative One-Way Functions from Any One-Way Function in Complexity Theory. J. Comput. Syst. Sci. 58(3): 648-659 (1999) - [j74]Russell Bent, Michael Schear, Lane A. Hemaspaandra, Gabriel Istrate:
A Note on Bounded-Weight Error-Correcting Codes. J. Univers. Comput. Sci. 5(12): 817-827 (1999) - [j73]Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung:
Robust Reductions. Theory Comput. Syst. 32(6): 625-647 (1999) - [j72]Lane A. Hemaspaandra:
Biomolecular computing: recent theoretical and experimental advances. SIGACT News 30(2): 22-30 (1999) - [j71]Alina Beygelzimer, Lane A. Hemaspaandra, Christopher M. Homan, Jörg Rothe:
One-way functions in worst-case cryptography: algebraic and security properties are on the house. SIGACT News 30(4): 25-40 (1999) - [c51]Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe:
Restrictive Acceptance Suffices for Equivalence Problems. FCT 1999: 124-135 - [c50]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries. STACS 1999: 269-280 - [r1]William I. Gasarch, Arto Salomaa, Thomas H. Cormen, Lane A. Hemaspaandra, Milena Mihail:
Theoretical Computer Science. Handbook of Discrete and Combinatorial Mathematics 1999 - [i26]Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung:
Robust Reductions. CoRR cs.CC/9906033 (1999) - [i25]Lane A. Hemaspaandra, Jörg Rothe:
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets. CoRR cs.CC/9907033 (1999) - [i24]Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe:
Polynomial-Time Multi-Selectivity. CoRR cs.CC/9907034 (1999) - [i23]Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung:
Easy Sets and Hard Certificate Schemes. CoRR cs.CC/9907035 (1999) - [i22]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. CoRR cs.CC/9907036 (1999) - [i21]Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe:
Boolean Operations, Joins, and the Extended Low Hierarchy. CoRR cs.CC/9907037 (1999) - [i20]Lane A. Hemaspaandra, Jörg Rothe:
A Second Step Towards Complexity-Theoretic Analogs of Rice's Theorem. CoRR cs.CC/9907038 (1999) - [i19]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Raising NP Lower Bounds to Parallel NP Lower Bounds. CoRR cs.CC/9907039 (1999) - [i18]Jörg Rothe, Lane A. Hemaspaandra:
Characterizations of the Existence of Partial and Total One-Way Permutations. CoRR cs.CC/9907040 (1999) - [i17]Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe:
Restrictive Acceptance Suffices for Equivalence Problems. CoRR cs.CC/9907041 (1999) - [i16]Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung:
Query Order. CoRR cs.CC/9909020 (1999) - [i15]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. CoRR cs.CC/9910002 (1999) - [i14]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
R1-ttSN(NP) Distinguishes Robust Many-One and Turing Completeness. CoRR cs.CC/9910003 (1999) - [i13]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
An Introduction to Query Order. CoRR cs.CC/9910004 (1999) - [i12]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Query Order and the Polynomial Hierarchy. CoRR cs.CC/9910005 (1999) - [i11]Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung:
Self-Specifying Machines. CoRR cs.CC/9910006 (1999) - [i10]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
A Downward Collapse within the Polynomial Hierarchy. CoRR cs.CC/9910007 (1999) - [i9]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Translating Equality Downwards. CoRR cs.CC/9910008 (1999) - [i8]Alina Beygelzimer, Lane A. Hemaspaandra, Christopher M. Homan, Jörg Rothe:
One-Way Functions in Worst-Case Cryptography: Algebraic and Security Properties. CoRR cs.CC/9911007 (1999) - [i7]Russell Bent, Michael Schear, Lane A. Hemaspaandra, Gabriel Istrate:
On Bounded-Weight Error-Correcting Codes. CoRR cs.OH/9906001 (1999) - [i6]Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand:
Almost-Everywhere Superiority for Quantum Computing. CoRR quant-ph/9910033 (1999) - 1998
- [j70]Lane A. Hemaspaandra, Kulathur S. Rajasethupathy, Prasanna Sethupathy, Marius Zimand:
Power Balance and Apportionment Algorithms for the United States Congress. ACM J. Exp. Algorithmics 3: 1 (1998) - [j69]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Query Order and the Polynomial Hierarchy. J. Univers. Comput. Sci. 4(6): 574-588 (1998) - [j68]Lane A. Hemaspaandra, Christopher Nasipak, Keith Parkins:
A Note on Linear-Nondeterminism, Linear-Sized, Karp-Lipton Advice for the P-Selective Sets. J. Univers. Comput. Sci. 4(8): 670-674 (1998) - [j67]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
RS N1-tt (NP) Distinguishes Robust Many-One and Turing Completeness. Theory Comput. Syst. 31(3): 307-325 (1998) - [j66]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
A Downward Collapse within the Polynomial Hierarchy. SIAM J. Comput. 28(2): 383-393 (1998) - [j65]Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung:
Query Order. SIAM J. Comput. 28(2): 637-651 (1998) - [j64]Lane A. Hemaspaandra:
Take-home complexity. SIGACT News 29(2): 9-13 (1998) - [j63]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. SIGACT News 29(3): 10-22 (1998) - [j62]Lane A. Hemaspaandra, Alan L. Selman:
Writing and editing complexity theory: tales and tools. SIGACT News 29(4): 20-27 (1998) - [j61]Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe:
Boolean Operations, Joins, and the Extended Low Hierarchy. Theor. Comput. Sci. 205(1-2): 317-327 (1998) - [c49]Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung:
Robust Reductions. COCOON 1998: 174-183 - [c48]Lane A. Hemaspaandra, Jörg Rothe:
A Second Step Towards Circuit Complexity-Theoretic Analogs of Rice's Theorem. MFCS 1998: 418-426 - [i5]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Downward Collapse from a Weaker Hypothesis. CoRR cs.CC/9808002 (1998) - [i4]Lane A. Hemaspaandra, Jörg Rothe:
Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function. CoRR cs.CC/9808003 (1998) - [i3]Lane A. Hemaspaandra, Alan L. Selman:
Writing and Editing Complexity Theory: Tales and Tools. CoRR cs.GL/9811005 (1998) - 1997
- [j60]Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung:
Easy Sets and Hard Certificate Schemes. Acta Informatica 34(11): 859-879 (1997) - [j59]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
An Introduction to Query Order. Bull. EATCS 63 (1997) - [j58]Lane A. Hemaspaandra, Zhigen Jiang:
Logspace Reducibility: Models and Equivalences. Int. J. Found. Comput. Sci. 8(1): 95- (1997) - [j57]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. J. ACM 44(6): 806-825 (1997) - [j56]Lane A. Hemaspaandra, Mitsunori Ogihara:
Universally Serializable Computation. J. Comput. Syst. Sci. 55(3): 547-560 (1997) - [j55]Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe:
Polynomial-Time Multi-Selectivity. J. Univers. Comput. Sci. 3(3): 197-229 (1997) - [j54]Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf:
Threshold Computation and Cryptographic Security. SIAM J. Comput. 26(1): 59-78 (1997) - [j53]Lane A. Hemaspaandra, Jörg Rothe:
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets. SIAM J. Comput. 26(3): 634-653 (1997) - [j52]Lane A. Hemaspaandra:
Journals to Die For. SIGACT News 28(1): 2 (1997) - [j51]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Raising NP lower bounds to parallel NP lower bounds. SIGACT News 28(2): 2-13 (1997) - [j50]Lane A. Hemaspaandra:
SIGACT News complexity theory column 18. SIGACT News 28(3): 2-11 (1997) - [c47]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness. CIAC 1997: 49-60 - [c46]Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung:
On Sets with Easy Certificates and the Existence of One-Way Permutations. CIAC 1997: 264-275 - [c45]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Query Order in the Polynomial Hierarchy. FCT 1997: 222-232 - [c44]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. ICALP 1997: 214-224 - [c43]Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
A Downward Translation in the Polynomial Hierarchy. STACS 1997: 319-328 - 1996
- [j49]Yenjo Han, Lane A. Hemaspaandra:
Pseudorandom Generators and the Frequency of Simplicity. J. Cryptol. 9(4): 251-261 (1996) - [j48]Lane A. Hemaspaandra, Marius Zimand:
Strong Self-Reducibility Precludes Strong Immunity. Math. Syst. Theory 29(5): 535-548 (1996) - [j47]Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman:
Computing Solutions Uniquely Collapses the Polynomial Hierarchy. SIAM J. Comput. 25(4): 697-708 (1996) - [j46]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 12. SIGACT News 27(1): 2-13 (1996) - [j45]Lane A. Hemaspaandra, Leen Torenvliet:
Optimal Advice. Theor. Comput. Sci. 154(2): 367-377 (1996) - [j44]Lane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara:
Reducibility Classes of P-Selective Sets. Theor. Comput. Sci. 155(2): 447-457 (1996) - [c42]Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe:
The Join Can Lower Complexity. COCOON 1996: 260-267 - [i2]Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman:
Computing Solutions Uniquely Collapses the Polynomial Hierarchy. Electron. Colloquium Comput. Complex. TR96 (1996) - [i1]Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe:
Powers-of-Two Acceptance Suffices for Equivalence and Bounded Ambiguity Problems. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j43]Lane A. Hemaspaandra, Sudhir K. Jha:
Defying Upward and Downward Separation. Inf. Comput. 121(1): 1-13 (1995) - [j42]Lane A. Hemaspaandra, Albrecht Hoene, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman, Thomas Thierauf, Jie Wang:
Nondeterministically Selective Sets. Int. J. Found. Comput. Sci. 6(4): 403-416 (1995) - [j41]Lane A. Hemaspaandra, Riccardo Silvestri:
Easily Checked Generalized Self-Reducibility. SIAM J. Comput. 24(4): 840-858 (1995) - [j40]Lane A. Hemaspaandra, Heribert Vollmer:
The satanic notations: counting classes beyond #P and other definitional adventures. SIGACT News 26(1): 2-13 (1995) - [j39]Lane A. Hemaspaandra:
SIGACT News Complexity Theory Column 10. SIGACT News 26(3): 2-12 (1995) - [j38]Lane A. Hemaspaandra, Ajit Ramachandran, Marius Zimand:
Worlds to die for. SIGACT News 26(4): 5-15 (1995) - [j37]Lane A. Hemaspaandra, Zhigen Jiang:
P-Selectivity: Intersections and Indices. Theor. Comput. Sci. 145(1&2): 371-380 (1995) - [c41]Lane A. Hemaspaandra, Jörg Rothe:
Intersection Suffices for Boolean Hierarchy Equivalence. COCOON 1995: 430-435 - [c40]Sophie Fischer, Lane A. Hemaspaandra, Leen Torenvliet:
Witness-Isomorphic Reductions and the Local Search Problem (Extended Abstract). MFCS 1995: 277-287 - [c39]Yenjo Han, Lane A. Hemaspaandra:
Pseudorandom Generators and the Frequency of Simplicity. STACS 1995: 50-59 - 1994
- [j36]Lane A. Hemaspaandra, Mitsunori Ogihara, Seinosuke Toda:
Space-Efficient Recognition of Sparse Self-Reducible Languages. Comput. Complex. 4: 262-296 (1994) - [j35]Dieter Kratsch, Lane A. Hemaspaandra:
On the Complexity of Graph Reconstruction. Math. Syst. Theory 27(3): 257-273 (1994) - [j34]Lane A. Hemaspaandra:
Complexity theory column 5: the not-ready-for-prime-time conjectures. SIGACT News 25(2): 5-10 (1994) - [j33]Derek Denny-Brown, Yenjo Han, Lane A. Hemaspaandra, Leen Torenvliet:
Semi-membership algorithms: some recent advances. SIGACT News 25(3): 12-23 (1994) - [j32]Lane A. Hemaspaandra:
Teaching Computational Complexity: Resources to Treasure. SIGACT News 25(4): 2-11 (1994) - [j31]Edith Hemaspaandra, Lane A. Hemaspaandra:
Quasi-injective Reductions. Theor. Comput. Sci. 123(2): 407-413 (1994) - [c38]Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman:
Computing Solutions Uniquely collapses the Polynomial Hierarchy. ISAAC 1994: 56-64 - 1993
- [j30]Gerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes:
Using Inductive Counting to Simulate Nondeterministic Computation. Inf. Comput. 102(1): 102-117 (1993) - [j29]William I. Gasarch, Lane A. Hemachandra, Albrecht Hoene:
On Checking Versus Evaluation of Multiple Queries. Inf. Comput. 105(1): 72-93 (1993) - [j28]Lane A. Hemaspaandra, Sanjay Jain, Nikolai K. Vereshchagin:
Banishing Robust Turing Completeness. Int. J. Found. Comput. Sci. 4(3): 245-265 (1993) - [j27]Mitsunori Ogiwara, Lane A. Hemachandra:
A Complexity Theory for Feasible Closure Properties. J. Comput. Syst. Sci. 46(3): 295-325 (1993) - [j26]Lane A. Hemachandra, Albrecht Hoene:
Collapsing Degrees via Strong Computation. J. Comput. Syst. Sci. 46(3): 363-380 (1993) - [j25]Lane A. Hemaspaandra:
Lowness: a yardstick for NP-P. SIGACT News 24(2): 10-14 (1993) - [c37]Lane A. Hemachandra, Riccardo Silvestri:
Easity Checked Self-Reducibility (Extended Abstract). FCT 1993: 289-298 - [c36]Lane A. Hemachandra:
Fault-Tolerance and Complexity (Extended Abstract). ICALP 1993: 189-202 - [c35]Lane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang:
Selectivity. ICCI 1993: 55-59 - [c34]Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf:
Threshold Computation and Cryptographic Security. ISAAC 1993: 230-239 - [c33]Lane A. Hemachandra, Sudhir K. Jha:
Defying Upward and Downward Separation. STACS 1993: 185-195 - [p1]Lane A. Hemachandra, Mitsunori Ogiwara:
Is #P Closed Under Subtraction? Current Trends in Theoretical Computer Science 1993: 523-536 - 1992
- [j24]Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen:
Polynomial-Time Compression. Comput. Complex. 2: 18-39 (1992) - [j23]Lane A. Hemachandra, Mitsunori Ogiwara:
Is #P Closed under Substraction? Bull. EATCS 46: 107-123 (1992) - [j22]Eric Allender, Lane A. Hemachandra:
Lower Bounds for the Low Hierarchy. J. ACM 39(1): 234-251 (1992) - [j21]David Eppstein, Lane A. Hemachandra, James Tisdall, Bülent Yener:
Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity Classes. Math. Syst. Theory 25(1): 23-36 (1992) - [j20]Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe:
Relating Equivalence and Reducibility to Sparse Sets. SIAM J. Comput. 21(3): 521-539 (1992) - [j19]Lane A. Hemachandra, Roy S. Rubinstein:
Separating Complexity Classes With Tally Oracles. Theor. Comput. Sci. 92(2): 309-318 (1992) - [c32]Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe:
How Hard Are Sparse Sets? SCT 1992: 222-238 - [c31]Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf:
Reductions to Sets of Low Information Content. Complexity Theory: Current Research 1992: 1-46 - [c30]Jin-yi Cai, Lane A. Hemachandra, Jozef Vyskoc:
Promise Problems and Guarded Access to Unambiguous Computation. Complexity Theory: Current Research 1992: 101-146 - [c29]Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf:
Reductions to Sets of Low Information Content. ICALP 1992: 162-173 - [c28]Lane A. Hemachandra, Sanjay Jain, Nikolai K. Vereshchagin:
Banishing Robust Turing Completeness. LFCS 1992: 186-197 - [c27]Jin-yi Cai, Lane A. Hemachandra, Jozef Vyskoc:
Promise Problems and Access to Unambiguous Computation. MFCS 1992: 162-171 - 1991
- [j18]Lane A. Hemachandra, Sanjay Jain:
On the Limitations of Locally Robust Positive Reductions. Int. J. Found. Comput. Sci. 2(3): 237-255 (1991) - [j17]Richard Beigel, Lane A. Hemachandra, Gerd Wechsung:
Probabilistic Polynomial Time is Closed under Parity Reductions. Inf. Process. Lett. 37(2): 91-94 (1991) - [j16]Jin-yi Cai, Lane A. Hemachandra:
A Note on Enumarative Counting. Inf. Process. Lett. 38(4): 215-219 (1991) - [j15]Judy Goldsmith, Lane A. Hemachandra, Deborah Joseph, Paul Young:
Near-Testable Sets. SIAM J. Comput. 20(3): 506-523 (1991) - [j14]Lane A. Hemachandra, Albrecht Hoene:
On Sets with Efficient Implicit Membership Tests. SIAM J. Comput. 20(6): 1148-1156 (1991) - [j13]Lane A. Hemachandra, Albrecht Hoene, Dirk Siefkes, Paul Young:
On Sets Polynomially Enumerable by Iteration. Theor. Comput. Sci. 80(2): 203-225 (1991) - [j12]Juris Hartmanis, Lane A. Hemachandra:
One-Way Functions and the Nonisomorphism of NP-Complete Sets. Theor. Comput. Sci. 81(1): 155-163 (1991) - [j11]Lane A. Hemachandra, Gerd Wechsung:
Kolmogorov Characterizations of Complexity Classes. Theor. Comput. Sci. 83(2): 313-322 (1991) - [c26]Mitsunori Ogiwara, Lane A. Hemachandra:
A Complexity Theory for Feasible Closure Properties. SCT 1991: 16-29 - [c25]Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe:
Relating Equivalence and Reducibility to Sparse Sets. SCT 1991: 220-229 - [c24]Dieter Kratsch, Lane A. Hemachandra:
On the Complexity of Graph Reconstruction. FCT 1991: 318-328 - [c23]Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen:
On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions. FSTTCS 1991: 212-223 - [c22]Lane A. Hemachandra, Albrecht Hoene:
Collapsing Degrees via Strong Computation (Extended Abstract). ICALP 1991: 393-404 - 1990
- [j10]Lane A. Hemachandra, Steven Rudich:
On the Complexity of Ranking. J. Comput. Syst. Sci. 41(2): 251-271 (1990) - [j9]Jin-yi Cai, Lane A. Hemachandra:
On the Power of Parity Polynomial Time. Math. Syst. Theory 23(2): 95-106 (1990) - [j8]Juris Hartmanis, Lane A. Hemachandra:
Robust Machines Accept Easy Sets. Theor. Comput. Sci. 74(2): 217-225 (1990) - [c21]Lane A. Hemachandra, Albrecht Hoene:
On Sets with Efficient Implicit Membership Tests. SCT 1990: 11-19 - [c20]Lane A. Hemachandra, Roy S. Rubinstein:
A Note on Relativizing Complexity Classes with Tally Oracles. SCT 1990: 287-294 - [c19]Gerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes:
Using Inductive Counting to Simulate Nondeterministic Computation. MFCS 1990: 187-194 - [c18]William I. Gasarch, Lane A. Hemachandra, Albrecht Hoene:
On Checking Versus Evaluation of Multiple Queries. MFCS 1990: 261-268 - [c17]Lane A. Hemachandra:
Algorithms from Complexity Theory: Polynominal-Time Operations for Complex Sets. SIGAL International Symposium on Algorithms 1990: 221-231
1980 – 1989
- 1989
- [j7]Jin-yi Cai, Lane A. Hemachandra:
Enumerative Counting Is Hard. Inf. Comput. 82(1): 34-44 (1989) - [j6]Lane A. Hemachandra:
The Strong Exponential Hierarchy Collapses. J. Comput. Syst. Sci. 39(3): 299-322 (1989) - [j5]Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung:
The Boolean Hierarchy II: Applications. SIAM J. Comput. 18(1): 95-111 (1989) - [c16]Richard Beigel, Lane A. Hemachandra, Gerd Wechsung:
On the Power of Probabilistic Polynomial Time: PNP[log] subseteq PP. SCT 1989: 225-227 - [c15]Lane A. Hemachandra, Sanjay Jain:
On the Limitations of Locally Robust Positive Reductions. FSTTCS 1989: 193-203 - [c14]Eric Allender, Lane A. Hemachandra:
Lower Bounds for the Low Hierarchy (Extended Abstract). ICALP 1989: 31-45 - [c13]Lane A. Hemachandra, Gerd Wechsung:
Using Randomness to Characterize the Complexity of Computation. IFIP Congress 1989: 281-286 - [c12]Lane A. Hemachandra, Albrecht Hoene, Dirk Siefkes:
Polynomial-Time Functions Generate SAT: On P-Splinters. MFCS 1989: 259-269 - [c11]Jin-yi Cai, Lane A. Hemachandra:
On the Power of Parity Polynomial Time. STACS 1989: 229-239 - 1988
- [j4]Juris Hartmanis, Lane A. Hemachandra:
On Sparse Oracles Separating Feasible Complexity Classes. Inf. Process. Lett. 28(6): 291-295 (1988) - [j3]Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung:
The Boolean Hierarchy I: Structural Properties. SIAM J. Comput. 17(6): 1232-1252 (1988) - [j2]Juris Hartmanis, Lane A. Hemachandra:
Complexity Classes without Machines: On Complete Languages for UP. Theor. Comput. Sci. 58: 129-142 (1988) - [c10]Jin-Yi Cai, Lane A. Hemachandra:
Enumerative counting is hard. SCT 1988: 194-203 - [c9]Martín Abadi, Eric Allender, Andrei Z. Broder, Joan Feigenbaum, Lane A. Hemachandra:
On Generating Solved Instances of Computational Problems. CRYPTO 1988: 297-310 - [c8]Lane A. Hemachandra:
Structure of Complexity Classes: Separations, Collapses, and Completeness. MFCS 1988: 59-72 - 1987
- [j1]Abbas A. El Gamal, Lane A. Hemachandra, Itzhak Shperling, Victor K.-W. Wei:
Using simulated annealing to design good codes. IEEE Trans. Inf. Theory 33(1): 116-123 (1987) - [c7]Lane A. Hemachandra:
On ranking. SCT 1987: 103-117 - [c6]Juris Hartmanis, Lane A. Hemachandra:
One-way functions, robustness, and the non-isomorphism of NP-complete sets. SCT 1987: 160-174 - [c5]Lane A. Hemachandra:
The strong exponential hierarchy collapses. SCT 1987: 191 - [c4]Lane A. Hemachandra:
The Strong Exponential Hierarchy Collapses. STOC 1987: 110-122 - 1986
- [c3]Jin-yi Cai, Lane A. Hemachandra:
The Boolean Hierarchy: Hardware over NP. SCT 1986: 105-124 - [c2]Juris Hartmanis, Lane A. Hemachandra:
Complexity Classes Without Machines: On Complete Languages for UP. ICALP 1986: 123-135 - [c1]Juris Hartmanis, Lane A. Hemachandra:
On Sparse Oracles Separating Feasible Complexity Classes. STACS 1986: 321-333
Coauthor Index
aka: Jin-yi Cai
aka: Christopher M. Homan
aka: Mitsunori Ogiwara
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 19:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint