1. Σ11 formulae on finite structures;Ajtai;Ann. Pure Appl. Logic,1984
2. A theorem on probabilistic constant depth computations;Ajtai,1984
3. Complexity classes in communication complexity;Babai,1986
4. Bounded-width, polynomial size branching programs recognize exactly those languages in NC1;Barrington,1986
5. Finite monoids and the fine structure of NC1;Barrington,1987