Emanuele Viola

发表

Local reduction

Hamidreza Jahanjou, Eric Miles, Emanuele Viola, 2018, Inf. Comput..

Fourier conjectures, correlation bounds, and Majority

Emanuele Viola, 2020, Electron. Colloquium Comput. Complex..

Approximate Degree, Weight, and Indistinguishability

Emanuele Viola, Xuangui Huang, Emanuele Viola, 2022, Electron. Colloquium Comput. Complex..

Using nondeterminism to amplify hardness

Emanuele Viola, Salil P. Vadhan, Alexander Healy, 2004, STOC '04.

Constant-Error Pseudorandomness Proofs from Hardness Require Majority

Emanuele Viola, 2018, Electron. Colloquium Comput. Complex..

On the Complexity of Constructing Pseudorandom Functions (Especially when They Don’t Exist)

Eric Miles, Emanuele Viola, Emanuele Viola, 2015, Journal of Cryptology.

Average-case rigidity lower bounds

Emanuele Viola, Xuangui Huang, Emanuele Viola, 2020, Electron. Colloquium Comput. Complex..

Guest Column

Emanuele Viola, 2019, SIGACT News.

Randomness Buys Depth for Approximate Counting

Emanuele Viola, 2011, FOCS.

The Sum of D Small-Bias Generators Fools Polynomials of Degree D

Emanuele Viola, Emanuele Viola, 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two

Emanuele Viola, Alexander Healy, 2006, STACS.

Is it Real, or is it Randomized?: A Financial Turing Test

Emanuele Viola, Andrew W. Lo, Jasmina Hasanhodzic, 2010, ArXiv.

On Probabilistic Time versus Alternating Time

Emanuele Viola, Emanuele Viola, 2005, Complexity of Boolean Functions.

Bounded-Depth Circuits Cannot Sample Good Codes

Shachar Lovett, Emanuele Viola, Emanuele Viola, 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

The complexity of constructing pseudorandom generators from hard functions

Emanuele Viola, Emanuele Viola, 2005, computational complexity.

Real Advantage

Emanuele Viola, Alexander A. Razborov, A. Razborov, 2013, TOCT.

Lower bounds for data structures with space close to maximum imply circuit lower bounds

Emanuele Viola, 2018, Electron. Colloquium Comput. Complex..

Hardness amplification proofs require majority

Emanuele Viola, Ronen Shaltiel, Emanuele Viola, 2008, SIAM J. Comput..

Guest Column: correlation bounds for polynomials over {0 1}

Emanuele Viola, Emanuele Viola, 2009, SIGA.

In Brute-Force Search of Correlation Bounds for Polynomials

Emanuele Viola, Frederic Green, Daniel Kreymer, 2011, Electron. Colloquium Comput. Complex..

Extractors for Circuit Sources

Emanuele Viola, Emanuele Viola, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

On Randomness Extraction in AC0

Emanuele Viola, Avi Wigderson, Oded Goldreich, 2015, Electron. Colloquium Comput. Complex..

The communication complexity of addition

Emanuele Viola, 2013, SODA.

Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates

Emanuele Viola, 2007, SIAM J. Comput..

Quadratic Maps Are Hard to Sample

Emanuele Viola, Emanuele Viola, 2016, ACM Trans. Comput. Theory.

Bounded Indistinguishability and the Complexity of Recovering Secrets

Christopher Williamson, Yuval Ishai, Emanuele Viola, 2016, CRYPTO.

The Coin Problem for Product Tests

Emanuele Viola, Chin Ho Lee, 2017, Electron. Colloquium Comput. Complex..

Local Expanders

Emanuele Viola, Avi Wigderson, 2017, computational complexity.

Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates

Kristoffer Arnsfelt Hansen, Emanuele Viola, Pavel Pudlák, 2013, IEEE Trans. Inf. Theory.

Hardness vs. randomness within alternating time

Emanuele Viola, Emanuele Viola, 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

Selected Results in Additive Combinatorics: An Exposition

Emanuele Viola, Emanuele Viola, 2007, Theory Comput..

Short PCPs with Projection Queries

Emanuele Viola, Eli Ben-Sasson, Emanuele Viola, 2014, ICALP.

A computational view of market efficiency

Emanuele Viola, Andrew W. Lo, Jasmina Hasanhodzic, 2009, ArXiv.

Bounded Independence Fools Halfspaces

Rocco A. Servedio, Emanuele Viola, Ilias Diakonikolas, 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

On the Power of Small-Depth Computation

Emanuele Viola, Emanuele Viola, 2009, Found. Trends Theor. Comput. Sci..

One-way multiparty communication lower bound for pointer jumping with applications

Emanuele Viola, Avi Wigderson, 2009, Comb..

Challenges in computational lower bounds pdf

Emanuele Viola, 2013, Electron. Colloquium Comput. Complex..

Hardness Amplification Proofs Require Majority

Emanuele Viola, Ronen Shaltiel, 2010, SIAM J. Comput..

Special Section on Foundations of Computer Science

