Evgeny Demenkov

According to our database, Evgeny Demenkov authored at least 5 papers between 2010 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2015

New Lower Bounds on Circuit Size of Multi-output Functions.

Evgeny Demenkov, Alexander S. Kulikov, Olga Melanich, Ivan Mihajlin

Theory Comput. Syst., 2015

2012

Computing All MOD-Functions Simultaneously.

Evgeny Demenkov, Alexander S. Kulikov, Ivan Mihajlin, Hiroki Morizumi

Proceedings of the Computer Science - Theory and Applications, 2012

A Lower Bound on Circuit Complexity of Vector Function in U 2.

Evgeny Demenkov

Proceedings of the Computer Science - Theory and Applications, 2012

2011

An Elementary Proof of a 3n - o(n) Lower Bound on the Circuit Complexity of Affine Dispersers.

Evgeny Demenkov, Alexander S. Kulikov

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2010

New upper bounds on the Boolean circuit complexity of symmetric functions.

Evgeny Demenkov, Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev

Inf. Process. Lett., 2010