| 1993 | FCT | Easity Checked Self-Reducibility (Extended Abstract). | Lane A. Hemachandra, Riccardo Silvestri |
| 1993 | ICALP | Fault-Tolerance and Complexity (Extended Abstract). | Lane A. Hemachandra |
| 1993 | ICCI | Selectivity. | Lane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang |
| 1993 | STACS | Defying Upward and Downward Separation. | Lane A. Hemachandra, Sudhir K. Jha |
| 1992 | ICALP | Reductions to Sets of Low Information Content. | Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Kbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schning, Riccardo Silvestri, Thomas Thierauf |
| 1992 | LFCS | Banishing Robust Turing Completeness. | Lane A. Hemachandra, Sanjay Jain, Nikolai K. Vereshchagin |
| 1992 | MFCS | Promise Problems and Access to Unambiguous Computation. | Jin-yi Cai, Lane A. Hemachandra, Jozef Vyskoc |
| 1991 | FCT | On the Complexity of Graph Reconstruction. | Dieter Kratsch, Lane A. Hemachandra |
| 1991 | ICALP | Collapsing Degrees via Strong Computation (Extended Abstract). | Lane A. Hemachandra, Albrecht Hoene |
| 1990 | MFCS | Using Inductive Counting to Simulate Nondeterministic Computation. | Gerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes |
| 1990 | MFCS | On Checking Versus Evaluation of Multiple Queries. | William I. Gasarch, Lane A. Hemachandra, Albrecht Hoene |
| 1989 | ICALP | Lower Bounds for the Low Hierarchy (Extended Abstract). | Eric Allender, Lane A. Hemachandra |
| 1989 | MFCS | Polynomial-Time Functions Generate SAT: On P-Splinters. | Lane A. Hemachandra, Albrecht Hoene, Dirk Siefkes |
| 1989 | STACS | On the Power of Parity Polynomial Time. | Jin-yi Cai, Lane A. Hemachandra |
| 1988 | CRYPTO | On Generating Solved Instances of Computational Problems. | Martn Abadi, Eric Allender, Andrei Z. Broder, Joan Feigenbaum, Lane A. Hemachandra |
| 1988 | MFCS | Structure of Complexity Classes: Separations, Collapses, and Completeness. | Lane A. Hemachandra |
| 1987 | STOC | The Strong Exponential Hierarchy Collapses | Lane A. Hemachandra |
| 1986 | ICALP | Complexity Classes Without Machines: On Complete Languages for UP. | Juris Hartmanis, Lane A. Hemachandra |
| 1986 | STACS | On Sparse Oracles Separating Feasible Complexity Classes. | Juris Hartmanis, Lane A. Hemachandra |