Alexander E. Andreev

27 papers A* 4A 3B 2Journal 14Unranked 4

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