1. Barrington, D.A.M., Immerman, N., Straubing, H.: On uniformity within NC1. J. Comput. Syst. Sci. 41, 274–306 (1990)
2. Lecture Notes in Computer Science;A. Krebs,2005
3. Behle, C., Lange, K.J.: FO[<]-uniformity. In: IEEE Conference on Computational Complexity, pp. 183–189 (2006)
4. Koucký, M., Lautemann, C., Poloczek, S., Thérien, D.: Circuit lower bounds via Ehrenfeucht-Fraisse games. In: IEEE Conference on Computational Complexity, pp. 190–201 (2006)
5. Thérien, D., Wilke, T.: Over words, two variables are as powerful as one quantifier alternation. In: STOC, pp. 234–240 (1998)