1. A note on a theorem of Razborov;Mix Barrington,1986
2. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1;Mix Barrington;J. Comput. System Sci.,1989
3. Representing Boolean functions as polynomials modulo composite numbers;Mix Barrington,1992
4. Superlinear lower bounds for bounded-width branching programs;Barrington;J. Comput. System Sci.,1991
5. Non uniform automata over groups;Barrington;Inform. and Comput.,1990