Alexander E. Andreev

According to our database1, Alexander E. Andreev authored at least 20 papers between 1987 and 2008.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2008
Very large cliques are easy to detect.
Discret. Math., 2008

2006
The optimal sequence compression.
Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006

2000
Parallel Read Operations Without Memory Contention
Electron. Colloquium Comput. Complex., 2000

1999
Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-offs.
Theor. Comput. Sci., 1999

Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines.
Proceedings of the STACS 99, 1999

Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs.
Proceedings of the Automata, 1999

1998
The Parallel Complexity of Approximating the High Degree Subgraph Problem.
Theor. Comput. Sci., 1998

A New General Derandomization Method.
J. ACM, 1998

1997
Optimal Bounds for the Approximation of Boolean Functions and Some Applications.
Theor. Comput. Sci., 1997

Small Random Sets for Affine Spaces and Better Explicit Lower Bounds for Branching Programs
Electron. Colloquium Comput. Complex., 1997

Weak Random Sources, Hitting Sets, and BPP Simulations
Electron. Colloquium Comput. Complex., 1997

Efficient Construction of Hitting Sets for Systems of Linear Functions.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

A Deciding Algorithm for Linear Isomorphism of Types with Complexity O (n log<sup>2</sup>(n)).
Proceedings of the Category Theory and Computer Science, 7th International Conference, 1997

1996
Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS.
Theor. Comput. Sci., 1996

Hitting Properties of Hard Boolean Operators and their Consequences on BPP
Electron. Colloquium Comput. Complex., 1996

Towards efficient constructions of hitting sets that derandomize BPP
Electron. Colloquium Comput. Complex., 1996

Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of Hardware.
Proceedings of the STACS 96, 1996

On the Parallel Computation of Boolean Functions on Unrelated inputs.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995
Hitting Sets Derandomize BPP
Electron. Colloquium Comput. Complex., 1995

1987
Effective Lower Bounds for Complexity of Some Classes of Schemes.
Proceedings of the Fundamentals of Computation Theory, 1987


  Loading...