| 2014 | STACS | Non-autoreducible Sets for NEXP. | Dung T. Nguyen, Alan L. Selman |
| 2013 | ICALP | Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions. | Christian Glaer, Dung T. Nguyen, Christian Reitwiener, Alan L. Selman, Maximilian Witek |
| 2012 | ICALP | A Thirty Year Old Conjecture about Promise Problems. | Andrew Hughes, Aduri Pavan, Nathan Russell, Alan L. Selman |
| 2007 | COCOON | The Informational Content of Canonical Disjoint NP-Pairs. | Christian Glaer, Alan L. Selman, Liyu Zhang |
| 2007 | STACS | The Complexity of Unions of Disjoint Sets. | Christian Glaer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner |
| 2006 | STACS | Redundancy in Complete Sets. | Christian Glaer, Aduri Pavan, Alan L. Selman, Liyu Zhang |
| 2006 | TAMC | Mitosis in Computational Complexity. | Christian Glaer, Aduri Pavan, Alan L. Selman, Liyu Zhang |
| 2005 | MFCS | Autoreducibility, Mitoticity, and Immunity. | Christian Glaer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang |
| 2005 | MFCS | Canonical Disjoint NP-Pairs of Propositional Proof Systems. | Christian Glaer, Alan L. Selman, Liyu Zhang |
| 2002 | STACS | Bi-Immunity Separates Strong NP-Completeness Notions. | Aduri Pavan, Alan L. Selman |
| 1999 | COCOON | Distributionally-Hard Languages. | Lance Fortnow, Aduri Pavan, Alan L. Selman |
| 1996 | STACS | Fine Separation of Average Time Complexity Classes. | Jin-yi Cai, Alan L. Selman |
| 1994 | ISAAC | Computing Solutions Uniquely collapses the Polynomial Hierarchy. | Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman |
| 1993 | ICCI | Selectivity. | Lane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang |
| 1993 | STACS | On Using Oracles That Compute Values. | Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman |
| 1990 | MFCS | One-Way Functions in Complexity Theory. | Alan L. Selman |
| 1990 | STACS | Hard Promise Problems and Nonuniform Complexity. | Luc Longpr, Alan L. Selman |
| 1987 | STACS | A Hierarchy Theorem for Almost Everywhere Complex Sets With Application to Polynomial Complexity Degrees. | John G. Geske, Dung T. Huynh, Alan L. Selman |
| 1984 | FOCS | Sparse Oracles and Uniform Complexity Classes | Jos L. Balczar, Ronald V. Book, Timothy J. Long, Uwe Schning, Alan L. Selman |
| 1984 | FOCS | Complexity Measures for Public-Key Cryptosystems (Preliminary Report) | Joachim Grollmann, Alan L. Selman |
| 1982 | ICALP | The Complexity of Promise Problems. | Alan L. Selman, Yacov Yacobi |
| 1979 | ICALP | P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP. | Alan L. Selman |
| 1976 | FOCS | A Second Step toward the Polynomial Hierarchy | Theodore P. Baker, Alan L. Selman |
| 1974 | STOC | Comparisons of Polynomial-Time Reducibilities | Richard E. Ladner, Nancy A. Lynch, Alan L. Selman |
| 1972 | STOC | Turing Machines and the Spectra of First-Order Formulas with Equality | Neil D. Jones, Alan L. Selman |