Lane A. Hemachandra - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 65 from 65

1993

Using Inductive Counting to Simulate Nondeterministic ComputationGerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes. iandc, 102(1):102-117, January 1993.

On Checking Versus Evaluation of Multiple QueriesWilliam I. Gasarch, Lane A. Hemachandra, Albrecht Hoene. iandc, 105(1):72-93, July 1993.

Defying Upward and Downward SeparationLane A. Hemachandra, Sudhir K. Jha. STACS 1993: 185-195

Easity Checked Self-Reducibility (Extended Abstract)Lane A. Hemachandra, Riccardo Silvestri. fct 1993: 289-298

Collapsing Degrees via Strong ComputationLane A. Hemachandra, Albrecht Hoene. jcss, 46(3):363-380, 1993.

Fault-Tolerance and Complexity (Extended Abstract)Lane A. Hemachandra. icalp 1993: 189-202

Is #P Closed Under Subtraction?Lane A. Hemachandra, Mitsunori Ogiwara. In Grzegorz Rozenberg, Arto Salomaa, editors, Current Trends in Theoretical Computer Science - Essays and Tutorials. Volume 40 of World Scientific Series in Computer Science, pages 523-536, World Scientific, 1993. [doi]

SelectivityLane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang. icci 1993: 55-59

A Complexity Theory for Feasible Closure PropertiesMitsunori Ogiwara, Lane A. Hemachandra. jcss, 46(3):295-325, 1993.

1992

Relating Equivalence and Reducibility to Sparse SetsEric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe. SICOMP, 21(3):521-539, 1992.

Lower Bounds for the Low HierarchyEric Allender, Lane A. Hemachandra. JACM, 39(1):234-251, 1992. [doi]

Reductions to Sets of Low Information ContentVikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf. Dagstuhl 1993: 1-46

Promise Problems and Access to Unambiguous ComputationJin-yi Cai, Lane A. Hemachandra, Jozef Vyskoc. mfcs 1992: 162-171

Promise Problems and Guarded Access to Unambiguous ComputationJin-yi Cai, Lane A. Hemachandra, Jozef Vyskoc. Dagstuhl 1993: 101-146

Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity ClassesDavid Eppstein, Lane A. Hemachandra, James Tisdall, Bülent Yener. mst, 25(1):23-36, 1992.

Polynomial-Time CompressionJudy Goldsmith, Lane A. Hemachandra, Kenneth Kunen. cc, 2:18-39, 1992.

How Hard Are Sparse Sets?Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe. coco 1992: 222-238

Is #P Closed under Substraction?Lane A. Hemachandra, Mitsunori Ogiwara. eatcs, 46:107-123, 1992.

Separating Complexity Classes With Tally OraclesLane A. Hemachandra, Roy S. Rubinstein. TCS, 92(2):309-318, 1992.

Banishing Robust Turing CompletenessLane A. Hemachandra, Sanjay Jain, Nikolai K. Vereshchagin. lfcs 1992: 186-197

1991

Relating Equivalence and Reducibility to Sparse SetsEric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe. cocoon 1991: 220-229

Probabilistic Polynomial Time is Closed under Parity ReductionsRichard Beigel, Lane A. Hemachandra, Gerd Wechsung. ipl, 37(2):91-94, 1991.

A Note on Enumarative CountingJin-yi Cai, Lane A. Hemachandra. ipl, 38(4):215-219, 1991.

On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash FunctionsJudy Goldsmith, Lane A. Hemachandra, Kenneth Kunen. fsttcs 1991: 212-223

Near-Testable SetsJudy Goldsmith, Lane A. Hemachandra, Deborah Joseph, Paul Young. SICOMP, 20(3):506-523, 1991.

One-Way Functions and the Nonisomorphism of NP-Complete SetsJuris Hartmanis, Lane A. Hemachandra. TCS, 81(1):155-163, 1991.

On Sets with Efficient Implicit Membership TestsLane A. Hemachandra, Albrecht Hoene. SICOMP, 20(6):1148-1156, 1991.

Kolmogorov Characterizations of Complexity ClassesLane A. Hemachandra, Gerd Wechsung. TCS, 83(2):313-322, 1991.

Collapsing Degrees via Strong Computation (Extended Abstract)Lane A. Hemachandra, Albrecht Hoene. icalp 1991: 393-404

