Alexander E. Andreev

Publication Activity (10 Years)

Years Active: 1987-2008
Publications (10 Years): 0

Publications

Alexander E. Andreev, Stasys Jukna
Very large cliques are easy to detect. Discret. Math. 308 (16) (2008)
Alexander E. Andreev, Stasys Jukna
Very Large Cliques are Easy to Detect. Complexity of Boolean Functions (2006)
Alexander E. Andreev
The optimal sequence compression. Complexity of Boolean Functions (2006)
Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim
Parallel Read Operations Without Memory Contention Electron. Colloquium Comput. Complex. 7 (53) (2000)
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-offs. Theor. Comput. Sci. 221 (1-2) (1999)
Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim
Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines. STACS (1999)
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan
Weak Random Sources, Hitting Sets, and BPP Simulations. SIAM J. Comput. 28 (6) (1999)
Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs. ICALP (1999)
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
A New General Derandomization Method. J. ACM 45 (1) (1998)
Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim
The Parallel Complexity of Approximating the High Degree Subgraph Problem. Theor. Comput. Sci. 205 (1-2) (1998)
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan
Weak Random Sources, Hitting Sets, and BPP Simulations Electron. Colloquium Comput. Complex. 4 (11) (1997)
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs. ICALP (1997)
Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim
Small Random Sets for Affine Spaces and Better Explicit Lower Bounds for Branching Programs Electron. Colloquium Comput. Complex. 4 (53) (1997)
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
Optimal Bounds for the Approximation of Boolean Functions and Some Applications. Theor. Comput. Sci. 180 (1-2) (1997)
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan
Weak Random Sources, Hitting Sets, and BPP Simulations. FOCS (1997)
Alexander E. Andreev, Sergei Soloviev
(n)). Category Theory and Computer Science (1997)
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
Efficient Construction of Hitting Sets for Systems of Linear Functions. STACS (1997)
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
On the Parallel Computation of Boolean Functions on Unrelated inputs. ISTCS (1996)
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
Hitting Sets Derandomize BPP. ICALP (1996)
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS. Theor. Comput. Sci. 161 (1&2) (1996)
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of Hardware. STACS (1996)
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
Hitting Properties of Hard Boolean Operators and their Consequences on BPP Electron. Colloquium Comput. Complex. 3 (55) (1996)
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
Towards efficient constructions of hitting sets that derandomize BPP Electron. Colloquium Comput. Complex. 3 (29) (1996)
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
Hitting Sets Derandomize BPP Electron. Colloquium Comput. Complex. 2 (61) (1995)
Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
Optimal Bounds for the Approximation of Boolean Functions and Some Applications Electron. Colloquium Comput. Complex. 2 (41) (1995)
Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim
The Parallel Complexity of Approximating the High Degree Subgraph Problem. ISAAC (1995)
Alexander E. Andreev
Effective Lower Bounds for Complexity of Some Classes of Schemes. FCT (1987)