1. M. Ajtai, Σ 1 1 formulae on finite structures, Annals of Pure and Applied Logic24 (1983), pp. 1–48.
2. D.A. Barrington, Bounded-width polynomial-size branching programs recognize exactly those languages in NC1, Proc. of the 18th ACM Symp. on the Theory of Computing (1986), pp. 1–5.
3. D. Mix Barrington, K. Compton, H. Straubing and D. Thérien, Regular languages in NC1, Boston College Technical Report TR-BCCS-88-02, 1988.
4. D. Mix Barrington, N. Immerman and H. Straubing, On uniformity within NC1, Proc. of the 3rd Annual Conf. on the Structure in Complexity Theory, IEEE Computer Society Press (1988), pp. 47–59.
5. D.A. Barrington, H. Straubing and D. Thérien, unpublished manuscript, 1988.