The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lane A. Hemachandra: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Richard Beigel, Lane A. Hemachandra, Gerd Wechsung
    On the Power of Probabilistic Polynomial Time: PNP[log] subseteq PP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:225-227 [Conf]
  2. Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
    Relating Equivalence and Reducibility to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:220-229 [Conf]
  3. Jin-yi Cai, Lane A. Hemachandra
    The Boolean Hierarchy: Hardware over NP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:105-124 [Conf]
  4. Lane A. Hemachandra, Albrecht Hoene
    On Sets with Efficient Implicit Membership Tests. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:11-19 [Conf]
  5. Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
    How Hard Are Sparse Sets? [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:222-238 [Conf]
  6. Lane A. Hemachandra, Roy S. Rubinstein
    A Note on Relativizing Complexity Classes with Tally Oracles. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:287-294 [Conf]
  7. Mitsunori Ogiwara, Lane A. Hemachandra
    A Complexity Theory for Feasible Closure Properties. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:16-29 [Conf]
  8. Martín Abadi, Eric Allender, Andrei Z. Broder, Joan Feigenbaum, Lane A. Hemachandra
    On Generating Solved Instances of Computational Problems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1988, pp:297-310 [Conf]
  9. 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. [Citation Graph (0, 0)][DBLP]
    Complexity Theory: Current Research, 1992, pp:1-46 [Conf]
  10. Jin-yi Cai, Lane A. Hemachandra, Jozef Vyskoc
    Promise Problems and Guarded Access to Unambiguous Computation. [Citation Graph (0, 0)][DBLP]
    Complexity Theory: Current Research, 1992, pp:101-146 [Conf]
  11. Lane A. Hemachandra, Riccardo Silvestri
    Easity Checked Self-Reducibility (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1993, pp:289-298 [Conf]
  12. Dieter Kratsch, Lane A. Hemachandra
    On the Complexity of Graph Reconstruction. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:318-328 [Conf]
  13. Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen
    On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:212-223 [Conf]
  14. Lane A. Hemachandra, Sanjay Jain
    On the Limitations of Locally Robust Positive Reductions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1989, pp:193-203 [Conf]
  15. Eric Allender, Lane A. Hemachandra
    Lower Bounds for the Low Hierarchy (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:31-45 [Conf]
  16. 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. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:162-173 [Conf]
  17. Juris Hartmanis, Lane A. Hemachandra
    Complexity Classes Without Machines: On Complete Languages for UP. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:123-135 [Conf]
  18. Lane A. Hemachandra
    Fault-Tolerance and Complexity (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:189-202 [Conf]
  19. Lane A. Hemachandra, Albrecht Hoene
    Collapsing Degrees via Strong Computation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:393-404 [Conf]
  20. Lane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang
    Selectivity. [Citation Graph (0, 0)][DBLP]
    ICCI, 1993, pp:55-59 [Conf]
  21. Lane A. Hemachandra, Gerd Wechsung
    Using Randomness to Characterize the Complexity of Computation. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1989, pp:281-286 [Conf]
  22. Lane A. Hemachandra, Sanjay Jain, Nikolai K. Vereshchagin
    Banishing Robust Turing Completeness. [Citation Graph (0, 0)][DBLP]
    LFCS, 1992, pp:186-197 [Conf]
  23. Gerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes
    Using Inductive Counting to Simulate Nondeterministic Computation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:187-194 [Conf]
  24. Jin-yi Cai, Lane A. Hemachandra, Jozef Vyskoc
    Promise Problems and Access to Unambiguous Computation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:162-171 [Conf]
  25. William I. Gasarch, Lane A. Hemachandra, Albrecht Hoene
    On Checking Versus Evaluation of Multiple Queries. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:261-268 [Conf]
  26. Lane A. Hemachandra
    Structure of Complexity Classes: Separations, Collapses, and Completeness. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:59-72 [Conf]
  27. Lane A. Hemachandra, Albrecht Hoene, Dirk Siefkes
    Polynomial-Time Functions Generate SAT: On P-Splinters. [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:259-269 [Conf]
  28. Lane A. Hemachandra
    Algorithms from Complexity Theory: Polynominal-Time Operations for Complex Sets. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:221-231 [Conf]
  29. Jin-yi Cai, Lane A. Hemachandra
    On the Power of Parity Polynomial Time. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:229-239 [Conf]
  30. Juris Hartmanis, Lane A. Hemachandra
    On Sparse Oracles Separating Feasible Complexity Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:321-333 [Conf]
  31. Lane A. Hemachandra, Sudhir K. Jha
    Defying Upward and Downward Separation. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:185-195 [Conf]
  32. Lane A. Hemachandra
    The Strong Exponential Hierarchy Collapses [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:110-122 [Conf]
  33. Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen
    Polynomial-Time Compression. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:18-39 [Journal]
  34. Lane A. Hemachandra, Mitsunori Ogiwara
    Is #P Closed under Substraction? [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1992, v:46, n:, pp:107-123 [Journal]
  35. Jin-yi Cai, Lane A. Hemachandra
    Enumerative Counting Is Hard [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:82, n:1, pp:34-44 [Journal]
  36. Gerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes
    Using Inductive Counting to Simulate Nondeterministic Computation [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:102, n:1, pp:102-117 [Journal]
  37. William I. Gasarch, Lane A. Hemachandra, Albrecht Hoene
    On Checking Versus Evaluation of Multiple Queries [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:105, n:1, pp:72-93 [Journal]
  38. Lane A. Hemachandra, Sanjay Jain
    On the Limitations of Locally Robust Positive Reductions. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1991, v:2, n:3, pp:237-255 [Journal]
  39. Richard Beigel, Lane A. Hemachandra, Gerd Wechsung
    Probabilistic Polynomial Time is Closed under Parity Reductions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:2, pp:91-94 [Journal]
  40. Jin-yi Cai, Lane A. Hemachandra
    A Note on Enumarative Counting. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:38, n:4, pp:215-219 [Journal]
  41. Juris Hartmanis, Lane A. Hemachandra
    On Sparse Oracles Separating Feasible Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:28, n:6, pp:291-295 [Journal]
  42. Eric Allender, Lane A. Hemachandra
    Lower Bounds for the Low Hierarchy. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:1, pp:234-251 [Journal]
  43. Lane A. Hemachandra
    The Strong Exponential Hierarchy Collapses. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:39, n:3, pp:299-322 [Journal]
  44. Lane A. Hemachandra, Albrecht Hoene
    Collapsing Degrees via Strong Computation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:46, n:3, pp:363-380 [Journal]
  45. Lane A. Hemachandra, Steven Rudich
    On the Complexity of Ranking. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1990, v:41, n:2, pp:251-271 [Journal]
  46. Mitsunori Ogiwara, Lane A. Hemachandra
    A Complexity Theory for Feasible Closure Properties. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:46, n:3, pp:295-325 [Journal]
  47. Jin-yi Cai, Lane A. Hemachandra
    On the Power of Parity Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1990, v:23, n:2, pp:95-106 [Journal]
  48. David Eppstein, Lane A. Hemachandra, James Tisdall, Bülent Yener
    Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1992, v:25, n:1, pp:23-36 [Journal]
  49. Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
    Relating Equivalence and Reducibility to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:3, pp:521-539 [Journal]
  50. Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung
    The Boolean Hierarchy I: Structural Properties. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:6, pp:1232-1252 [Journal]
  51. Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung
    The Boolean Hierarchy II: Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:1, pp:95-111 [Journal]
  52. Judy Goldsmith, Lane A. Hemachandra, Deborah Joseph, Paul Young
    Near-Testable Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:506-523 [Journal]
  53. Lane A. Hemachandra, Albrecht Hoene
    On Sets with Efficient Implicit Membership Tests. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:6, pp:1148-1156 [Journal]
  54. Juris Hartmanis, Lane A. Hemachandra
    Complexity Classes without Machines: On Complete Languages for UP. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:58, n:, pp:129-142 [Journal]
  55. Juris Hartmanis, Lane A. Hemachandra
    Robust Machines Accept Easy Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:74, n:2, pp:217-225 [Journal]
  56. Juris Hartmanis, Lane A. Hemachandra
    One-Way Functions and the Nonisomorphism of NP-Complete Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:1, pp:155-163 [Journal]
  57. Lane A. Hemachandra, Albrecht Hoene, Dirk Siefkes, Paul Young
    On Sets Polynomially Enumerable by Iteration. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:80, n:2, pp:203-225 [Journal]
  58. Lane A. Hemachandra, Roy S. Rubinstein
    Separating Complexity Classes With Tally Oracles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:92, n:2, pp:309-318 [Journal]
  59. Lane A. Hemachandra, Gerd Wechsung
    Kolmogorov Characterizations of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:83, n:2, pp:313-322 [Journal]
  60. Abbas A. El Gamal, Lane A. Hemachandra, Itzhak Shperling, Victor K.-W. Wei
    Using simulated annealing to design good codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1987, v:33, n:1, pp:116-123 [Journal]

Search in 0.110secs, Finished in 0.112secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002