1. Allender, E., P-uniform circuit complexity, Tech. Report, Department of Comp. Science, The Rutgers University, DCS-TR-198.
2. Alt, H., Eine untere Schranke fur den Platzbedarf bei der Analyse beschrankter kontextfreier Sprachen, Dissertation, Saarbrucken, (1976).
3. Alt, H., Lower bounds on space complexity for context-free recognition, Acta Informatica 12, (1979), pp. 33–61.
4. Barrington, D., Bounded-width polynomial-size branching programs recognize exactly those languages in NC1, Proc. 18th Annual Symp. on Theory of Computing (1986), pp. 1–5
5. Buss, S., Boolean formula-value problem is in ALOGTIME, Proc. of 19th Annual Symp. on Theory of Computing (1987), pp. 123–131.