 | 2008 |
|---|
| 12 |       | Shafi Goldwasser,
Dan Gutfreund,
Alexander Healy,
Tali Kaufman,
Guy N. Rothblum:
A (de)constructive approach to program checking.
STOC 2008: 143-152 |
| 11 | | Alexander Healy:
Randomness-Efficient Sampling within NC1.
Computational Complexity 17(1): 3-37 (2008) |
| 2007 |
|---|
| 10 | | Shafi Goldwasser,
Dan Gutfreund,
Alexander Healy,
Tali Kaufman,
Guy N. Rothblum:
Verifying and decoding in constant depth.
STOC 2007: 440-449 |
| 9 | | Shafi Goldwasser,
Dan Gutfreund,
Alexander Healy,
Tali Kaufman,
Guy N. Rothblum:
A (De)constructive Approach to Program Checking.
Electronic Colloquium on Computational Complexity (ECCC) 14(047): (2007) |
| 2006 |
|---|
| 8 | | Alexander Healy:
Randomness-Efficient Sampling Within NC1.
APPROX-RANDOM 2006: 398-409 |
| 7 | | Alexander Healy,
Emanuele Viola:
Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two.
STACS 2006: 672-683 |
| 6 | | Alexander Healy:
Randomness-Efficient Sampling within NC^1.
Electronic Colloquium on Computational Complexity (ECCC) 13(058): (2006) |
| 5 | | Alexander Healy,
Salil P. Vadhan,
Emanuele Viola:
Using Nondeterminism to Amplify Hardness.
SIAM J. Comput. 35(4): 903-931 (2006) |
| 2005 |
|---|
| 4 | | Melissa Chase,
Alexander Healy,
Anna Lysyanskaya,
Tal Malkin,
Leonid Reyzin:
Mercurial Commitments with Applications to Zero-Knowledge Sets.
EUROCRYPT 2005: 422-439 |
| 3 | | Alexander Healy,
Emanuele Viola:
Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
Electronic Colloquium on Computational Complexity (ECCC)(087): (2005) |
| 2004 |
|---|
| 2 | | Alexander Healy,
Salil P. Vadhan,
Emanuele Viola:
Using nondeterminism to amplify hardness.
STOC 2004: 192-201 |
| 1 | | Alexander Healy,
Salil P. Vadhan,
Emanuele Viola:
Using Nondeterminism to Amplify Hardness
Electronic Colloquium on Computational Complexity (ECCC)(087): (2004) |
