1. An O(nlogn) sorting network;Ajtai;Combinatorica,1983
2. The monotone circuit complexity of boolean functions;Alon;Combinatorica,1987
3. K. Amano, A. Maruoka, A superpolynomial lower bound for a circuit computing the clique function with (1/6)loglogn negation gates, Proceedings of the 23rd MFCS, Lecture Notes in Computer Science, Vol. 1450, Springer, Berlin, 1998, pp. 399–408.
4. On a method for obtaining lower bounds for the complexity of individual monotone functions;Andreev;Soviet Math. Dokl.,1985
5. On the complexity of negation-limited Boolean networks;Beals;SIAM J. Comput.,1998