Alexander E. Andreev

Stasys Jukna

Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006

The optimal sequence compression.

[BibT_eX]

[DOI]

Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006

2000

Parallel Read Operations Without Memory Contention

[BibT_eX]

[DOI]

Paolo Penna

Electron. Colloquium Comput. Complex., 2000

1999

Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines.

[BibT_eX]

[DOI]

Paolo Penna

Proceedings of the STACS 99, 1999

Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs.

[BibT_eX]

[DOI]

Juri L. Baskakov

Proceedings of the Automata, 1999

1998

A New General Derandomization Method.

[BibT_eX]

[DOI]

J. ACM, 1998

1997

Small Random Sets for Affine Spaces and Better Explicit Lower Bounds for Branching Programs

[BibT_eX]

[DOI]

Juri L. Baskakov

Electron. Colloquium Comput. Complex., 1997

Efficient Construction of Hitting Sets for Systems of Linear Functions.

[BibT_eX]

[DOI]

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Weak Random Sources, Hitting Sets, and BPP Simulations.

[BibT_eX]

[DOI]

Luca Trevisan

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

A Deciding Algorithm for Linear Isomorphism of Types with Complexity O (n log<sup>2</sup>(n)).

[BibT_eX]

[DOI]

Sergei Soloviev

Proceedings of the Category Theory and Computer Science, 7th International Conference, 1997

1996

Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Hitting Properties of Hard Boolean Operators and their Consequences on BPP

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1996

Towards efficient constructions of hitting sets that derandomize BPP

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1996

Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of Hardware.

[BibT_eX]

[DOI]

Proceedings of the STACS 96, 1996

On the Parallel Computation of Boolean Functions on Unrelated inputs.

[BibT_eX]

Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

Hitting Sets Derandomize BPP.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995

Optimal Bounds for the Approximation of Boolean Functions and Some Applications

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1995

The Parallel Complexity of Approximating the High Degree Subgraph Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1987

Effective Lower Bounds for Complexity of Some Classes of Schemes.

[BibT_eX]

[DOI]