The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alexander Healy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alexander Healy
    Randomness-Efficient Sampling Within NC1. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:398-409 [Conf]
  2. Melissa Chase, Alexander Healy, Anna Lysyanskaya, Tal Malkin, Leonid Reyzin
    Mercurial Commitments with Applications to Zero-Knowledge Sets. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2005, pp:422-439 [Conf]
  3. Alexander Healy, Emanuele Viola
    Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:672-683 [Conf]
  4. Alexander Healy, Salil P. Vadhan, Emanuele Viola
    Using nondeterminism to amplify hardness. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:192-201 [Conf]
  5. Alexander Healy, Salil P. Vadhan, Emanuele Viola
    Using Nondeterminism to Amplify Hardness [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:087, pp:- [Journal]
  6. Alexander Healy, Emanuele Viola
    Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:087, pp:- [Journal]
  7. Alexander Healy, Salil P. Vadhan, Emanuele Viola
    Using Nondeterminism to Amplify Hardness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:4, pp:903-931 [Journal]
  8. Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum
    Verifying and decoding in constant depth. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:440-449 [Conf]

  9. A (de)constructive approach to program checking. [Citation Graph (, )][DBLP]


  10. Randomness-Efficient Sampling within NC1. [Citation Graph (, )][DBLP]


  11. A (De)constructive Approach to Program Checking. [Citation Graph (, )][DBLP]


  12. Randomness-Efficient Sampling within NC^1. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.003secs
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