( en | de | ru )

 

Disambiguation of "Andreev, Alexander E."

Author of the publication

copydeleteadd this publication to your clipboard
Towards efficient constructions of hitting sets that derandomize BPP

, , and . Electron. Colloquium Comput. Complex., (1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alexander Andreev

Tchavdar Andreev

Ivan Andreev

Andrey Andreev

Petko Andreev

 

Other publications of authors with the same name

Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs., , and . ICALP, volume 1256 of Lecture Notes in Computer Science, page 177-187. Springer, (1997)Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs., , , and . ICALP, volume 1644 of Lecture Notes in Computer Science, page 179-189. Springer, (1999)Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines., , , and . STACS, volume 1563 of Lecture Notes in Computer Science, page 68-77. Springer, (1999)Effective Lower Bounds for Complexity of Some Classes of Schemes.. FCT, volume 278 of Lecture Notes in Computer Science, page 24-29. Springer, (1987)Optimal Bounds for the Approximation of Boolean Functions and Some Applications., , and . Theor. Comput. Sci., 180 (1-2): 243-268 (1997)Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-offs., , and . Theor. Comput. Sci., 221 (1-2): 3-18 (1999)Parallel Read Operations Without Memory Contention, , , and . Electron. Colloquium Comput. Complex., (2000)Hitting Properties of Hard Boolean Operators and their Consequences on BPP, , and . Electron. Colloquium Comput. Complex., (1996)The Parallel Complexity of Approximating the High Degree Subgraph Problem., , , , , and . ISAAC, volume 1004 of Lecture Notes in Computer Science, page 132-141. Springer, (1995)Weak Random Sources, Hitting Sets, and BPP Simulations., , , and . SIAM J. Comput., 28 (6): 2103-2116 (1999)