The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alexander E. Andreev: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alexander E. Andreev, Sergei Soloviev
    A Deciding Algorithm for Linear Isomorphism of Types with Complexity O (n log2(n)). [Citation Graph (0, 0)][DBLP]
    Category Theory and Computer Science, 1997, pp:197-209 [Conf]
  2. Alexander E. Andreev
    Effective Lower Bounds for Complexity of Some Classes of Schemes. [Citation Graph (0, 0)][DBLP]
    FCT, 1987, pp:24-29 [Conf]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. 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]

  24. Very Large Cliques are Easy to Detect. [Citation Graph (, )][DBLP]


  25. The optimal sequence compression. [Citation Graph (, )][DBLP]


  26. Very large cliques are easy to detect. [Citation Graph (, )][DBLP]


Search in 0.000secs, Finished in 0.001secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002