New upper bounds on the Boolean circuit complexity of symmetric functions. - Evgeny Demenkov; Arist Kojevnikov; Alexander S. Kulikov; Grigory Yaroslavtsev (Inf. Process. Lett., 2010)

An Elementary Proof of 3n-o(n) Lower Bound on the Circuit Complexity of Affine Dispersers. - Evgeny Demenkov; Alexander S. Kulikov (Electron. Colloquium Comput. Complex., 2011)

A Lower Bound on Circuit Complexity of Vector Function in U 2. - Evgeny Demenkov (CSR, 2012)

Computing All MOD-Functions Simultaneously. - Evgeny Demenkov; Alexander S. Kulikov; Ivan Mihajlin; Hiroki Morizumi (CSR, 2012)

New Lower Bounds on Circuit Size of Multi-output Functions. - Evgeny Demenkov; Alexander S. Kulikov; Olga Melanich; Ivan Mihajlin (Theory Comput. Syst., 2015)