The depth of Boolean functions realized by circuits over an arbitrary basis

O. B. Lupanov, “Circuits of Functional Elements with Delay,” in Problemy Kibernetiki (Nauka, Moscow, 1970), Vol. 23, pp. 43–81.

J. E. Savage, The Complexity of Computing (Faktorial, Moscow, 1998; Wiley, 1976).

S. A. Lozhkin, “Asymptotic Behavior of Shannon Functions for the Delays of Schemes of Functional Elements,” Matem. Zametki 19(6), 939–951 (1976) [Math. Notes 19 (6), 548–555 (1976)].

O. M. Kasim-Zade, “Common Upper Complexity Estimate of Circuits in an Arbitrary Infinite Complete Basis,” Vestn. Mosk. Univ., Matem. Mekhan., No. 4, 59–61 (1997)

R. Smolensky, “Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity,” in Proc. 19th Annual ACM Symp. Theory Comput. (ACM Press, 1987), pp. 77–82.

J. Nešetřil, “Some Nonstandard Ramsey-Like Applications,” Theor. Comput. Sci. 34(1–2), 3–15 (1984).