| 2009 | COCOON | Efficient Universal Quantum Circuits. | Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer |
| 2005 | FCT | Bounds on the Power of Constant-Depth Quantum Circuits. | Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang |
| 1996 | COCOON | Finding a Hidden Code by Asking Questions. | Zhixiang Chen, Carlos Cunha, Steven Homer |
| 1995 | COLT | On the Learnability of | Nader H. Bshouty, Zhixiang Chen, Scott E. Decatur, Steven Homer |
| 1995 | MFCS | Nonuniform Lower Bounds for Exponential Time Classes. | Steven Homer, Sarah Mocas |
| 1994 | COLT | On Learning Counting Functions with Queries. | Zhixiang Chen, Steven Homer |
| 1994 | FOCS | On Learning Discretized Geometric Concepts (Extended Abstract) | Nader H. Bshouty, Zhixiang Chen, Steven Homer |
| 1993 | STACS | On Using Oracles That Compute Values. | Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman |
| 1990 | STACS | A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time. | Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer |
| 1990 | STACS | Minimal Pairs and Complete Problems. | Klaus Ambos-Spies, Steven Homer, Robert I. Soare |
| 1989 | STACS | Complete Problems and Strong Polynomial Reducibilities. | K. Ganesan, Steven Homer |
| 1984 | FOCS | Minimal Degrees for Honest Polynomial Reducibilities | Steven Homer |