The SCEAS System
| |||||||

## Search the dblp DataBase
Alexander E. Andreev:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Alexander E. Andreev, Sergei Soloviev
**A Deciding Algorithm for Linear Isomorphism of Types with Complexity O (n log**[Citation Graph (0, 0)][DBLP]^{2}(n)). Category Theory and Computer Science, 1997, pp:197-209 [Conf] - Alexander E. Andreev
**Effective Lower Bounds for Complexity of Some Classes of Schemes.**[Citation Graph (0, 0)][DBLP] FCT, 1987, pp:24-29 [Conf] - Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan
**Weak Random Sources, Hitting Sets, and BPP Simulations.**[Citation Graph (0, 0)][DBLP] FOCS, 1997, pp:264-272 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] ICALP, 1999, pp:179-189 [Conf] - Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
**Hitting Sets Derandomize BPP.**[Citation Graph (0, 0)][DBLP] ICALP, 1996, pp:357-368 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] ICALP, 1997, pp:177-187 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] ISAAC, 1995, pp:132-141 [Conf] - Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
**On the Parallel Computation of Boolean Functions on Unrelated inputs.**[Citation Graph (0, 0)][DBLP] ISTCS, 1996, pp:155-161 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] STACS, 1999, pp:68-77 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] STACS, 1996, pp:319-330 [Conf] - Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
**Efficient Construction of Hitting Sets for Systems of Linear Functions.**[Citation Graph (0, 0)][DBLP] STACS, 1997, pp:387-398 [Conf] - Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim
**Parallel Read Operations Without Memory Contention**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:53, pp:- [Journal] - Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
**Optimal Bounds for the Approximation of Boolean Functions and Some Applications**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:41, pp:- [Journal] - Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
**Hitting Sets Derandomize BPP**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:61, pp:- [Journal] - Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
**Towards efficient constructions of hitting sets that derandomize BPP**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:29, pp:- [Journal] - Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan
**Weak Random Sources, Hitting Sets, and BPP Simulations**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:11, pp:- [Journal] - 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**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:53, pp:- [Journal] - Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
**A New General Derandomization Method.**[Citation Graph (0, 0)][DBLP] J. ACM, 1998, v:45, n:1, pp:179-213 [Journal] - Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan
**Weak Random Sources, Hitting Sets, and BPP Simulations.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1999, v:28, n:6, pp:2103-2116 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:205, n:1-2, pp:261-282 [Journal] - Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
**Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1996, v:161, n:1&2, pp:307-314 [Journal] - Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
**Optimal Bounds for the Approximation of Boolean Functions and Some Applications.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:180, n:1-2, pp:243-268 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:221, n:1-2, pp:3-18 [Journal] **Very Large Cliques are Easy to Detect.**[Citation Graph (, )][DBLP]**The optimal sequence compression.**[Citation Graph (, )][DBLP]**Very large cliques are easy to detect.**[Citation Graph (, )][DBLP]
Search in 0.000secs, Finished in 0.001secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |