Hervé Caussinus, “A note on a theorem of Barrington, Straubing and Thérien”, Information Processing Letters, 58:1 (1996), 31
Jehoshua Bruck, “Reflections on ?Representations of sets of Boolean functions by commutative rings? by Roman Smolensky”, Comput Complexity, 6:3 (1996), 209
Richard Beigel, Alexis Maciel, “Upper and lower bounds for some depth-3 circuit classes”, Comput Complexity, 6:3 (1996), 235
Iain A. Stewart, Collegium Logicum, 2, Collegium Logicum, 1996, 101
E. N. Mayoraz, “On the Power of Democratic Networks”, SIAM J. Discrete Math., 9:2 (1996), 258
Eric Allender, Lecture Notes in Computer Science, 1090, Computing and Combinatorics, 1996, 127
A. A. Razborov, “Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic”, Изв. РАН. Сер. матем., 59:1 (1995), 201–224 ; Izv. Math., 59:1 (1995), 205–227
G. Tardos, D.A.M. Barrington, Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995, 52
J. H�stad, S. Jukna, P. Pudl�k, “Top-down lower bounds for depth-three circuits”, Comput Complexity, 5:2 (1995), 99
Meera Sitharam, “Evaluating spectral norms for constant depth circuits with symmetric gates”, Comput Complexity, 5:2 (1995), 167