Effective Lower Bounds for Complexity of Some Classes of Schemes. - Alexander E. Andreev (FCT, 1987)

Hitting Sets Derandomize BPP - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (Electron. Colloquium Comput. Complex., 1995)

On the Parallel Computation of Boolean Functions on Unrelated inputs. - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (ISTCS, 1996)

Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of Hardware. - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (STACS, 1996)

Towards efficient constructions of hitting sets that derandomize BPP - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (Electron. Colloquium Comput. Complex., 1996)

Hitting Properties of Hard Boolean Operators and their Consequences on BPP - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (Electron. Colloquium Comput. Complex., 1996)

Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS. - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (Theor. Comput. Sci., 1996)

A Deciding Algorithm for Linear Isomorphism of Types with Complexity O (n log2(n)). - Alexander E. Andreev; Sergei Soloviev 001 (Category Theory and Computer Science, 1997)

Efficient Construction of Hitting Sets for Systems of Linear Functions. - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (STACS, 1997)

Small Random Sets for Affine Spaces and Better Explicit Lower Bounds for Branching Programs - Alexander E. Andreev; Juri L. Baskakov; Andrea E. F. Clementi; José D. P. Rolim (Electron. Colloquium Comput. Complex., 1997)

Optimal Bounds for the Approximation of Boolean Functions and Some Applications. - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (Theor. Comput. Sci., 1997)

A New General Derandomization Method. - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (J. ACM, 1998)

The Parallel Complexity of Approximating the High Degree Subgraph Problem. - Alexander E. Andreev; Andrea E. F. Clementi; Pierluigi Crescenzi; Elias Dahlhaus; Sergio De Agostino; José D. P. Rolim (Theor. Comput. Sci., 1998)

Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs. - Alexander E. Andreev; Juri L. Baskakov; Andrea E. F. Clementi; José D. P. Rolim (ICALP, 1999)

Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines. - Alexander E. Andreev; Andrea E. F. Clementi; Paolo Penna; José D. P. Rolim (STACS, 1999)

Weak Random Sources, Hitting Sets, and BPP Simulations. - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim; Luca Trevisan 001 (SIAM J. Comput., 1999)

Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-offs. - Alexander E. Andreev; Andrea E. F. Clementi; José D. P. Rolim (Theor. Comput. Sci., 1999)

Parallel Read Operations Without Memory Contention - Alexander E. Andreev; Andrea E. F. Clementi; Paolo Penna; José D. P. Rolim (Electron. Colloquium Comput. Complex., 2000)

The optimal sequence compression. - Alexander E. Andreev (Complexity of Boolean Functions, 2006)

Very large cliques are easy to detect. - Alexander E. Andreev; Stasys Jukna (Discret. Math., 2008)