A. E. Andreev
发表
Ippm Ras,
A. E. Andreev,
A. S. Rusakov,
2018
.
A. E. Andreev,
2006
.
A. E. Andreev,
V. V. Nemchinov,
1987
.
José D. P. Rolim,
Andrea E. F. Clementi,
Alexander E. Andreev,
1997,
Theoretical Computer Science.
A. E. Andreev,
1995
.
A. E. Andreev,
1987
.
V. B. Kudryavtsev,
A. E. Andreev,
2010
.
A. E. Andreev,
V. B. Kudryavtsev,
2010
.
José D. P. Rolim,
Andrea E. F. Clementi,
Alexander E. Andreev,
1997,
Electron. Colloquium Comput. Complex..
José D. P. Rolim,
Andrea E. F. Clementi,
Alexander E. Andreev,
1996,
ISTCS.
Algorithms are applied to two main objects: finite and infinite sets. In the first case, the circuit
A. E. Andreev,
V. B. Kudryavtsev,
2010
.
José D. P. Rolim,
Andrea E. F. Clementi,
Alexander E. Andreev,
1996,
Electron. Colloquium Comput. Complex..
Stasys Jukna,
Alexander E. Andreev,
A. E. Andreev,
2008,
Discret. Math..
A. E. Andreev,
S. Jukna,
2006
.
José D. P. Rolim,
Andrea E. F. Clementi,
Alexander E. Andreev,
1998,
JACM.
José D. P. Rolim,
Andrea E. F. Clementi,
Paolo Penna,
1999
.
José D. P. Rolim,
Andrea E. F. Clementi,
Paolo Penna,
1999,
STACS.
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs
José D. P. Rolim,
Andrea E. F. Clementi,
Alexander E. Andreev,
1999,
ICALP.
José D. P. Rolim,
Luca Trevisan,
Andrea E. F. Clementi,
1997,
Proceedings 38th Annual Symposium on Foundations of Computer Science.
José D. P. Rolim,
Andrea E. F. Clementi,
Alexander E. Andreev,
1997,
Theor. Comput. Sci..
José D. P. Rolim,
Andrea E. F. Clementi,
Alexander E. Andreev,
1996,
ICALP.
José D. P. Rolim,
Andrea E. F. Clementi,
Alexander E. Andreev,
1996,
STACS.
A. E. Andreev,
P. Drobintsev,
A. Drobintseva,
2020,
Proceedings of the Institute for System Programming of the RAS.