Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Emanuele
    Last name: Viola
    DBLP: 48/4265
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 100 of 101  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Eli Ben-Sasson, Emanuele Viola.
    Short PCPs with projection queries.
    Electronic Colloquium on Computational Complexity (ECCC) 2014, Volume 21 (0) 2014
    Conference paper
    Hamidreza Jahanjou, Eric Miles, Emanuele Viola.
    Succinct and explicit circuits for sorting and connectivity.
    Electronic Colloquium on Computational Complexity (ECCC) 2014, Volume 21 (0) 2014
    Conference paper
    Emanuele Viola.
    Extractors for Circuit Sources.
    SIAM J. Comput. 2014, Volume 43 (0) 2014
    Conference paper
    Eli Ben-Sasson, Emanuele Viola.
    Short PCPs with Projection Queries.
    Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I 2014 (0) 2014
    Journal article
    Eric Miles, Emanuele Viola.
    Shielding circuits with groups.
    Electronic Colloquium on Computational Complexity (ECCC) 2013, Volume 20 (0) 2013
    Journal article
    Zahra Jafargholi, Emanuele Viola.
    3SUM, 3XOR, Triangles.
    Electronic Colloquium on Computational Complexity (ECCC) 2013, Volume 20 (0) 2013
    Conference paper
    Eric Miles, Emanuele Viola.
    Shielding circuits with groups.
    IACR Cryptology ePrint Archive 2013, Volume 2013 (0) 2013
    Conference paper
    Emanuele Viola.
    The communication complexity of addition.
    Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013 2013 (0) 2013
    Conference paper
    Eric Miles, Emanuele Viola.
    Shielding circuits with groups.
    Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013 2013 (0) 2013
    Journal article
    Zahra Jafargholi, Emanuele Viola.
    3SUM, 3XOR, Triangles
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Hamidreza Jahanjou, Eric Miles, Emanuele Viola.
    Local reductions.
    Electronic Colloquium on Computational Complexity (ECCC) 2013, Volume 20 (0) 2013
    Conference paper
    Emanuele Viola.
    Challenges in computational lower bounds.
    Electronic Colloquium on Computational Complexity (ECCC) 2013, Volume 20 (0) 2013
    Conference paper
    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.
    IEEE Transactions on Information Theory 2013, Volume 59 (0) 2013
    Journal article
    Hamidreza Jahanjou, Eric Miles, Emanuele Viola.
    Local reductions.
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Emanuele Viola.
    Challenges in computational lower bounds.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Alexander A. Razborov, Emanuele Viola.
    Real Advantage.
    TOCT 2013, Volume 5 (0) 2013
    Conference paper
    Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola.
    On the Complexity of Information Spreading in Dynamic Networks.
    Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013 2013 (0) 2013
    Conference paper
    Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola.
    On Beating the Hybrid Argument.
    Theory of Computing 2013, Volume 9 (0) 2013
    Journal article
    Emanuele Viola.
    The Complexity of Distributions.
    SIAM J. Comput. 2012, Volume 41 (0) 2012
    Conference paper
    Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola.
    On beating the hybrid argument.
    Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA, January 8-10, 2012 2012 (0) 2012
    Conference paper
    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.
    Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012 2012 (0) 2012
    Conference paper
    Shachar Lovett, Emanuele Viola.
    Bounded-Depth Circuits Cannot Sample Good Codes.
    Computational Complexity 2012, Volume 21 (0) 2012
    Conference paper
    Eric Miles, Emanuele Viola.
    Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs.
    Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Emanuele Viola.
    Extractors for Turing-Machine Sources.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Rocco A. Servedio, Emanuele Viola.
    On a special case of rigidity.
    Electronic Colloquium on Computational Complexity (ECCC) 2012, Volume 19 (0) 2012
    Conference paper
    Eric Miles, Emanuele Viola.
    On the complexity of constructing pseudorandom functions (especially when they don't exist).
    Electronic Colloquium on Computational Complexity (ECCC) 2012, Volume 19 (0) 2012
    Conference paper
    Emanuele Viola.
    Extractors for Turing-machine sources.
    Electronic Colloquium on Computational Complexity (ECCC) 2012, Volume 19 (0) 2012
    Conference paper
    Alexander A. Razborov, Emanuele Viola.
    Real Advantage.
    Electronic Colloquium on Computational Complexity (ECCC) 2012, Volume 19 (0) 2012
    Conference paper
    Zahra Jafargholi, Hamidreza Jahanjou, Eric Miles, Jaideep Ramachandran, Emanuele Viola.
    From RAM to SAT.
    Electronic Colloquium on Computational Complexity (ECCC) 2012, Volume 19 (0) 2012
    Conference paper
    Frederic Green, Daniel Kreymer, Emanuele Viola.
    Block-symmetric polynomials correlate with parity better than symmetric.
    Electronic Colloquium on Computational Complexity (ECCC) 2012, Volume 19 (0) 2012
    Conference paper
    Emanuele Viola.
    Bit-Probe Lower Bounds for Succinct Data Structures.
    SIAM J. Comput. 2012, Volume 41 (0) 2012
    Conference paper
    Eric Miles, Emanuele Viola.
    On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators.
    Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings 2011 (0) 2011
    Conference paper
    Frederic Green, Daniel Kreymer, Emanuele Viola.
    In Brute-Force Search of Correlation Bounds for Polynomials.
    Electronic Colloquium on Computational Complexity (ECCC) 2011, Volume 18 (0) 2011
    Conference paper
    Emanuele Viola.
    Extractors for circuit sources.
    Electronic Colloquium on Computational Complexity (ECCC) 2011, Volume 18 (0) 2011
    Conference paper
    Eric Miles, Emanuele Viola.
    The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs.
    Electronic Colloquium on Computational Complexity (ECCC) 2011, Volume 18 (0) 2011
    Conference paper
    Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola.
    Special Section on Foundations of Computer Science.
    SIAM J. Comput. 2011, Volume 40 (0) 2011
    Conference paper
    Shachar Lovett, Emanuele Viola.
    Bounded-Depth Circuits Cannot Sample Good Codes.
    Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, June 8-10, 2011 2011 (0) 2011
    Conference paper
    Emanuele Viola.
    Reducing 3XOR to listing triangles, an exposition.
    Electronic Colloquium on Computational Complexity (ECCC) 2011, Volume 18 (0) 2011
    Conference paper
    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, Volume 18 (0) 2011
    Conference paper
    Emanuele Viola.
    The communication complexity of addition.
    Electronic Colloquium on Computational Complexity (ECCC) 2011, Volume 18 (0) 2011
    Conference paper
    Emanuele Viola.
    Extractors for Circuit Sources.
    IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011 2011 (0) 2011
    Conference paper
    Emanuele Viola.
    Randomness Buys Depth for Approximate Counting.
    IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011 2011 (0) 2011
    Conference paper
    Eric Miles, Emanuele Viola.
    The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs.
    IACR Cryptology ePrint Archive 2011, Volume 2011 (0) 2011
    Journal article
    Emanuele Viola.
    Selected Results in Additive Combinatorics: An Exposition.
    Theory of Computing, Graduate Surveys 2011, Volume 2 (0) 2011
    Conference paper
    Andrej Bogdanov, Emanuele Viola.
    Pseudorandom Bits for Polynomials.
    SIAM J. Comput. 2009, Volume 39 (0) 2010
    Conference paper
    Mihai Patrascu, Emanuele Viola.
    Cell-Probe Lower Bounds for Succinct Partial Sums.
    Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010 2010 (0) 2010
    Conference paper
    Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola.
    Bounded Independence Fools Halfspaces.
    SIAM J. Comput. 2009, Volume 39 (0) 2010
    Journal article
    Emanuele Viola.
    Randomness buys depth for approximate counting.
    Electronic Colloquium on Computational Complexity (ECCC) 2010, Volume 17 (0) 2010
    Journal article
    Shachar Lovett, Emanuele Viola.
    Bounded-depth circuits cannot sample good codes.
    Electronic Colloquium on Computational Complexity (ECCC) 2010, Volume 17 (0) 2010
    Conference paper
    Emanuele Viola.
    The Complexity of Distributions.
    51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA 2010 (0) 2010
    Conference paper
    Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola.
    On beating the hybrid argument.
    Electronic Colloquium on Computational Complexity (ECCC) 2010, Volume 17 (0) 2010
    Conference paper
    Ronen Shaltiel, Emanuele Viola.
    Hardness Amplification Proofs Require Majority.
    SIAM J. Comput. 2009, Volume 39 (0) 2010
    Journal article
    Jasmina Hasanhodzic, Andrew W. Lo, Emanuele Viola.
    Is It Real, or Is It Randomized?: A Financial Turing Test
    CoRR 2010, Volume 0 (0) 2010
    Journal article
    Emanuele Viola.
    Are all distributions easy?
    Electronic Colloquium on Computational Complexity (ECCC) 2009, Volume 16 (0) 2009
    Journal article
    Emanuele Viola.
    Bit-Probe Lower Bounds for Succinct Data Structures.
    Electronic Colloquium on Computational Complexity (ECCC) 2009, Volume 16 (0) 2009
    Journal article
    Emanuele Viola.
    Cell-Probe Lower Bounds for Prefix Sums.
    Electronic Colloquium on Computational Complexity (ECCC) 2009, Volume 16 (0) 2009
    Journal article
    Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola.
    Bounded Independence Fools Halfspaces.
    Electronic Colloquium on Computational Complexity (ECCC) 2009, Volume 16 (0) 2009
    Conference paper
    Emanuele Viola, Avi Wigderson.
    One-way multiparty communication lower bound for pointer jumping with applications.
    Combinatorica 2009, Volume 29 (0) 2009
    Conference paper
    Emanuele Viola.
    Bit-probe lower bounds for succinct data structures.
    Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009 2009 (0) 2009
    Conference paper
    Emanuele Viola.
    The Sum of
    Computational Complexity 2009, Volume 18 (0) 2009
    Conference paper
    Emanuele Viola.
    On Approximate Majority and Probabilistic Time.
    Computational Complexity 2009, Volume 18 (0) 2009
    Conference paper
    Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola.
    Bounded Independence Fools Halfspaces
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Emanuele Viola.
    Cell-Probe Lower Bounds for Prefix Sums
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Jasmina Hasanhodzic, Andrew W. Lo, Emanuele Viola.
    A Computational View of Market Efficiency
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Emanuele Viola.
    Guest Column: correlation bounds for polynomials over {0 1}.
    SIGACT News 2009, Volume 40 (0) 2009
    Journal article
    Emanuele Viola.
    On the Power of Small-Depth Computation.
    Foundations and Trends in Theoretical Computer Science 2009, Volume 5 (0) 2009
    Journal article
    Matei David, Toniann Pitassi, Emanuele Viola.
    Improved Separations between Nondeterministic and Randomized Multiparty Communication.
    TOCT 2009, Volume 1 (0) 2009
    Conference paper
    Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola.
    Bounded Independence Fools Halfspaces.
    50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA 2009 (0) 2009
    Conference paper
    Matei David, Toniann Pitassi, Emanuele Viola.
    Improved Separations between Nondeterministic and Randomized Multiparty Communication.
    Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings 2008 (0) 2008
    Conference paper
    Emanuele Viola.
    The Sum of d Small-Bias Generators Fools Polynomials of Degree d.
    Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA 2008 (0) 2008
    Conference paper
    Ronen Shaltiel, Emanuele Viola.
    Hardness amplification proofs require majority.
    Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008 2008 (0) 2008
    Conference paper
    Emanuele Viola, Avi Wigderson.
    Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols.
    Theory of Computing 2008, Volume 4 (0) 2008
    Conference paper
    Emanuele Viola.
    On Approximate Majority and Probabilistic Time.
    22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA 2007 (0) 2007
    Conference paper
    Emanuele Viola, Avi Wigderson.
    Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols.
    22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA 2007 (0) 2007
    Conference paper
    Emanuele Viola, Avi Wigderson.
    One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications.
    48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings 2007 (0) 2007
    Conference paper
    Andrej Bogdanov, Emanuele Viola.
    Pseudorandom Bits for Polynomials.
    48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings 2007 (0) 2007
    Conference paper
    Emanuele Viola, Avi Wigderson.
    One-way multi-party communication lower bound for pointer jumping with applications.
    Electronic Colloquium on Computational Complexity (ECCC) 2007, Volume 14 (0) 2007
    Conference paper
    Emanuele Viola.
    The sum of d small-bias generators fools polynomials of degree d.
    Electronic Colloquium on Computational Complexity (ECCC) 2007, Volume 14 (0) 2007
    Conference paper
    Andrej Bogdanov, Emanuele Viola.
    Pseudorandom bits for polynomials.
    Electronic Colloquium on Computational Complexity (ECCC) 2007, Volume 14 (0) 2007
    Conference paper
    Ronen Shaltiel, Emanuele Viola.
    Hardness amplification proofs require majority.
    Electronic Colloquium on Computational Complexity (ECCC) 2007, Volume 14 (0) 2007
    Conference paper
    Emanuele Viola.
    Selected Results in Additive Combinatorics: An Exposition.
    Electronic Colloquium on Computational Complexity (ECCC) 2007, Volume 14 (0) 2007
    Conference paper
    Emanuele Viola.
    Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates.
    SIAM J. Comput. 2006, Volume 36 (0) 2007
    Conference paper
    Emanuele Viola.
    On Probabilistic Time versus Alternating Time.
    Complexity of Boolean Functions, 12.03. - 17.03.2006 2006 (0) 2006
    Conference paper
    Alexander Healy, Emanuele Viola.
    Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two.
    STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings 2006 (0) 2006
    Conference paper
    Emanuele Viola.
    New correlation bounds for GF(2) polynomials using Gowers uniformity.
    Electronic Colloquium on Computational Complexity (ECCC) 2006, Volume null (0) 2006
    Conference paper
    Alexander Healy, Salil P. Vadhan, Emanuele Viola.
    Using Nondeterminism to Amplify Hardness.
    SIAM J. Comput. 2006, Volume 35 (0) 2006
    Journal article
    Emanuele Viola.
    On Constructing Parallel Pseudorandom Generators from One-Way Functions.
    IACR Cryptology ePrint Archive 2005, Volume 2005 (0) 2005
    Conference paper
    Emanuele Viola.
    Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates.
    20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA 2005 (0) 2005
    Conference paper
    Emanuele Viola.
    On Constructing Parallel Pseudorandom Generators from One-Way Functions.
    20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA 2005 (0) 2005
    Conference paper
    Emanuele Viola.
    The complexity of constructing pseudorandom generators from hard functions.
    Computational Complexity 2004, Volume 13 (0) 2005
    Conference paper
    Emanuele Viola.
    Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates
    Electronic Colloquium on Computational Complexity (ECCC) 2005, Volume null (0) 2005
    Conference paper
    Alexander Healy, Emanuele Viola.
    Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
    Electronic Colloquium on Computational Complexity (ECCC) 2005, Volume null (0) 2005
    Conference paper
    Emanuele Viola.
    On Probabilistic Time versus Alternating Time
    Electronic Colloquium on Computational Complexity (ECCC) 2005, Volume null (0) 2005
    Conference paper
    Dan Gutfreund, Emanuele Viola.
    Fooling Parity Tests with Parity Gates.
    Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Compu 2004 (0) 2004
    Conference paper
    Alexander Healy, Salil P. Vadhan, Emanuele Viola.
    Using nondeterminism to amplify hardness.
    Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004 2004 (0) 2004
    Conference paper
    Emanuele Viola.
    The Complexity of Constructing Pseudorandom Generators from Hard Functions
    Electronic Colloquium on Computational Complexity (ECCC) 2004, Volume null (0) 2004
    Conference paper
    Emanuele Viola.
    On Parallel Pseudorandom Generators
    Electronic Colloquium on Computational Complexity (ECCC) 2004, Volume null (0) 2004
    Conference paper
    Alexander Healy, Salil P. Vadhan, Emanuele Viola.
    Using Nondeterminism to Amplify Hardness
    Electronic Colloquium on Computational Complexity (ECCC) 2004, Volume null (0) 2004
    Conference paper
    Emanuele Viola, Dan Gutfreund.
    Fooling Parity Tests with Parity Gates
    Electronic Colloquium on Computational Complexity (ECCC) 2004, Volume null (0) 2004
    Conference paper
    Emanuele Viola.
    Hardness vs. Randomness within Alternating Time.
    18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark 2003 (0) 2003
    Show item 1 to 100 of 101  

    Your query returned 101 matches in the database.