R. Ravi, Emanuele Viola, Mohammad Mahdian, 2011, SIAM J. Comput..

Bit-Probe Lower Bounds for Succinct Data Structures

Emanuele Viola, 2012, SIAM J. Comput..

Local Reductions

Hamidreza Jahanjou, Eric Miles, Emanuele Viola, 2013, ICALP.

Shielding circuits with groups

Eric Miles, Emanuele Viola, 2013, STOC '13.

On a special case of rigidity

Rocco A. Servedio, Emanuele Viola, R. Servedio, 2012, Electron. Colloquium Comput. Complex..

Pseudorandom Bits for Polynomials

Emanuele Viola, Andrej Bogdanov, Emanuele Viola, 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

New correlation bounds for GF(2) polynomials using Gowers uniformity

Emanuele Viola, Emanuele Viola, 2006, Electron. Colloquium Comput. Complex..

Cell-Probe Lower Bounds for Prefix Sums pdf

Emanuele Viola, 2009, Electron. Colloquium Comput. Complex..

Indistinguishability by Adaptive Procedures with Advice, and Lower Bounds on Hardness Amplification Proofs

Emanuele Viola, Ronen Shaltiel, Aryeh Grinberg, 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

Extractors for Circuit Sources

Emanuele Viola, 2011, FOCS.

Bounded-Depth Circuits Cannot Sample Good Codes

Shachar Lovett, Emanuele Viola, 2011, Computational Complexity Conference.

Bounded Independence Fools Halfspaces

Rocco A. Servedio, Emanuele Viola, Ilias Diakonikolas, 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

New lower bounds for probabilistic degree and AC0 with parity gates

Emanuele Viola, Emanuele Viola, 2020, Electron. Colloquium Comput. Complex..

The communication complexity of addition

Emanuele Viola, Emanuele Viola, 2013, Comb..

Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols

Emanuele Viola, Avi Wigderson, A. Wigderson, 2008, Theory Comput..

On Beating the Hybrid Argument

Emanuele Viola, Bill Fefferman, Christopher Umans, 2013, Theory Comput..

Bounded independence plus noise fools products

Emanuele Viola, Elad Haramaty, Chin Ho Lee, 2016, Electron. Colloquium Comput. Complex..

One-way multiparty communication lower bound for pointer jumping with applications

Emanuele Viola, Avi Wigderson, A. Wigderson, 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

Pseudorandom bits for constant depth circuits with few arbitrary symmetric gates

Emanuele Viola, Emanuele Viola, 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

E-unifiability via Narrowing

Emanuele Viola, 2001, ICTCS.

On Parallel Pseudorandom Generators

Emanuele Viola, 2004, Electron. Colloquium Comput. Complex..

The Complexity of Distributions

Emanuele Viola, Emanuele Viola, 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

The Multiparty Communication Complexity of Interleaved Group Products

Emanuele Viola, W. T. Gowers, 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs

Eric Miles, Emanuele Viola, Emanuele Viola, 2011, Electron. Colloquium Comput. Complex..

Cell-probe lower bounds for succinct partial sums

Emanuele Viola, Mihai Patrascu, Emanuele Viola, 2010, SODA '10.

Are all distributions easy?

Emanuele Viola, Emanuele Viola, 2009, Electron. Colloquium Comput. Complex..

From RAM to SAT

Hamidreza Jahanjou, Eric Miles, Emanuele Viola, 2012, Electron. Colloquium Comput. Complex..

Revisiting Frequency Moment Estimation in Random Order Streams

David P. Woodruff, Emanuele Viola, Vladimir Braverman, 2018, ICALP.

How to Store a Random Walk pdf

Emanuele Viola, Omri Weinstein, Huacheng Yu, 2020, SODA.

On beating the hybrid argument

Emanuele Viola, Bill Fefferman, Christopher Umans, 2012, ITCS '12.

On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators

Eric Miles, Emanuele Viola, 2011, TCC.

Global Information Sharing under Network Dynamics pdf

Emanuele Viola, Rajmohan Rajaraman, Gopal Pandurangan, 2014, ArXiv.

Extractors for Turing-Machine Sources

Emanuele Viola, Emanuele Viola, 2012, APPROX-RANDOM.

Matching Smolensky's correlation bound with majority

Emanuele Viola, 2019, Electron. Colloquium Comput. Complex..

Bounded Independence Plus Noise Fools Products

Emanuele Viola, Elad Haramaty, Chin Ho Lee, 2017, Computational Complexity Conference.

Some Limitations of the Sum of Small-Bias Distributions

Emanuele Viola, Chin Ho Lee, Emanuele Viola, 2017, Theory Comput..

Block-symmetric polynomials correlate with parity better than symmetric

Emanuele Viola, Frederic Green, Daniel Kreymer, 2017, computational complexity.

The communication complexity of group multiplication

Emanuele Viola, 2014 .

Using Nondeterminism to Amplify Hardness

Emanuele Viola, Salil P. Vadhan, Alexander Healy, 2006, SIAM J. Comput..

