Emanuele Viola
Emanuele Viola
Professor of Computer Science, Northeastern University
Verified email at ccs.neu.edu
TitleCited byYear
Pseudorandom bits for polynomials
A Bogdanov, E Viola
SIAM Journal on Computing 39 (6), 2464-2486, 2010
1192010
Norms, XOR lemmas, and lower bounds for polynomials and protocols
E Viola, A Wigderson
Theory of Computing 4 (1), 137-168, 2008
111*2008
Bounded independence fools halfspaces
I Diakonikolas, P Gopalan, R Jaiswal, RA Servedio, E Viola
SIAM Journal on Computing 39 (8), 3441-3462, 2010
992010
The sum of d small-bias generators fools polynomials of degree d
E Viola
Computational Complexity 18 (2), 209-217, 2009
962009
The complexity of constructing pseudorandom generators from hard functions
E Viola
computational complexity 13 (3-4), 147-188, 2005
752005
Using nondeterminism to amplify hardness
A Healy, S Vadhan, E Viola
SIAM Journal on Computing 35 (4), 903-931, 2006
722006
Hardness amplification proofs require majority
R Shaltiel, E Viola
SIAM Journal on Computing 39 (7), 3122-3154, 2010
652010
On the complexity of information spreading in dynamic networks
C Dutta, G Pandurangan, R Rajaraman, Z Sun, E Viola
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
642013
Pseudorandom bits for constant depth circuits with few arbitrary symmetric gates
E Viola
20th Annual IEEE Conference on Computational Complexity (CCC'05), 198-209, 2005
602005
Cell-probe lower bounds for succinct partial sums
M Pătraşcu, E Viola
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
562010
Extractors for circuit sources
E Viola
SIAM Journal on Computing 43 (2), 655-672, 2014
502014
On constructing parallel pseudorandom generators from one-way functions
E Viola
20th Annual IEEE Conference on Computational Complexity (CCC'05), 183-197, 2005
452005
Local reductions
H Jahanjou, E Miles, E Viola
International Colloquium on Automata, Languages, and Programming, 749-760, 2015
432015
The complexity of distributions
E Viola
SIAM Journal on Computing 41 (1), 191-218, 2012
432012
On the power of small-depth computation
E Viola
Foundations and Trends® in Theoretical Computer Science 5 (1), 1-72, 2009
422009
On approximate majority and probabilistic time
E Viola
Computational Complexity 18 (3), 337, 2009
352009
Improved separations between nondeterministic and randomized multiparty communication
M David, T Pitassi, E Viola
ACM Transactions on Computation Theory (TOCT) 1 (2), 5, 2009
352009
Short PCPs with projection queries
E Ben-Sasson, E Viola
International Colloquium on Automata, Languages, and Programming, 163-173, 2014
332014
, 3XOR, Triangles
Z Jafargholi, E Viola
Algorithmica 74 (1), 326-343, 2016
322016
The communication complexity of addition
E Viola
Combinatorica 35 (6), 703-747, 2015
312015
The system can't perform the operation now. Try again later.
Articles 1–20