Alexander E. Andreev

2008
27	EE	Alexander E. Andreev, Stasys Jukna: Very large cliques are easy to detect. Discrete Mathematics 308(16): 3717-3721 (2008)
2006
26	EE	Alexander E. Andreev: The optimal sequence compression. Complexity of Boolean Functions 2006
25	EE	Alexander E. Andreev, Stasys Jukna: Very Large Cliques are Easy to Detect. Complexity of Boolean Functions 2006
2000
24	EE	Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim: Parallel Read Operations Without Memory Contention Electronic Colloquium on Computational Complexity (ECCC) 7(53): (2000)
1999
23	EE	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: 179-189
22	EE	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: 68-77
21		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): 2103-2116 (1999)
20	EE	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): 3-18 (1999)
1998
19	EE	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: A New General Derandomization Method. J. ACM 45(1): 179-213 (1998)
18	EE	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): 261-282 (1998)
1997
17		Alexander E. Andreev, Sergei Soloviev: A Deciding Algorithm for Linear Isomorphism of Types with Complexity O (n log2(n)). Category Theory and Computer Science 1997: 197-209
16	EE	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan: Weak Random Sources, Hitting Sets, and BPP Simulations. FOCS 1997: 264-272
15		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: 177-187
14		Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Efficient Construction of Hitting Sets for Systems of Linear Functions. STACS 1997: 387-398
13	EE	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan: Weak Random Sources, Hitting Sets, and BPP Simulations Electronic Colloquium on Computational Complexity (ECCC) 4(11): (1997)
12	EE	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 Electronic Colloquium on Computational Complexity (ECCC) 4(53): (1997)
11	EE	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): 243-268 (1997)
1996
10		Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Hitting Sets Derandomize BPP. ICALP 1996: 357-368
9		Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: On the Parallel Computation of Boolean Functions on Unrelated inputs. ISTCS 1996: 155-161
8		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: 319-330
7	EE	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Towards efficient constructions of hitting sets that derandomize BPP Electronic Colloquium on Computational Complexity (ECCC) 3(29): (1996)
6	EE	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Hitting Properties of Hard Boolean Operators and their Consequences on BPP Electronic Colloquium on Computational Complexity (ECCC) 3(55): (1996)
5	EE	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): 307-314 (1996)
1995
4		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: 132-141
3	EE	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Optimal Bounds for the Approximation of Boolean Functions and Some Applications Electronic Colloquium on Computational Complexity (ECCC) 2(41): (1995)
2	EE	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Hitting Sets Derandomize BPP Electronic Colloquium on Computational Complexity (ECCC) 2(61): (1995)
1987
1		Alexander E. Andreev: Effective Lower Bounds for Complexity of Some Classes of Schemes. FCT 1987: 24-29

Coauthor Index

1	Sergio De Agostino	[4] [18]
2	Juri L. Baskakov	[12] [23]
3	Andrea E. F. Clementi	[2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [18] [19] [20] [21] [22] [23] [24]
4	Pierluigi Crescenzi (Pilu Crescenzi)	[4] [18]
5	Elias Dahlhaus	[4] [18]
6	Stasys Jukna	[25] [27]
7	Paolo Penna	[22] [24]
8	José D. P. Rolim	[2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [18] [19] [20] [21] [22] [23] [24]
9	Sergei Soloviev	[17]
10	Luca Trevisan	[13] [16] [21]

Colors in the list of coauthors