On the Limitations of Locally Robust Positive ReductionsLane A. Hemachandra, Sanjay Jain. ijfcs, 2(3):237-255, 1991.

On Sets Polynomially Enumerable by IterationLane A. Hemachandra, Albrecht Hoene, Dirk Siefkes, Paul Young. TCS, 80(2):203-225, 1991.

On the Complexity of Graph ReconstructionDieter Kratsch, Lane A. Hemachandra. fct 1991: 318-328

A Complexity Theory for Feasible Closure PropertiesMitsunori Ogiwara, Lane A. Hemachandra. cocoon 1991: 16-29

1990

Using Inductive Counting to Simulate Nondeterministic ComputationGerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes. mfcs 1990: 187-194

On the Power of Parity Polynomial TimeJin-yi Cai, Lane A. Hemachandra. mst, 23(2):95-106, 1990.

On Checking Versus Evaluation of Multiple QueriesWilliam I. Gasarch, Lane A. Hemachandra, Albrecht Hoene. mfcs 1990: 261-268

Robust Machines Accept Easy SetsJuris Hartmanis, Lane A. Hemachandra. TCS, 74(2):217-225, 1990.

On the Complexity of RankingLane A. Hemachandra, Steven Rudich. jcss, 41(2):251-271, 1990.

On Sets with Efficient Implicit Membership TestsLane A. Hemachandra, Albrecht Hoene. cocoon 1990: 11-19

Algorithms from Complexity Theory: Polynominal-Time Operations for Complex SetsLane A. Hemachandra. sigal 1990: 221-231

A Note on Relativizing Complexity Classes with Tally OraclesLane A. Hemachandra, Roy S. Rubinstein. cocoon 1990: 287-294

1989

Lower Bounds for the Low Hierarchy (Extended Abstract)Eric Allender, Lane A. Hemachandra. icalp 1989: 31-45

On the Power of Probabilistic Polynomial Time: P:::NP[log]::: subseteq PPRichard Beigel, Lane A. Hemachandra, Gerd Wechsung. cocoon 1989: 225-227

On the Power of Parity Polynomial TimeJin-yi Cai, Lane A. Hemachandra. STACS 1989: 229-239

Enumerative Counting Is HardJin-yi Cai, Lane A. Hemachandra. iandc, 82(1):34-44, July 1989.

The Boolean Hierarchy II: ApplicationsJin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung. SICOMP, 18(1):95-111, 1989.

Polynomial-Time Functions Generate SAT: On P-SplintersLane A. Hemachandra, Albrecht Hoene, Dirk Siefkes. mfcs 1989: 259-269

Using Randomness to Characterize the Complexity of ComputationLane A. Hemachandra, Gerd Wechsung. ifip 1989: 281-286

The Strong Exponential Hierarchy CollapsesLane A. Hemachandra. jcss, 39(3):299-322, 1989.

On the Limitations of Locally Robust Positive ReductionsLane A. Hemachandra, Sanjay Jain. fsttcs 1989: 193-203

1988

1987

Using simulated annealing to design good codesAbbas A. El Gamal, Lane A. Hemachandra, Itzhak Shperling, Victor K.-W. Wei. TIT, 33(1):116-123, 1987.

One-way functions, robustness, and the non-isomorphism of NP-complete setsJuris Hartmanis, Lane A. Hemachandra. coco 1987: 160-174

The Strong Exponential Hierarchy CollapsesLane A. Hemachandra. stoc 1987: 110-122

On rankingLane A. Hemachandra. coco 1987: 103-117

The strong exponential hierarchy collapsesLane A. Hemachandra. coco 1987: 191

1986

The Boolean Hierarchy: Hardware over NPJin-yi Cai, Lane A. Hemachandra. cocoon 1986: 105-124

Complexity Classes Without Machines: On Complete Languages for UPJuris Hartmanis, Lane A. Hemachandra. icalp 1986: 123-135

On Sparse Oracles Separating Feasible Complexity ClassesJuris Hartmanis, Lane A. Hemachandra. STACS 1986: 321-333

All Publications

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Lane A. Hemachandra'

Viewing Publication 1 - 65 from 65

1993

1992

1991

1990

1989

1988

1987

1986

All Publications

Filter by YearOR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by TagOR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Lane A. Hemachandra'

Viewing Publication 1 - 65 from 65

1993

1992

1991

1990

1989

1988

1987

1986

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1