| Year |
Citation |
Score |
| 2019 |
Boppana R, Håstad J, Lee CH, Viola E. Bounded Independence versus Symmetric Tests Acm Transactions On Computation Theory. 11: 1-27. DOI: 10.1145/3337783 |
0.394 |
|
| 2018 |
Haramaty E, Lee CH, Viola E. Bounded Independence Plus Noise Fools Products Siam Journal On Computing. 47: 493-523. DOI: 10.1137/17M1129088 |
0.304 |
|
| 2017 |
Haramaty E, Lee CH, Viola E. Bounded Independence Plus Noise Fools Products. Electronic Colloquium On Computational Complexity. 23: 169. DOI: 10.4230/Lipics.Ccc.2017.14 |
0.43 |
|
| 2017 |
Lee CH, Viola E. Some limitations of the sum of small-bias distributions Theory of Computing. 13: 1-23. DOI: 10.4086/Toc.2017.V013A016 |
0.45 |
|
| 2017 |
Green F, Kreymer D, Viola E. Block-symmetric polynomials correlate with parity better than symmetric Computational Complexity. 26: 323-364. DOI: 10.1007/S00037-017-0153-3 |
0.344 |
|
| 2016 |
Viola E. Quadratic Maps Are Hard to Sample Acm Transactions On Computation Theory. 8: 18. DOI: 10.1145/2934308 |
0.37 |
|
| 2016 |
Jafargholi Z, Viola E. $$\mathrm {3SUM}$$ 3 SUM , $$\mathrm {3XOR}$$ 3 XOR , Triangles Algorithmica. 74: 326-343. DOI: 10.1007/S00453-014-9946-9 |
0.354 |
|
| 2015 |
Miles E, Viola E. Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs Journal of the Acm. 62: 46. DOI: 10.1145/2792978 |
0.518 |
|
| 2015 |
Miles E, Viola E. On the Complexity of Constructing Pseudorandom Functions (Especially when They Don't Exist) Journal of Cryptology. 28: 509-532. DOI: 10.1007/S00145-013-9161-X |
0.415 |
|
| 2014 |
Viola E. Extractors for Circuit Sources Siam Journal On Computing. 43: 655-672. DOI: 10.1137/11085983X |
0.432 |
|
| 2014 |
Viola E. Randomness Buys Depth for Approximate Counting Computational Complexity. 23: 479-508. DOI: 10.1007/S00037-013-0076-6 |
0.476 |
|
| 2013 |
Gal A, Hansen KA, Koucky M, Pudlak P, Viola E. Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates Ieee Transactions On Information Theory. 59: 6611-6627. DOI: 10.1109/Tit.2013.2270275 |
0.495 |
|
| 2012 |
Viola E. The Complexity of Distributions Siam Journal On Computing. 41: 191-218. DOI: 10.1137/100814998 |
0.512 |
|
| 2012 |
Viola E. Bit-Probe Lower Bounds for Succinct Data Structures Siam Journal On Computing. 41: 1593-1604. DOI: 10.1137/090766619 |
0.457 |
|
| 2010 |
Diakonikolas I, Gopalan P, Jaiswal R, Servedio RA, Viola E. Bounded independence fools halfspaces Siam Journal On Computing. 39: 3441-3462. DOI: 10.1137/100783030 |
0.473 |
|
| 2010 |
Shaltiel R, Viola E. Hardness Amplification Proofs Require Majority Siam Journal On Computing. 39: 3122-3154. DOI: 10.1137/080735096 |
0.422 |
|
| 2010 |
Bogdanov A, Viola E. Pseudorandom Bits for Polynomials Siam Journal On Computing. 39: 2464-2486. DOI: 10.1137/070712109 |
0.425 |
|
| 2009 |
David M, Pitassi T, Viola E. Improved Separations between Nondeterministic and Randomized Multiparty Communication Acm Transactions On Computation Theory. 1: 5. DOI: 10.1145/1595391.1595392 |
0.399 |
|
| 2009 |
Viola E, Wigderson A. One-way multiparty communication lower bound for pointer jumping with applications Combinatorica. 29: 719-743. DOI: 10.1007/S00493-009-2667-Z |
0.319 |
|
| 2009 |
Viola E. The Sum of D Small-Bias Generators Fools Polynomials of Degree D Computational Complexity. 18: 209-217. DOI: 10.1007/S00037-009-0273-5 |
0.377 |
|
| 2009 |
Viola E. On Approximate Majority and Probabilistic Time Computational Complexity. 18: 337-375. DOI: 10.1007/S00037-009-0267-3 |
0.414 |
|
| 2008 |
Viola E, Wigderson A. Norms, XOR lemmas, and lower bounds for polynomials and protocols Theory of Computing. 4: 137-168. DOI: 10.4086/Toc.2008.V004A007 |
0.338 |
|
| 2006 |
Healy A, Vadhan S, Viola E. Using Nondeterminism to Amplify Hardness Siam Journal On Computing. 35: 903-931. DOI: 10.1137/S0097539705447281 |
0.614 |
|
| 2006 |
Viola E. Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates Siam Journal On Computing. 36: 1387-1403. DOI: 10.1137/050640941 |
0.466 |
|
| 2005 |
Viola E. The complexity of constructing pseudorandom generators from hard functions Computational Complexity. 13: 147-188. DOI: 10.1007/S00037-004-0187-1 |
0.458 |
|
| Show low-probability matches. |