1. On a method of obtaining lower bounds to the complexity of individual monotone functions;Andreev;Dokl. Akad. Nauk SSSR,1985
2. A method of obtaining superquadratic lower bounds on the complexity of Π-schemes;Andreev;Vestnik. Moscow Unǎ. Ser. I Mat. Mech.,1986
3. The monotone circuit complexity of Boolean functions;Alon;J. Combinatorika,1987
4. Two lower bounds for branching programs;Ajtai,1986
5. Bounded width-polynomial size branching programs recognize exactly those languages in NC1;Barrington,1986