| | |
Lane A. Hemachandra
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 288 |      | Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton: Search versus Decision for Election Manipulation Problems CoRR abs/1202.6641: (2012) |
| 287 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Controlling Candidate-Sequential Elections CoRR abs/1202.6649: (2012) |
| 286 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: The Complexity of Online Manipulation of Sequential Elections CoRR abs/1202.6655: (2012) |
| 285 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Online Voter Control in Sequential Elections CoRR abs/1203.0411: (2012) |
| 284 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 73. SIGACT News 43(1): 61 (2012) |
| 2011 | ||
| 283 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: The complexity of manipulative attacks in nearly single-peaked electorates. TARK 2011: 228-237 |
| 282 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates CoRR abs/1105.5032: (2011) |
| 281 | | Lane A. Hemaspaandra, Kyle Murray, Xiaoqing Tang: Barbosa, Uniform Polynomial Time Bounds, and Promises CoRR abs/1106.1150: (2011) |
| 280 | | 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) |
| 279 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Multimode Control Attacks on Elections. J. Artif. Intell. Res. (JAIR) 40: 305-351 (2011) |
| 278 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 69. SIGACT News 42(1): 58 (2011) |
| 277 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 70. SIGACT News 42(2): 51 (2011) |
| 276 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 71. SIGACT News 42(3): 53-54 (2011) |
| 275 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 72. SIGACT News 42(4): 53 (2011) |
| 2010 | ||
| 274 | | Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra: Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. AAAI 2010 |
| 273 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Multimode Control Attacks on Elections CoRR abs/1007.1800: (2010) |
| 272 | | Lane A. Hemaspaandra: A Note on Nonuniform versus Uniform ACC^k Circuits for NE CoRR abs/1012.0556: (2010) |
| 271 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Using complexity to protect elections. Commun. ACM 53(11): 74-82 (2010) |
| 270 | | Lane A. Hemaspaandra: SIGACT News Complexity Theory Column 67. SIGACT News 41(3): 58 (2010) |
| 269 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 68. SIGACT News 41(4): 73-94 (2010) |
| 268 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe: On the complexity of kings. Theor. Comput. Sci. 411(4-5): 783-798 (2010) |
| 2009 | ||
| 267 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Multimode Control Attacks on Elections. IJCAI 2009: 128-133 |
| 266 | | 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 |
| 265 | | 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) |
| 264 | | 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) |
| 263 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. J. Artif. Intell. Res. (JAIR) 35: 275-341 (2009) |
| 262 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: How Hard Is Bribery in Elections? J. Artif. Intell. Res. (JAIR) 35: 485-532 (2009) |
| 261 | | 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) |
| 260 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. Math. Log. Q. 55(4): 397-424 (2009) |
| 259 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 62. SIGACT News 40(1): 26 (2009) |
| 258 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 63. SIGACT News 40(2): 49 (2009) |
| 257 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 64. SIGACT News 40(3): 60-76 (2009) |
| 256 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 65. SIGACT News 40(4): 45 (2009) |
| 255 | | Piotr Faliszewski, Lane A. Hemaspaandra: The complexity of power-index comparison. Theor. Comput. Sci. 410(1): 101-107 (2009) |
| 254 | | 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) |
| 2008 | ||
| 253 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Copeland Voting Fully Resists Constructive Control. AAIM 2008: 165-176 |
| 252 | | Piotr Faliszewski, Lane A. Hemaspaandra: The Complexity of Power-Index Comparison. AAIM 2008: 177-187 |
| 251 | | Piotr Faliszewski, Lane A. Hemaspaandra: The Complexity of Power-Index Comparison CoRR abs/0801.4585: (2008) |
| 250 | | 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) |
| 249 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Llull and Copeland Voting Computationally Resist Bribery and Control CoRR abs/0809.4484: (2008) |
| 248 | | Piotr Faliszewski, Lane A. Hemaspaandra: The consequences of eliminating NP solutions. Computer Science Review 2(1): 40-54 (2008) |
| 247 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 59: introduction. SIGACT News 39(2): 50 (2008) |
| 246 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 61. SIGACT News 39(4): 35-36 (2008) |
| 245 | | 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) |
| 2007 | ||
| 244 |  | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Llull and Copeland Voting Broadly Resist Bribery and Control. AAAI 2007: 724-730 |
| 243 | | 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 |
| 242 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe: On the Complexity of Kings. FCT 2007: 328-340 |
| 241 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. IJCAI 2007: 1308-1314 |
| 240 | | 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) |
| 239 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Copeland Voting Fully Resists Constructive Control CoRR abs/0711.4759: (2007) |
| 238 | | 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) |
| 237 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi: Complexity results in graph reconstruction. Discrete Applied Mathematics 155(2): 103-118 (2007) |
| 236 | | Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub: Cluster computing and the power of edge recognition. Inf. Comput. 205(8): 1274-1293 (2007) |
| 235 | | Edith Hemaspaandra, Lane A. Hemaspaandra: Dichotomy for voting systems. J. Comput. Syst. Sci. 73(1): 73-83 (2007) |
| 234 | | 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) |
| 233 | | Lane A. Hemaspaandra: Introduction. SIGACT News 38(3): 34-38 (2007) |
| 232 | | Lane A. Hemaspaandra: Introduction. SIGACT News 38(4): 39-40 (2007) |
| 231 | | Lane A. Hemaspaandra, Mayur Thakur: Query-monotonic Turing reductions. Theor. Comput. Sci. 383(2-3): 153-186 (2007) |
| 2006 | ||
| 230 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: The Complexity of Bribery in Elections. AAAI 2006: 641-646 |
| 229 | | Piotr Faliszewski, Lane A. Hemaspaandra: The Consequences of Eliminating NP Solutions. DCFS 2006: 1-15 |
| 228 | | Christopher M. Homan, Lane A. Hemaspaandra: Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners. MFCS 2006: 528-539 |
| 227 | | Lane A. Hemaspaandra, Leen Torenvliet: P-Selectivity, Immunity, and the Power of One Bit. SOFSEM 2006: 323-331 |
| 226 | | Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub: Cluster Computing and the Power of Edge Recognition. TAMC 2006: 283-294 |
| 225 | | Lane A. Hemaspaandra, Mayur Thakur: Query-Monotonic Turing Reductions CoRR abs/cs/0602001: (2006) |
| 224 | | Piotr Faliszewski, Lane A. Hemaspaandra: The Consequences of Eliminating NP Solutions CoRR abs/cs/0606009: (2006) |
| 223 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control CoRR abs/cs/0608057: (2006) |
| 222 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: How Hard Is Bribery in Elections? CoRR abs/cs/0608081: (2006) |
| 221 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: A Richer Understanding of the Complexity of Election Systems CoRR abs/cs/0609112: (2006) |
| 220 | | Piotr Faliszewski, Lane A. Hemaspaandra: Open questions in the theory of semifeasible computation. SIGACT News 37(1): 47-65 (2006) |
| 219 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 51. SIGACT News 37(2): 31-46 (2006) |
| 218 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 52. SIGACT News 37(3): 36-54 (2006) |
| 217 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 53. SIGACT News 37(4): 47-55 (2006) |
| 216 | | 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) |
| 215 | | 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) |
| 2005 | ||
| 214 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Anyone but Him: The Complexity of Precluding an Alternative. AAAI 2005: 95-101 |
| 213 | | Lane A. Hemaspaandra, Mayur Thakur: Query-Monotonic Turing Reductions. COCOON 2005: 895-904 |
| 212 | | 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 |
| 211 | | Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen: Algebraic Properties for Selector Functions CoRR abs/cs/0501022: (2005) |
| 210 | | 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) |
| 209 | | 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) |
| 208 | | Edith Hemaspaandra, Lane A. Hemaspaandra: Dichotomy for Voting Systems CoRR abs/cs/0504075: (2005) |
| 207 | | Lane A. Hemaspaandra, Leen Torenvliet: P-Selectivity, Immunity, and the Power of One Bit CoRR abs/cs/0504096: (2005) |
| 206 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Osamu Watanabe: The Complexity of Kings CoRR abs/cs/0506055: (2005) |
| 205 | | Piotr Faliszewski, Lane A. Hemaspaandra: Open Questions in the Theory of Semifeasible Computation CoRR abs/cs/0506082: (2005) |
| 204 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Anyone but Him: The Complexity of Precluding an Alternative CoRR abs/cs/0507027: (2005) |
| 203 | | Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub: Cluster Computing and the Power of Edge Recognition CoRR abs/cs/0509060: (2005) |
| 202 | | Christopher M. Homan, Lane A. Hemaspaandra: Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners CoRR abs/cs/0509061: (2005) |
| 201 | | 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) |
| 200 | | 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) |
| 199 | | 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) |
| 198 | | 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) |
| 197 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 48. SIGACT News 36(3): 24-38 (2005) |
| 196 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 49. SIGACT News 36(4): 24-35 (2005) |
| 195 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: All superlinear inverse schemes are coNP-hard. Theor. Comput. Sci. 345(2-3): 345-358 (2005) |
| 2004 | ||
| 194 | | Lane A. Hemaspaandra: Advice for Semifeasible Sets and the Complexity-Theoretic Cost(lessness) of Algebraic Properties. DCFS 2004: 52-66 |
| 193 | | Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed Javeed Zaki, Marius Zimand: The Complexity of Finding Top-Toda-Equivalence-Class Members. LATIN 2004: 90-99 |
| 192 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi: Complexity Results in Graph Reconstruction. MFCS 2004: 287-297 |
| 191 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: All Superlinear Inverse Schemes Are coNP-Hard. MFCS 2004: 368-379 |
| 190 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi: Complexity Results in Graph Reconstruction CoRR cs.CC/0410021: (2004) |
| 189 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: All Superlinear Inverse Schemes are coNP-Hard CoRR cs.CC/0410023: (2004) |
| 188 | | Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau: Overhead-Free Computation, DCFLs, and CFLs CoRR cs.CC/0410035: (2004) |
| 187 | | Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen: Algebraic Properties for Selector Functions. SIAM J. Comput. 33(6): 1309-1337 (2004) |
| 186 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 43. SIGACT News 35(1): 22-35 (2004) |
| 185 | | Lane A. Hemaspaandra, Mayur Thakur: Lower bounds and the hardness of counting properties. Theor. Comput. Sci. 326(1-3): 1-28 (2004) |
| 2003 | ||
| 184 | | Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau: Computation with Absolutely No Space Overhead. Developments in Language Theory 2003: 325-336 |
| 183 | | Jin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara: Competing Provers Yield Improved Karp-Lipton Collapse Results. STACS 2003: 535-546 |
| 182 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 40. SIGACT News 34(2): 27-41 (2003) |
| 181 | | Lane A. Hemaspaandra: SIGACT News complexity theory column 41. SIGACT News 34(3): 26-39 (2003) |
| 180 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 42. SIGACT News 34(4): 38-52 (2003) |
| 179 | | Lane A. Hemaspaandra, Harald Hempel: P-immune sets with holes lack self-reducibility properties. Theor. Comput. Sci. 302(1-3): 457-466 (2003) |
| 2002 | ||
| 178 | | Lane A. Hemaspaandra, Mayur Thakur: Lower Bounds and the Hardness of Counting Properties. IFIP TCS 2002: 217-229 |
| 177 | | 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) |
| 176 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand: Almost-Everywhere Superiority for Quantum Polynomial Time. Inf. Comput. 175(2): 171-181 (2002) |
| 175 | | Jörg Rothe, Lane A. Hemaspaandra: On characterizing the existence of partial one-way permutations. Inf. Process. Lett. 82(3): 165-171 (2002) |
| 174 | | Lane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung: Reducing the Number of Solutions of NP Functions. J. Comput. Syst. Sci. 64(2): 311-328 (2002) |
| 173 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 35. SIGACT News 33(1): 32-45 (2002) |
| 172 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 36. SIGACT News 33(2): 34-47 (2002) |
| 171 | | Lane A. Hemaspaandra: SIGACT news complexity theory comun 37. SIGACT News 33(3): 32-49 (2002) |
| 170 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 38. SIGACT News 33(4): 22-36 (2002) |
| 2001 | ||
| 169 | | Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen: Algebraic Properties for P-Selectivity. COCOON 2001: 49-58 |
| 168 | | Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe: If P != NP Then Some Strongly Noninvertible Functions Are Invertible. FCT 2001: 162-171 |
| 167 | | Lane A. Hemaspaandra, Sven Kosub, Klaus W. Wagner: The Complexity of Computing the Size of an Interval. ICALP 2001: 1040-1051 |
| 166 | | Lane A. Hemaspaandra, Harald Hempel: P-Immune Sets with Holes Lack Self-Reducibility Properties CoRR cs.CC/0102024: (2001) |
| 165 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Using the No-Search Easy-Hard Technique for Downward Collapse CoRR cs.CC/0106037: (2001) |
| 164 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 31. SIGACT News 32(1): 21-31 (2001) |
| 163 | | Lane A. Hemaspaandra: SIGACT News complexity theory column 32. SIGACT News 32(2): 32-43 (2001) |
| 162 | | Lane A. Hemaspaandra: Complexity theory. SIGACT News 32(3): 40-52 (2001) |
| 161 | | Lane A. Hemaspaandra: SIGACT news complexity theory column 34. SIGACT News 32(4): 24-33 (2001) |
| 160 | | Lane A. Hemaspaandra, Mitsunori Ogihara: The complexity theory companion. SIGACT News 32(4): 66-68 (2001) |
| 2000 | ||
| 159 | | Lane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung: Reducing the Number of Solutions of NP Functions. MFCS 2000: 394-404 |
| 158 | | Edith Hemaspaandra, Lane A. Hemaspaandra: Computational Politics: Electoral Systems. MFCS 2000: 64-83 |
| 157 | | Christian Glaßer, Lane A. Hemaspaandra: A Moment of Perfect Clarity I: The Parallel Census Technique CoRR cs.CC/0007025: (2000) |
| 156 | | Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe: If P \neq NP then Some Strongly Noninvertible Functions are Invertible CoRR cs.CC/0010011: (2000) |
| 155 | | 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) |
| 154 | | Lane A. Hemaspaandra: Take-home Complexity CoRR cs.CY/0001016: (2000) |
| 153 | | Lane A. Hemaspaandra, Christian Glaßer: A moment of perfect clarity I: the parallel census technique. SIGACT News 31(3): 37-42 (2000) |
| 152 | | 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) |
| 151 | | Lane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara: Erratum to "Reducibility classes of P-selective sets". Theor. Comput. Sci. 234(1-2): 323 (2000) |
| 150 | | 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) |
| 149 | | Lane A. Hemaspaandra, Jörg Rothe: Characterizing the existence of one-way permutations. Theor. Comput. Sci. 244(1-2): 257-261 (2000) |
| 1999 | ||
| 148 | | Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe: Restrictive Acceptance Suffices for Equivalence Problems. FCT 1999: 124-135 |
| 147 | | 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 |
| 146 | | Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung: Robust Reductions CoRR cs.CC/9906033: (1999) |
| 145 | | Lane A. Hemaspaandra, Jörg Rothe: Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets CoRR cs.CC/9907033: (1999) |
| 144 | | Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe: Polynomial-Time Multi-Selectivity CoRR cs.CC/9907034: (1999) |
| 143 | | Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung: Easy Sets and Hard Certificate Schemes CoRR cs.CC/9907035: (1999) |
| 142 | | 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) |
| 141 | | Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe: Boolean Operations, Joins, and the Extended Low Hierarchy CoRR cs.CC/9907037: (1999) |
| 140 | | Lane A. Hemaspaandra, Jörg Rothe: A Second Step Towards Complexity-Theoretic Analogs of Rice's Theorem CoRR cs.CC/9907038: (1999) |
| 139 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Raising NP Lower Bounds to Parallel NP Lower Bounds CoRR cs.CC/9907039: (1999) |
| 138 | | Jörg Rothe, Lane A. Hemaspaandra: Characterizations of the Existence of Partial and Total One-Way Permutations CoRR cs.CC/9907040: (1999) |
| 137 | | Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe: Restrictive Acceptance Suffices for Equivalence Problems CoRR cs.CC/9907041: (1999) |
| 136 | | Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung: Query Order CoRR cs.CC/9909020: (1999) |
| 135 | | 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) |
| 134 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: R1-ttSN(NP) Distinguishes Robust Many-One and Turing Completeness CoRR cs.CC/9910003: (1999) |
| 133 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: An Introduction to Query Order CoRR cs.CC/9910004: (1999) |
| 132 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Query Order and the Polynomial Hierarchy CoRR cs.CC/9910005: (1999) |
| 131 | | Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung: Self-Specifying Machines CoRR cs.CC/9910006: (1999) |
| 130 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: A Downward Collapse within the Polynomial Hierarchy CoRR cs.CC/9910007: (1999) |
| 129 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Translating Equality Downwards CoRR cs.CC/9910008: (1999) |
| 128 | | 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) |
| 127 | | Russell Bent, Michael Schear, Lane A. Hemaspaandra, Gabriel Istrate: On Bounded-Weight Error-Correcting Codes CoRR cs.OH/9906001: (1999) |
| 126 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand: Almost-Everywhere Superiority for Quantum Computing CoRR quant-ph/9910033: (1999) |
| 125 | | Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung: Self-Specifying Machines. Int. J. Found. Comput. Sci. 10(3): 263-276 (1999) |
| 124 | | 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) |
| 123 | | Russell Bent, Michael Schear, Lane A. Hemaspaandra, Gabriel Istrate: A Note on Bounded-Weight Error-Correcting Codes. J. UCS 5(12): 817-827 (1999) |
| 122 | | Lane A. Hemaspaandra: Biomolecular computing: recent theoretical and experimental advances. SIGACT News 30(2): 22-30 (1999) |
| 121 | | 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) |
| 120 | | Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung: Robust Reductions. Theory Comput. Syst. 32(6): 625-647 (1999) |
| 1998 | ||
| 119 | | Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung: Robust Reductions. COCOON 1998: 174-183 |
| 118 | | Lane A. Hemaspaandra, Jörg Rothe: A Second Step Towards Circuit Complexity-Theoretic Analogs of Rice's Theorem. MFCS 1998: 418-426 |
| 117 | | Lane A. Hemaspaandra, Kulathur S. Rajasethupathy, Prasanna Sethupathy, Marius Zimand: Power Balance and Apportionment Algorithms for the United States Congress. ACM Journal of Experimental Algorithmics 3: 1 (1998) |
| 116 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Downward Collapse from a Weaker Hypothesis CoRR cs.CC/9808002: (1998) |
| 115 | | 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) |
| 114 | | Lane A. Hemaspaandra, Alan L. Selman: Writing and Editing Complexity Theory: Tales and Tools CoRR cs.GL/9811005: (1998) |
| 113 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Query Order and the Polynomial Hierarchy. J. UCS 4(6): 574-588 (1998) |
| 112 | | Lane A. Hemaspaandra, Christopher Nasipak, Keith Parkins: A Note on Linear-Nondeterminism, Linear-Sized, Karp-Lipton Advice for the P-Selective Sets. J. UCS 4(8): 670-674 (1998) |
| 111 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: A Downward Collapse within the Polynomial Hierarchy. SIAM J. Comput. 28(2): 383-393 (1998) |
| 110 | | Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung: Query Order. SIAM J. Comput. 28(2): 637-651 (1998) |
| 109 | | Lane A. Hemaspaandra: Take-home complexity. SIGACT News 29(2): 9-13 (1998) |
| 108 | | 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) |
| 107 | | Lane A. Hemaspaandra, Alan L. Selman: Writing and editing complexity theory: tales and tools. SIGACT News 29(4): 20-27 (1998) |
| 106 | | 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) |
| 105 | | 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) |
| 1997 | ||
| 104 | | Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung: On Sets with Easy Certificates and the Existence of One-Way Permutations. CIAC 1997: 264-275 |
| 103 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness. CIAC 1997: 49-60 |
| 102 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: Query Order in the Polynomial Hierarchy. FCT 1997: 222-232 |
| 101 | | 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 |
| 100 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: A Downward Translation in the Polynomial Hierarchy. STACS 1997: 319-328 |
| 99 | | Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung: Easy Sets and Hard Certificate Schemes. Acta Inf. 34(11): 859-879 (1997) |
| 98 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel: An Introduction to Query Order. Bulletin of the EATCS 63: (1997) |
| 97 | | Lane A. Hemaspaandra, Zhigen Jiang: Logspace Reducibility: Models and Equivalences. Int. J. Found. Comput. Sci. 8(1): 95- (1997) |
| 96 | | 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) |
| 95 | | Lane A. Hemaspaandra, Mitsunori Ogihara: Universally Serializable Computation. J. Comput. Syst. Sci. 55(3): 547-560 (1997) |
| 94 | | Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe: Polynomial-Time Multi-Selectivity. J. UCS 3(3): 197-229 (1997) |
| 93 | | Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf: Threshold Computation and Cryptographic Security. SIAM J. Comput. 26(1): 59-78 (1997) |
| 92 | | Lane A. Hemaspaandra, Jörg Rothe: Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets. SIAM J. Comput. 26(3): 634-653 (1997) |
| 91 | | Lane A. Hemaspaandra: Journals to Die For. SIGACT News 28(1): 2 (1997) |
| 90 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Raising NP lower bounds to parallel NP lower bounds. SIGACT News 28(2): 2-13 (1997) |
| 89 | | Lane A. Hemaspaandra: SIGACT News complexity theory column 18. SIGACT News 28(3): 2-11 (1997) |
| 1996 | ||
| 88 | | Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe: The Join Can Lower Complexity. COCOON 1996: 260-267 |
| 87 | | Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman: Computing Solutions Uniquely Collapses the Polynomial Hierarchy Electronic Colloquium on Computational Complexity (ECCC) 3(27): (1996) |
| 86 | | Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe: Powers-of-Two Acceptance Suffices for Equivalence and Bounded Ambiguity Problems Electronic Colloquium on Computational Complexity (ECCC) 3(45): (1996) |
| 85 | | Yenjo Han, Lane A. Hemaspaandra: Pseudorandom Generators and the Frequency of Simplicity. J. Cryptology 9(4): 251-261 (1996) |
| 84 | | Lane A. Hemaspaandra, Marius Zimand: Strong Self-Reducibility Precludes Strong Immunity. Mathematical Systems Theory 29(5): 535-548 (1996) |
| 83 | | 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) |
| 82 | | Lane A. Hemaspaandra: SIGACT News Complexity Theory Column 12. SIGACT News 27(1): 2-13 (1996) |
| 81 | | Lane A. Hemaspaandra, Leen Torenvliet: Optimal Advice. Theor. Comput. Sci. 154(2): 367-377 (1996) |
| 80 | | Lane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara: Reducibility Classes of P-Selective Sets. Theor. Comput. Sci. 155(2): 447-457 (1996) |
| 1995 | ||
| 79 | | Lane A. Hemaspaandra, Jörg Rothe: Intersection Suffices for Boolean Hierarchy Equivalence. COCOON 1995: 430-435 |
| 78 | | Sophie Fischer, Lane A. Hemaspaandra, Leen Torenvliet: Witness-Isomorphic Reductions and the Local Search Problem (Extended Abstract). MFCS 1995: 277-287 |
| 77 | | Yenjo Han, Lane A. Hemaspaandra: Pseudorandom Generators and the Frequency of Simplicity. STACS 1995: 50-59 |
| 76 | | Lane A. Hemaspaandra, Sudhir K. Jha: Defying Upward and Downward Separation Inf. Comput. 121(1): 1-13 (1995) |
| 75 | | 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) |
| 74 | | Lane A. Hemaspaandra, Riccardo Silvestri: Easily Checked Generalized Self-Reducibility. SIAM J. Comput. 24(4): 840-858 (1995) |
| 73 | | Lane A. Hemaspaandra, Heribert Vollmer: The satanic notations: counting classes beyond #P and other definitional adventures. SIGACT News 26(1): 2-13 (1995) |
| 72 | | Lane A. Hemaspaandra: SIGACT News Complexity Theory Column 10. SIGACT News 26(3): 2-12 (1995) |
| 71 | | Lane A. Hemaspaandra, Ajit Ramachandran, Marius Zimand: Worlds to die for. SIGACT News 26(4): 5-15 (1995) |
| 70 | | Lane A. Hemaspaandra, Zhigen Jiang: P-Selectivity: Intersections and Indices. Theor. Comput. Sci. 145(1&2): 371-380 (1995) |
| 1994 | ||
| 69 | | Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman: Computing Solutions Uniquely collapses the Polynomial Hierarchy. ISAAC 1994: 56-64 |
| 68 | | Lane A. Hemaspaandra, Mitsunori Ogihara, Seinosuke Toda: Space-Efficient Recognition of Sparse Self-Reducible Languages. Computational Complexity 4: 262-296 (1994) |
| 67 | | Dieter Kratsch, Lane A. Hemaspaandra: On the Complexity of Graph Reconstruction. Mathematical Systems Theory 27(3): 257-273 (1994) |
| 66 | | Lane A. Hemaspaandra: Complexity theory column 5: the not-ready-for-prime-time conjectures. SIGACT News 25(2): 5-10 (1994) |
| 65 | | Derek Denny-Brown, Yenjo Han, Lane A. Hemaspaandra, Leen Torenvliet: Semi-membership algorithms: some recent advances. SIGACT News 25(3): 12-23 (1994) |
| 64 | | Lane A. Hemaspaandra: Teaching Computational Complexity: Resources to Treasure. SIGACT News 25(4): 2-11 (1994) |
| 63 | | Edith Hemaspaandra, Lane A. Hemaspaandra: Quasi-injective Reductions. Theor. Comput. Sci. 123(2): 407-413 (1994) |
| 1993 | ||
| 62 | | Lane A. Hemachandra, Riccardo Silvestri: Easity Checked Self-Reducibility (Extended Abstract). FCT 1993: 289-298 |
| 61 | | Lane A. Hemachandra: Fault-Tolerance and Complexity (Extended Abstract). ICALP 1993: 189-202 |
| 60 | | Lane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang: Selectivity. ICCI 1993: 55-59 |
| 59 | | Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf: Threshold Computation and Cryptographic Security. ISAAC 1993: 230-239 |
| 58 | | Lane A. Hemachandra, Sudhir K. Jha: Defying Upward and Downward Separation. STACS 1993: 185-195 |
| 57 | | Gerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes: Using Inductive Counting to Simulate Nondeterministic Computation Inf. Comput. 102(1): 102-117 (1993) |
| 56 | | William I. Gasarch, Lane A. Hemachandra, Albrecht Hoene: On Checking Versus Evaluation of Multiple Queries Inf. Comput. 105(1): 72-93 (1993) |
| 55 | | Lane A. Hemaspaandra, Sanjay Jain, Nikolai K. Vereshchagin: Banishing Robust Turing Completeness. Int. J. Found. Comput. Sci. 4(3): 245-265 (1993) |
| 54 | | Mitsunori Ogiwara, Lane A. Hemachandra: A Complexity Theory for Feasible Closure Properties. J. Comput. Syst. Sci. 46(3): 295-325 (1993) |
| 53 | | Lane A. Hemachandra, Albrecht Hoene: Collapsing Degrees via Strong Computation. J. Comput. Syst. Sci. 46(3): 363-380 (1993) |
| 1992 | ||
| 52 | | 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 |
| 51 | | Jin-yi Cai, Lane A. Hemachandra, Jozef Vyskoc: Promise Problems and Guarded Access to Unambiguous Computation. Complexity Theory: Current Research 1992: 101-146 |
| 50 | | 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 |
| 49 | | Lane A. Hemachandra, Sanjay Jain, Nikolai K. Vereshchagin: Banishing Robust Turing Completeness. LFCS 1992: 186-197 |
| 48 | | Jin-yi Cai, Lane A. Hemachandra, Jozef Vyskoc: Promise Problems and Access to Unambiguous Computation. MFCS 1992: 162-171 |
| 47 | | Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe: How Hard Are Sparse Sets? Structure in Complexity Theory Conference 1992: 222-238 |
| 46 | | Lane A. Hemachandra, Mitsunori Ogiwara: Is #P Closed under Substraction? Bulletin of the EATCS 46: 107-123 (1992) |
| 45 | | Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen: Polynomial-Time Compression. Computational Complexity 2: 18-39 (1992) |
| 44 | | Eric Allender, Lane A. Hemachandra: Lower Bounds for the Low Hierarchy. J. ACM 39(1): 234-251 (1992) |
| 43 | | David Eppstein, Lane A. Hemachandra, James Tisdall, Bülent Yener: Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity Classes. Mathematical Systems Theory 25(1): 23-36 (1992) |
| 42 | | Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe: Relating Equivalence and Reducibility to Sparse Sets. SIAM J. Comput. 21(3): 521-539 (1992) |
| 41 | | Lane A. Hemachandra, Roy S. Rubinstein: Separating Complexity Classes With Tally Oracles. Theor. Comput. Sci. 92(2): 309-318 (1992) |
| 1991 | ||
| 40 | | Dieter Kratsch, Lane A. Hemachandra: On the Complexity of Graph Reconstruction. FCT 1991: 318-328 |
| 39 | | Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen: On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions. FSTTCS 1991: 212-223 |
| 38 | | Lane A. Hemachandra, Albrecht Hoene: Collapsing Degrees via Strong Computation (Extended Abstract). ICALP 1991: 393-404 |
| 37 | | Mitsunori Ogiwara, Lane A. Hemachandra: A Complexity Theory for Feasible Closure Properties. Structure in Complexity Theory Conference 1991: 16-29 |
| 36 | | Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe: Relating Equivalence and Reducibility to Sparse Sets. Structure in Complexity Theory Conference 1991: 220-229 |
| 35 | | Richard Beigel, Lane A. Hemachandra, Gerd Wechsung: Probabilistic Polynomial Time is Closed under Parity Reductions. Inf. Process. Lett. 37(2): 91-94 (1991) |
| 34 | | Jin-yi Cai, Lane A. Hemachandra: A Note on Enumarative Counting. Inf. Process. Lett. 38(4): 215-219 (1991) |
| 33 | | Lane A. Hemachandra, Sanjay Jain: On the Limitations of Locally Robust Positive Reductions. Int. J. Found. Comput. Sci. 2(3): 237-255 (1991) |
| 32 | | Judy Goldsmith, Lane A. Hemachandra, Deborah Joseph, Paul Young: Near-Testable Sets. SIAM J. Comput. 20(3): 506-523 (1991) |
| 31 | | Lane A. Hemachandra, Albrecht Hoene: On Sets with Efficient Implicit Membership Tests. SIAM J. Comput. 20(6): 1148-1156 (1991) |
| 30 | | Lane A. Hemachandra, Albrecht Hoene, Dirk Siefkes, Paul Young: On Sets Polynomially Enumerable by Iteration. Theor. Comput. Sci. 80(2): 203-225 (1991) |
| 29 | | Juris Hartmanis, Lane A. Hemachandra: One-Way Functions and the Nonisomorphism of NP-Complete Sets. Theor. Comput. Sci. 81(1): 155-163 (1991) |
| 28 | | Lane A. Hemachandra, Gerd Wechsung: Kolmogorov Characterizations of Complexity Classes. Theor. Comput. Sci. 83(2): 313-322 (1991) |
| 1990 | ||
| 27 | | Gerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes: Using Inductive Counting to Simulate Nondeterministic Computation. MFCS 1990: 187-194 |
| 26 | | William I. Gasarch, Lane A. Hemachandra, Albrecht Hoene: On Checking Versus Evaluation of Multiple Queries. MFCS 1990: 261-268 |
| 25 | | Lane A. Hemachandra: Algorithms from Complexity Theory: Polynominal-Time Operations for Complex Sets. SIGAL International Symposium on Algorithms 1990: 221-231 |
| 24 | | Lane A. Hemachandra, Albrecht Hoene: On Sets with Efficient Implicit Membership Tests. Structure in Complexity Theory Conference 1990: 11-19 |
| 23 | | Lane A. Hemachandra, Roy S. Rubinstein: A Note on Relativizing Complexity Classes with Tally Oracles. Structure in Complexity Theory Conference 1990: 287-294 |
| 22 | | Lane A. Hemachandra, Steven Rudich: On the Complexity of Ranking. J. Comput. Syst. Sci. 41(2): 251-271 (1990) |
| 21 | | Jin-yi Cai, Lane A. Hemachandra: On the Power of Parity Polynomial Time. Mathematical Systems Theory 23(2): 95-106 (1990) |
| 20 | | Juris Hartmanis, Lane A. Hemachandra: Robust Machines Accept Easy Sets. Theor. Comput. Sci. 74(2): 217-225 (1990) |
| 1989 | ||
| 19 | | Lane A. Hemachandra, Sanjay Jain: On the Limitations of Locally Robust Positive Reductions. FSTTCS 1989: 193-203 |
| 18 | | Eric Allender, Lane A. Hemachandra: Lower Bounds for the Low Hierarchy (Extended Abstract). ICALP 1989: 31-45 |
| 17 | | Lane A. Hemachandra, Gerd Wechsung: Using Randomness to Characterize the Complexity of Computation. IFIP Congress 1989: 281-286 |
| 16 | | Lane A. Hemachandra, Albrecht Hoene, Dirk Siefkes: Polynomial-Time Functions Generate SAT: On P-Splinters. MFCS 1989: 259-269 |
| 15 | | Jin-yi Cai, Lane A. Hemachandra: On the Power of Parity Polynomial Time. STACS 1989: 229-239 |
| 14 | | Richard Beigel, Lane A. Hemachandra, Gerd Wechsung: On the Power of Probabilistic Polynomial Time: PNP[log] subseteq PP. Structure in Complexity Theory Conference 1989: 225-227 |
| 13 | | Jin-yi Cai, Lane A. Hemachandra: Enumerative Counting Is Hard Inf. Comput. 82(1): 34-44 (1989) |
| 12 | | Lane A. Hemachandra: The Strong Exponential Hierarchy Collapses. J. Comput. Syst. Sci. 39(3): 299-322 (1989) |
| 11 | | 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) |
| 1988 | ||
| 10 | | Martín Abadi, Eric Allender, Andrei Z. Broder, Joan Feigenbaum, Lane A. Hemachandra: On Generating Solved Instances of Computational Problems. CRYPTO 1988: 297-310 |
| 9 | | Lane A. Hemachandra: Structure of Complexity Classes: Separations, Collapses, and Completeness. MFCS 1988: 59-72 |
| 8 | | Juris Hartmanis, Lane A. Hemachandra: On Sparse Oracles Separating Feasible Complexity Classes. Inf. Process. Lett. 28(6): 291-295 (1988) |
| 7 | | 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) |
| 6 | | Juris Hartmanis, Lane A. Hemachandra: Complexity Classes without Machines: On Complete Languages for UP. Theor. Comput. Sci. 58: 129-142 (1988) |
| 1987 | ||
| 5 | | Lane A. Hemachandra: The Strong Exponential Hierarchy Collapses STOC 1987: 110-122 |
| 4 | | Abbas A. El Gamal, Lane A. Hemachandra, Itzhak Shperling, Victor K.-W. Wei: Using simulated annealing to design good codes. IEEE Transactions on Information Theory 33(1): 116-123 (1987) |
| 1986 | ||
| 3 | | Juris Hartmanis, Lane A. Hemachandra: Complexity Classes Without Machines: On Complete Languages for UP. ICALP 1986: 123-135 |
| 2 | | Juris Hartmanis, Lane A. Hemachandra: On Sparse Oracles Separating Feasible Complexity Classes. STACS 1986: 321-333 |
| 1 | | Jin-yi Cai, Lane A. Hemachandra: The Boolean Hierarchy: Hardware over NP. Structure in Complexity Theory Conference 1986: 105-124 |
Colors in the list of coauthors
Last update Thu May 31 18:55:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page