The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Emanuele Viola" ( http://dblp.L3S.de/Authors/Emanuele_Viola )

  Author page on DBLP  Author page in RDF  Community of Emanuele Viola in ASPL-2

Publication years (Num. hits)
2001-2005 (15) 2006-2008 (18) 2009 (15) 2010-2011 (22) 2012-2013 (27) 2014-2015 (17) 2016-2017 (18) 2018-2019 (16)
Publication types (Num. hits)
article(108) inproceedings(40)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 21 occurrences of 16 keywords

Results
Found 149 publication records. Showing 148 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Emanuele Viola Pseudorandom bits and lower bounds for randomized Turing machines. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1Xuangui Huang, Emanuele Viola Approximate Degree-Weight and Indistinguishability. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2019 DBLP  BibTeX  RDF
1W. T. Gowers 0001, Emanuele Viola Interleaved Group Products. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Emanuele Viola AC0 unpredictability. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Emanuele Viola Lower bounds for data structures with space close to maximum imply circuit lower bounds. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Emanuele Viola Constant-error pseudorandomness proofs from hardness require majority. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Aryeh Grinberg, Ronen Shaltiel, Emanuele Viola Indistinguishability by adaptive procedures with advice, and lower bounds on hardness amplification proofs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Emanuele Viola Sampling lower bounds: boolean average-case and permutations. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2018 DBLP  BibTeX  RDF
1Hamidreza Jahanjou, Eric Miles, Emanuele Viola Local reduction. Search on Bibsonomy Inf. Comput. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Vladimir Braverman, Emanuele Viola, David P. Woodruff, Lin F. Yang Revisiting Frequency Moment Estimation in Random Order Streams. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1W. T. Gowers 0001, Emanuele Viola Interleaved group products. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Emanuele Viola, Avi Wigderson Local Expanders. Search on Bibsonomy Computational Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Chin Ho Lee, Emanuele Viola The Coin Problem for Product Tests. Search on Bibsonomy TOCT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Elad Haramaty, Chin Ho Lee, Emanuele Viola Bounded Independence Plus Noise Fools Products. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Vladimir Braverman, Emanuele Viola, David P. Woodruff, Lin F. Yang Revisiting Frequency Moment Estimation in Random Order Streams. Search on Bibsonomy ICALP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Aryeh Grinberg, Ronen Shaltiel, Emanuele Viola Indistinguishability by Adaptive Procedures with Advice, and Lower Bounds on Hardness Amplification Proofs. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Emanuele Viola A sampling lower bound for permutations. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2017 DBLP  BibTeX  RDF
1Chin Ho Lee, Emanuele Viola The coin problem for product tests. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2017 DBLP  BibTeX  RDF
1Chin Ho Lee, Emanuele Viola More on bounded independence plus noise: Pseudorandom generators for read-once polynomials. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2017 DBLP  BibTeX  RDF
1Chin Ho Lee, Emanuele Viola Some Limitations of the Sum of Small-Bias Distributions. Search on Bibsonomy Theory of Computing The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Emanuele Viola Selected challenges in computational lower bounds. Search on Bibsonomy SIGACT News The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Frederic Green, Daniel Kreymer, Emanuele Viola Block-symmetric polynomials correlate with parity better than symmetric. Search on Bibsonomy Computational Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Elad Haramaty, Chin Ho Lee, Emanuele Viola Bounded Independence Plus Noise Fools Products. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Zahra Jafargholi, Emanuele Viola 3SUM, 3XOR, Triangles. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Timothy Gowers, Emanuele Viola The multiparty communication complexity of interleaved group products. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2016 DBLP  BibTeX  RDF
1Ravi B. Boppana, Johan Håstad, Chin Ho Lee, Emanuele Viola Bounded independence vs. moduli. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2016 DBLP  BibTeX  RDF
1Emanuele Viola, Avi Wigderson Local Expanders. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2016 DBLP  BibTeX  RDF
1Elad Haramaty, Chin Ho Lee, Emanuele Viola Bounded independence plus noise fools products. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2016 DBLP  BibTeX  RDF
1Andrej Bogdanov, Yuval Ishai, Emanuele Viola, Christopher Williamson Bounded Indistinguishability and the Complexity of Recovering Secrets. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2016 DBLP  BibTeX  RDF
1Eric Miles, Emanuele Viola On the complexity of constructing pseudorandom functions (especially when they don't exist). Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2016 DBLP  BibTeX  RDF
1Emanuele Viola Quadratic Maps Are Hard to Sample. Search on Bibsonomy TOCT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1W. T. Gowers 0001, Emanuele Viola The Multiparty Communication Complexity of Interleaved Group Products. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ravi B. Boppana, Johan Håstad, Chin Ho Lee, Emanuele Viola Bounded Independence vs. Moduli. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Andrej Bogdanov, Yuval Ishai, Emanuele Viola, Christopher Williamson Bounded Indistinguishability and the Complexity of Recovering Secrets. Search on Bibsonomy CRYPTO (3) The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Emanuele Viola The communication complexity of addition. Search on Bibsonomy Combinatorica The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Eric Miles, Emanuele Viola On the Complexity of Constructing Pseudorandom Functions (Especially when They Don't Exist). Search on Bibsonomy J. Cryptology The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Andrej Bogdanov, Yuval Ishai, Emanuele Viola, Christopher Williamson Bounded Indistinguishability and the Complexity of Recovering Secrets. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2015 DBLP  BibTeX  RDF
1Chin Ho Lee, Emanuele Viola Some limitations of the sum of small-bias distributions. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2015 DBLP  BibTeX  RDF
1Timothy Gowers, Emanuele Viola The communication complexity of interleaved group products. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2015 DBLP  BibTeX  RDF
1Oded Goldreich 0001, Emanuele Viola, Avi Wigderson On Randomness Extraction in AC0. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2015 DBLP  BibTeX  RDF
1Emanuele Viola Quadratic maps are hard to sample. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2015 DBLP  BibTeX  RDF
1Eric Miles, Emanuele Viola Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs. Search on Bibsonomy J. ACM The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001, Emanuele Viola, Avi Wigderson On Randomness Extraction in AC0. Search on Bibsonomy Conference on Computational Complexity The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Timothy Gowers, Emanuele Viola The communication complexity of interleaved group products. Search on Bibsonomy STOC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Hamid Jahanjou, Eric Miles, Emanuele Viola Local Reductions. Search on Bibsonomy ICALP (1) The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Eli Ben-Sasson, Emanuele Viola Short PCPs with projection queries. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2014 DBLP  BibTeX  RDF
1Hamidreza Jahanjou, Eric Miles, Emanuele Viola Succinct and explicit circuits for sorting and connectivity. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2014 DBLP  BibTeX  RDF
1Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola Global Information Sharing under Network Dynamics. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Emanuele Viola Randomness Buys Depth for Approximate Counting. Search on Bibsonomy Computational Complexity The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Emanuele Viola Extractors for Circuit Sources. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Eli Ben-Sasson, Emanuele Viola Short PCPs with Projection Queries. Search on Bibsonomy ICALP (1) The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Zahra Jafargholi, Emanuele Viola 3SUM, 3XOR, Triangles. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2013 DBLP  BibTeX  RDF
1Hamidreza Jahanjou, Eric Miles, Emanuele Viola Local reductions. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2013 DBLP  BibTeX  RDF
1Emanuele Viola Challenges in computational lower bounds. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2013 DBLP  BibTeX  RDF
1Eric Miles, Emanuele Viola Shielding circuits with groups. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2013 DBLP  BibTeX  RDF
1Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola On Beating the Hybrid Argument. Search on Bibsonomy Theory of Computing The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Eric Miles, Emanuele Viola Shielding circuits with groups. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2013 DBLP  BibTeX  RDF
1Anna 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. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Hamidreza Jahanjou, Eric Miles, Emanuele Viola Local reductions. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Zahra Jafargholi, Emanuele Viola 3SUM, 3XOR, Triangles Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Emanuele Viola Challenges in computational lower bounds. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Alexander A. Razborov, Emanuele Viola Real Advantage. Search on Bibsonomy TOCT The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Eric Miles, Emanuele Viola Shielding circuits with groups. Search on Bibsonomy STOC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Emanuele Viola The communication complexity of addition. Search on Bibsonomy SODA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola On the Complexity of Information Spreading in Dynamic Networks. Search on Bibsonomy SODA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Zahra Jafargholi, Hamidreza Jahanjou, Eric Miles, Jaideep Ramachandran, Emanuele Viola From RAM to SAT. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Rocco A. Servedio, Emanuele Viola On a special case of rigidity. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Emanuele Viola Extractors for Turing-machine sources. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Alexander A. Razborov, Emanuele Viola Real Advantage. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Eric Miles, Emanuele Viola On the complexity of constructing pseudorandom functions (especially when they don't exist). Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Frederic Green, Daniel Kreymer, Emanuele Viola Block-symmetric polynomials correlate with parity better than symmetric. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Shachar Lovett, Emanuele Viola Bounded-Depth Circuits Cannot Sample Good Codes. Search on Bibsonomy Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Emanuele Viola The Complexity of Distributions. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Emanuele Viola Bit-Probe Lower Bounds for Succinct Data Structures. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola On beating the hybrid argument. Search on Bibsonomy ITCS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Anna 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. Search on Bibsonomy STOC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Emanuele Viola Extractors for Turing-Machine Sources. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Eric Miles, Emanuele Viola Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs. Search on Bibsonomy CRYPTO The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Frederic Green, Daniel Kreymer, Emanuele Viola In Brute-Force Search of Correlation Bounds for Polynomials. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Emanuele Viola Reducing 3XOR to listing triangles, an exposition. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Emanuele Viola The communication complexity of addition. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Eric Miles, Emanuele Viola The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Anna 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. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Emanuele Viola Extractors for circuit sources. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Emanuele Viola Selected Results in Additive Combinatorics: An Exposition. Search on Bibsonomy Theory of Computing, Graduate Surveys The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Eric Miles, Emanuele Viola The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2011 DBLP  BibTeX  RDF
1Scott Aaronson, Jeff Erickson 0001, Mohammad Mahdian, R. Ravi 0001, Emanuele Viola Special Section on Foundations of Computer Science. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2011 DBLP  BibTeX  RDF
1Shachar Lovett, Emanuele Viola Bounded-Depth Circuits Cannot Sample Good Codes. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Eric Miles, Emanuele Viola On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators. Search on Bibsonomy TCC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Emanuele Viola Randomness Buys Depth for Approximate Counting. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Emanuele Viola Extractors for Circuit Sources. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Emanuele Viola Randomness buys depth for approximate counting. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Shachar Lovett, Emanuele Viola Bounded-depth circuits cannot sample good codes. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola On beating the hybrid argument. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Jasmina Hasanhodzic, Andrew W. Lo, Emanuele Viola Is It Real, or Is It Randomized?: A Financial Turing Test Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Ronen Shaltiel, Emanuele Viola Hardness Amplification Proofs Require Majority. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola Bounded Independence Fools Halfspaces. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Andrej Bogdanov, Emanuele Viola Pseudorandom Bits for Polynomials. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Mihai Patrascu, Emanuele Viola Cell-Probe Lower Bounds for Succinct Partial Sums. Search on Bibsonomy SODA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Emanuele Viola The Complexity of Distributions. Search on Bibsonomy FOCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 148 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license