| 2001 | LICS | The Crane Beach Conjecture. | David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thrien |
| 2000 | MFCS | Equation Satisfiability and Program Satisfiability for Finite Monoids. | David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thrien |
| 1999 | ICALP | Bounded Depth Arithmetic Circuits: Counting and Closure. | Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh |
| 1998 | MFCS | On Counting AC | Andris Ambainis, David A. Mix Barrington, Huong LeThanh |
| 1998 | STACS | Searching Constant Width Mazes Captures the AC | David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum |
| 1995 | LATIN | Lower Bounds for Modular Counting by Circuits with Modular Gates. | David A. Mix Barrington, Howard Straubing |
| 1993 | STACS | Computing Symmetric Functions with AND/OR Circuits and a Single MAJORITY Gate. | Zhi-Li Zhang, David A. Mix Barrington, Jun Tarui |
| 1992 | LATIN | Complex Polynomials and Circuit Lower Bounds for Modular Counting. | David A. Mix Barrington, Howard Straubing |
| 1992 | STOC | Representing Boolean Functions as Polynomials Modulo Composite Numbers (Extended Abstract) | David A. Mix Barrington, Richard Beigel, Steven Rudich |
| 1989 | MFCS | Oracle Branching Programs and Logspace versus P. | David A. Mix Barrington, Pierre McKenzie |
| 1987 | ICALP | Non-Uniform Automata Over Groups. | David A. Mix Barrington, Denis Thrien |
| 1987 | STOC | Finite Monoids and the Fine Structure of NC¹ | David A. Mix Barrington, Denis Thrien |
| 1986 | STOC | Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹ | David A. Mix Barrington |