Search the dblp DataBase
Alexander Healy :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Alexander Healy Randomness-Efficient Sampling Within NC ^{1} . [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2006, pp:398-409 [Conf ] 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 ] 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 ] Alexander Healy , Salil P. Vadhan , Emanuele Viola Using nondeterminism to amplify hardness. [Citation Graph (0, 0)][DBLP ] STOC, 2004, pp:192-201 [Conf ] 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 ] 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 ] 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 ] 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 ] A (de)constructive approach to program checking. [Citation Graph (, )][DBLP ] Randomness-Efficient Sampling within NC^{1} . [Citation Graph (, )][DBLP ] A (De)constructive Approach to Program Checking. [Citation Graph (, )][DBLP ] Randomness-Efficient Sampling within NC^1. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.003secs