Andrei A. Voronenko

According to our database, Andrei A. Voronenko authored at least 5 papers between 2000 and 2014.

Collaborative distances:

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

2014

Certificates of Non-Membership for Classes of Read-Once Functions.

Dmitry Chistikov, Valentina Fedorova, Andrey A. Voronenko

Fundam. Informaticae, 2014

2011

An Upper Bound on Checking Test Complexity for Almost All Cographs.

Oleg V. Zubkov, Dmitry V. Chistikov, Andrey A. Voronenko

Proceedings of the 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2011

2010

Learning Read-Once Functions Using Subcube Identity Queries

Dmitry V. Chistikov, Andrey A. Voronenko

CoRR, 2010

2009

New Learning and Testing Problems for Read-Once Functions

Andrei A. Voronenko

CoRR, 2009

2000

On the Complexity of the Monotonicity Verification.

Andrei A. Voronenko

Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000