| 1999 | ICALP | 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 |
| 1999 | STACS | 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 |
| 1997 | FOCS | Weak Random Sources, Hitting Sets, and BPP Simulations. | Alexander E. Andreev, Andrea E. F. Clementi, Jos D. P. Rolim, Luca Trevisan |
| 1997 | ICALP | 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 |
| 1997 | STACS | Efficient Construction of Hitting Sets for Systems of Linear Functions. | Alexander E. Andreev, Andrea E. F. Clementi, Jos D. P. Rolim |
| 1996 | ICALP | Hitting Sets Derandomize BPP. | Alexander E. Andreev, Andrea E. F. Clementi, Jos D. P. Rolim |
| 1996 | STACS | 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 |
| 1995 | ISAAC | The Parallel Complexity of Approximating the High Degree Subgraph Problem. | Alexander E. Andreev, Andrea Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, Jos D. P. Rolim |
| 1987 | FCT | Effective Lower Bounds for Complexity of Some Classes of Schemes. | Alexander E. Andreev |