 | 2009 |
|---|
| 38 |       | Emanuele Viola:
Bit-probe lower bounds for succinct data structures.
STOC 2009: 475-482 |
| 37 | | Ilias Diakonikolas,
Parikshit Gopalan,
Ragesh Jaiswal,
Rocco A. Servedio,
Emanuele Viola:
Bounded Independence Fools Halfspaces
CoRR abs/0902.3757: (2009) |
| 36 | | Emanuele Viola:
Cell-Probe Lower Bounds for Prefix Sums
CoRR abs/0906.1370: (2009) |
| 35 | | Jasmina Hasanhodzic,
Andrew W. Lo,
Emanuele Viola:
A Computational View of Market Efficiency
CoRR abs/0908.4580: (2009) |
| 34 | | Emanuele Viola:
The Sum of D Small-Bias Generators Fools Polynomials of Degree D.
Computational Complexity 18(2): 209-217 (2009) |
| 33 | | Emanuele Viola:
Guest Column: correlation bounds for polynomials over {0 1}.
SIGACT News 40(1): 27-44 (2009) |
| 2008 |
|---|
| 32 | | Matei David,
Toniann Pitassi,
Emanuele Viola:
Improved Separations between Nondeterministic and Randomized Multiparty Communication.
APPROX-RANDOM 2008: 371-384 |
| 31 | | Emanuele Viola:
The Sum of d Small-Bias Generators Fools Polynomials of Degree d.
IEEE Conference on Computational Complexity 2008: 124-127 |
| 30 | | Ronen Shaltiel,
Emanuele Viola:
Hardness amplification proofs require majority.
STOC 2008: 589-598 |
| 29 | | Emanuele Viola,
Avi Wigderson:
Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols.
Theory of Computing 4(1): 137-168 (2008) |
| 2007 |
|---|
| 28 | | Andrej Bogdanov,
Emanuele Viola:
Pseudorandom Bits for Polynomials.
FOCS 2007: 41-51 |
| 27 | | Emanuele Viola,
Avi Wigderson:
One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications.
FOCS 2007: 427-437 |
| 26 | | Emanuele Viola,
Avi Wigderson:
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols.
IEEE Conference on Computational Complexity 2007: 141-154 |
| 25 | | Emanuele Viola:
On Approximate Majority and Probabilistic Time.
IEEE Conference on Computational Complexity 2007: 155-168 |
| 24 | | Emanuele Viola,
Avi Wigderson:
One-way multi-party communication lower bound for pointer jumping with applications.
Electronic Colloquium on Computational Complexity (ECCC) 14(079): (2007) |
| 23 | | Andrej Bogdanov,
Emanuele Viola:
Pseudorandom bits for polynomials.
Electronic Colloquium on Computational Complexity (ECCC) 14(081): (2007) |
| 22 | | Emanuele Viola:
Selected Results in Additive Combinatorics: An Exposition.
Electronic Colloquium on Computational Complexity (ECCC) 14(103): (2007) |
| 21 | | Ronen Shaltiel,
Emanuele Viola:
Hardness amplification proofs require majority.
Electronic Colloquium on Computational Complexity (ECCC) 14(130): (2007) |
| 20 | | Emanuele Viola:
The sum of d small-bias generators fools polynomials of degree d.
Electronic Colloquium on Computational Complexity (ECCC) 14(132): (2007) |
| 19 | | Emanuele Viola:
Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates.
SIAM J. Comput. 36(5): 1387-1403 (2007) |
| 2006 |
|---|
| 18 | | Emanuele Viola:
On Probabilistic Time versus Alternating Time.
Complexity of Boolean Functions 2006 |
| 17 | | Alexander Healy,
Emanuele Viola:
Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two.
STACS 2006: 672-683 |
| 16 | | Emanuele Viola:
New correlation bounds for GF(2) polynomials using Gowers uniformity.
Electronic Colloquium on Computational Complexity (ECCC) 13(097): (2006) |
| 15 | | Alexander Healy,
Salil P. Vadhan,
Emanuele Viola:
Using Nondeterminism to Amplify Hardness.
SIAM J. Comput. 35(4): 903-931 (2006) |
| 2005 |
|---|
| 14 | | Emanuele Viola:
On Constructing Parallel Pseudorandom Generators from One-Way Functions.
IEEE Conference on Computational Complexity 2005: 183-197 |
| 13 | | Emanuele Viola:
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates.
IEEE Conference on Computational Complexity 2005: 198-209 |
| 12 | | Emanuele Viola:
The complexity of constructing pseudorandom generators from hard functions.
Computational Complexity 13(3-4): 147-188 (2005) |
| 11 | | Emanuele Viola:
Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates
Electronic Colloquium on Computational Complexity (ECCC)(043): (2005) |
| 10 | | Alexander Healy,
Emanuele Viola:
Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
Electronic Colloquium on Computational Complexity (ECCC)(087): (2005) |
| 9 | | Emanuele Viola:
On Probabilistic Time versus Alternating Time
Electronic Colloquium on Computational Complexity (ECCC)(137): (2005) |
| 2004 |
|---|
| 8 | | Dan Gutfreund,
Emanuele Viola:
Fooling Parity Tests with Parity Gates.
APPROX-RANDOM 2004: 381-392 |
| 7 | | Alexander Healy,
Salil P. Vadhan,
Emanuele Viola:
Using nondeterminism to amplify hardness.
STOC 2004: 192-201 |
| 6 | | Emanuele Viola:
The Complexity of Constructing Pseudorandom Generators from Hard Functions
Electronic Colloquium on Computational Complexity (ECCC)(020): (2004) |
| 5 | | Emanuele Viola:
On Parallel Pseudorandom Generators
Electronic Colloquium on Computational Complexity (ECCC)(074): (2004) |
| 4 | | Alexander Healy,
Salil P. Vadhan,
Emanuele Viola:
Using Nondeterminism to Amplify Hardness
Electronic Colloquium on Computational Complexity (ECCC)(087): (2004) |
| 3 | | Emanuele Viola,
Dan Gutfreund:
Fooling Parity Tests with Parity Gates
Electronic Colloquium on Computational Complexity (ECCC)(088): (2004) |
| 2003 |
|---|
| 2 | | Emanuele Viola:
Hardness vs. Randomness within Alternating Time.
IEEE Conference on Computational Complexity 2003: 53- |
| 2001 |
|---|
| 1 | | Emanuele Viola:
E-unifiability via Narrowing.
ICTCS 2001: 426-438 |