Improved Separations between Nondeterministic and Randomized Multiparty Communication

Emanuele Viola, Toniann Pitassi, Matei David, 2008, APPROX-RANDOM.

Sampling lower bounds: boolean average-case and permutations

Emanuele Viola, Emanuele Viola, 2020, Electron. Colloquium Comput. Complex..

The Sum of d Small-Bias Generators Fools Polynomials of Degree d

Emanuele Viola, 2008, Computational Complexity Conference.

Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs

Eric Miles, Emanuele Viola, Emanuele Viola, 2012, J. ACM.

Bounded independence vs. moduli

Emanuele Viola, Johan Håstad, Ravi B. Boppana, 2016, Electron. Colloquium Comput. Complex..

The communication complexity of interleaved group products

Emanuele Viola, Timothy Gowers, Emanuele Viola, 2015, STOC.

On Approximate Majority and Probabilistic Time

Emanuele Viola, Emanuele Viola, 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

A sampling lower bound for permutations

Emanuele Viola, 2017, Electron. Colloquium Comput. Complex..

The Complexity of Distributions

Emanuele Viola, 2012, SIAM J. Comput..

3SUM, 3XOR, Triangles

Emanuele Viola, Zahra Jafargholi, Emanuele Viola, 2013, Electron. Colloquium Comput. Complex..

Selected challenges in computational lower bounds

Emanuele Viola, Emanuele Viola, 2017, SIGA.

Pseudorandom bits and lower bounds for randomized Turing machines

Emanuele Viola, 2019, Electron. Colloquium Comput. Complex..

On the Complexity of Information Spreading in Dynamic Networks

Emanuele Viola, Rajmohan Rajaraman, Gopal Pandurangan, 2013, SODA.

Reducing 3XOR to listing triangles, an exposition

Emanuele Viola, 2011, Electron. Colloquium Comput. Complex..

Succinct and explicit circuits for sorting and connectivity

Hamidreza Jahanjou, Eric Miles, Emanuele Viola, 2014, Electron. Colloquium Comput. Complex..

On constructing parallel pseudorandom generators from one-way functions

Emanuele Viola, Emanuele Viola, 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates

Kristoffer Arnsfelt Hansen, Emanuele Viola, Michal Koucký, 2012, IEEE Transactions on Information Theory.

Bounded Independence versus Symmetric Tests

Emanuele Viola, Ravi B. Boppana, Chin Ho Lee, 2019, ACM Trans. Comput. Theory.

Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols

Emanuele Viola, Avi Wigderson, A. Wigderson, 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

Pseudorandom Bits for Polynomials

Emanuele Viola, Andrej Bogdanov, 2010, SIAM J. Comput..

Bit-probe lower bounds for succinct data structures

Emanuele Viola, 2009, STOC '09.

More on bounded independence plus noise: Pseudorandom generators for read-once polynomials

Emanuele Viola, Chin Ho Lee, 2017, Electron. Colloquium Comput. Complex..

Improved Separations between Nondeterministic and Randomized Multiparty Communication

Emanuele Viola, Toniann Pitassi, Matei David, 2008, TOCT.

On Approximate Majority and Probabilistic Time

Emanuele Viola, 2009, computational complexity.

Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs

Eric Miles, Emanuele Viola, 2012, CRYPTO.

Randomness Buys Depth for Approximate Counting

Emanuele Viola, Emanuele Viola, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

AC0 Unpredictability

Emanuele Viola, Emanuele Viola, 2021, Electron. Colloquium Comput. Complex..

Fooling Parity Tests with Parity Gates

Emanuele Viola, Dan Gutfreund, Emanuele Viola, 2004, APPROX-RANDOM.

Interleaved group products

Emanuele Viola, W. T. Gowers, Emanuele Viola, 2018, SIAM J. Comput..

Mixing in non-quasirandom groups

Emanuele Viola, Timothy Gowers, 2021, Electron. Colloquium Comput. Complex..

Affine extractors and AC0-Parity

Emanuele Viola, Xuangui Huang, Peter Ivanov, 2021, Electron. Colloquium Comput. Complex..

Fourier growth of structured $\mathbb{F}_2$-polynomials and applications

Rocco A. Servedio, Emanuele Viola, Jaroslaw Blasiok, 2021, Electron. Colloquium Comput. Complex..

Lower bounds for samplers and data structures via the cell-probe separator

Emanuele Viola, Emanuele Viola, 2021, Electron. Colloquium Comput. Complex..

On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization

Emanuele Viola, Ronen Shaltiel, Emanuele Viola, 2021, Electron. Colloquium Comput. Complex..

Cell-Probe Lower Bounds for Prefix Sums and Matching Brackets

Emanuele Viola, 2009 .

3SUM\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathrm {3SUM}$$\end{document}, 3XOR\documentclass[12pt]{minimal}

Emanuele Viola, Zahra Jafargholi, Emanuele Viola, 2014, Algorithmica.

Special Topics in Complexity Theory

Emanuele Viola, Xuangui Huang, Chin Ho Lee, 2017 .