| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Eric Miles, Emanuele Viola |
On the complexity of constructing pseudorandom functions (especially when they don't exist).  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
Extractors for Turing-machine sources. |
Electronic Colloquium on Computational Complexity (ECCC) |
2012 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
The Complexity of Distributions. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola |
On beating the hybrid argument. |
ITCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola |
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola |
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Frederic Green, Daniel Kreymer, Emanuele Viola |
In Brute-Force Search of Correlation Bounds for Polynomials. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
Extractors for circuit sources. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eric Miles, Emanuele Viola |
The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
The communication complexity of addition. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
Reducing 3XOR to listing triangles, an exposition. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
Selected Results in Additive Combinatorics: An Exposition. |
Theory of Computing, Graduate Surveys |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Miles, Emanuele Viola |
The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola |
Special Section on Foundations of Computer Science. |
SIAM J. Comput. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eric Miles, Emanuele Viola |
On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators. |
TCC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuele Viola |
Extractors for Circuit Sources. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuele Viola |
Randomness Buys Depth for Approximate Counting. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shachar Lovett, Emanuele Viola |
Bounded-Depth Circuits Cannot Sample Good Codes. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shachar Lovett, Emanuele Viola |
Bounded-depth circuits cannot sample good codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola |
On beating the hybrid argument. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
Randomness buys depth for approximate counting. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jasmina Hasanhodzic, Andrew W. Lo, Emanuele Viola |
Is It Real, or Is It Randomized?: A Financial Turing Test |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ronen Shaltiel, Emanuele Viola |
Hardness Amplification Proofs Require Majority. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Emanuele Viola |
Pseudorandom Bits for Polynomials. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola |
Bounded Independence Fools Halfspaces. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihai Patrascu, Emanuele Viola |
Cell-Probe Lower Bounds for Succinct Partial Sums. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
The Complexity of Distributions. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Matei David, Toniann Pitassi, Emanuele Viola |
Improved Separations between Nondeterministic and Randomized Multiparty Communication. |
TOCT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuele Viola |
Bit-Probe Lower Bounds for Succinct Data Structures. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
Are all distributions easy? |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
Cell-Probe Lower Bounds for Prefix Sums. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola |
Bounded Independence Fools Halfspaces. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
On the Power of Small-Depth Computation. |
Foundations and Trends in Theoretical Computer Science |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuele Viola, Avi Wigderson |
One-way multiparty communication lower bound for pointer jumping with applications. |
Combinatorica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuele Viola |
The Sum of D Small-Bias Generators Fools Polynomials of Degree D. |
Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
68Q99, Subject classification |
| 1 | Emanuele Viola |
On Approximate Majority and Probabilistic Time. |
Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuele Viola |
Cell-Probe Lower Bounds for Prefix Sums |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola |
Bounded Independence Fools Halfspaces |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Jasmina Hasanhodzic, Andrew W. Lo, Emanuele Viola |
A Computational View of Market Efficiency |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
Guest Column: correlation bounds for polynomials over {0 1}. |
SIGACT News |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola |
Bounded Independence Fools Halfspaces. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
k-wise independent distributions, pseudorandomness, halfspaces |
| 1 | Emanuele Viola |
Bit-probe lower bounds for succinct data structures. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
bit-probe, cell-probe, logarithmic form, ternary value, lower bound, dictionary, succinct data structure, membership query |
| 1 | Emanuele Viola, Avi Wigderson |
Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols. |
Theory of Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Matei David, Toniann Pitassi, Emanuele Viola |
Improved Separations between Nondeterministic and Randomized Multiparty Communication. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuele Viola |
The Sum of d Small-Bias Generators Fools Polynomials of Degree d. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Shaltiel, Emanuele Viola |
Hardness amplification proofs require majority. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
amplification, natural proofs, black-box, hardness, average-case complexity, constant-depth circuits, majority |
| 1 | Andrej Bogdanov, Emanuele Viola |
Pseudorandom bits for polynomials. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
Selected Results in Additive Combinatorics: An Exposition. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola, Avi Wigderson |
One-way multi-party communication lower bound for pointer jumping with applications. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ronen Shaltiel, Emanuele Viola |
Hardness amplification proofs require majority. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
The sum of d small-bias generators fools polynomials of degree d. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Emanuele Viola |
Pseudorandom Bits for Polynomials. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuele Viola, Avi Wigderson |
One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuele Viola |
On Approximate Majority and Probabilistic Time. |
IEEE Conference on Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuele Viola, Avi Wigderson |
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols. |
IEEE Conference on Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuele Viola |
New correlation bounds for GF(2) polynomials using Gowers uniformity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Alexander Healy, Salil P. Vadhan, Emanuele Viola |
Using Nondeterminism to Amplify Hardness. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Healy, Emanuele Viola |
Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuele Viola |
On Probabilistic Time versus Alternating Time. |
Complexity of Boolean Functions |
2006 |
DBLP BibTeX RDF |
|
| 1 | Alexander Healy, Emanuele Viola |
Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
On Probabilistic Time versus Alternating Time |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
On Constructing Parallel Pseudorandom Generators from One-Way Functions. |
IACR Cryptology ePrint Archive |
2005 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
The complexity of constructing pseudorandom generators from hard functions. |
Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
68Q01, Subject classification |
| 1 | Emanuele Viola |
On Constructing Parallel Pseudorandom Generators from One-Way Functions. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
Pseudorandom generator construction, one-way function, black-box, restriction, constant-depth circuit, noise sensitivity, hardness amplification |
| 1 | Emanuele Viola |
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuele Viola |
On Parallel Pseudorandom Generators |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola, Dan Gutfreund |
Fooling Parity Tests with Parity Gates |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Emanuele Viola |
The Complexity of Constructing Pseudorandom Generators from Hard Functions |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Alexander Healy, Salil P. Vadhan, Emanuele Viola |
Using Nondeterminism to Amplify Hardness |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Dan Gutfreund, Emanuele Viola |
Fooling Parity Tests with Parity Gates. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Healy, Salil P. Vadhan, Emanuele Viola |
Using nondeterminism to amplify hardness. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
noise stability, pseudorandom generators for space-bounded computation, average-case complexity, hardness amplification |
| 1 | Emanuele Viola |
Hardness vs. Randomness within Alternating Time. |
IEEE Conference on Computational Complexity |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuele Viola |
E-unifiability via Narrowing. |
ICTCS |
2001 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")