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
Mikael Goldmann, “A note on the power of majority gates and modular gates”, Information Processing Letters, 53:6 (1995), 321
Alexander A. Razborov, Feasible Mathematics II, 1995, 344
Mauricio Karchmer, Feasible Mathematics II, 1995, 245
A.C.-C. Yao, Proceedings 35th Annual Symposium on Foundations of Computer Science, 1994, 302
Lance Fortnow, Lecture Notes in Computer Science, 880, Foundation of Software Technology and Theoretical Computer Science, 1994, 256
M. Karchmer, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993, 112
Michael D. Plummer, “Matching theory—a sampler: from Dénes König to the present”, Discrete Mathematics, 100:1-3 (1992), 177
Mihalis Yannakakis, “Expressing combinatorial optimization problems by Linear Programs”, Journal of Computer and System Sciences, 43:3 (1991), 441
M. Grigni, M. Sipser, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference, 1991, 294