- Are all distributions easy? Emanuele Viola
- Selected Results in Additive Combinatorics: An Exposition
- Cell-Probe Lower Bounds for Succinct Partial Sums Mihai Patrascu
- On the complexity of non-adaptively increasing the stretch of pseudorandom generators
- The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs
- Extractors for circuit sources Emanuele Viola
- Randomness buys depth for approximate counting Emanuele Viola
- Bounded-depth circuits cannot sample good codes Shachar Lovett
- Is It Real, or Is It Randomized?: A Financial Turing Test
- A Computational View of Market Efficiency Jasmina Hasanhodzic
- Improved Separations between Nondeterministic and Randomized Multiparty Communication
- The sum of d small-bias generators fools polynomials of Emanuele Viola
- Hardness Amplification Proofs Require Majority Ronen Shaltiel
- On the Power of Small-Depth Computation Emanuele Viola1
- QUINCYSTREET KIR KLAND STREE T
- CCC 2010 Restaurant List All addresses in Cambridge unless otherwise noted. MD = Maxwell Dworkin, the building in which the
- Fooling Parity Tests with Parity Gates Dan Gutfreund 1;? and Emanuele Viola 2;??
- Hardness vs. Randomness within Alternating Time Emanuele Viola #
- comput. complex. 13 (2004), 147 188 1016-3328/04/03014742
- Cell-Probe Lower Bounds for Prefix Sums and Matching Emanuele Viola
- The Complexity of Hardness Amplification and Derandomization
- Using Nondeterminism to Amplify Hardness Alexander Healy # Salil Vadhan +
- Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
- To appear in Combinatorica Invited to SIAM Journal on Computing, FOCS special issue
- Emanuele Viola's Research Statement September 2010 My main research area is computational complexity, which is the study of the reach
- E-uni ability via Narrowing ? Emanuele Viola
- New correlation bounds for GF (2) polynomials using Gowers uniformity
- Pseudorandom bits for polynomials Andrej Bogdanov
- Using Nondeterminism to Amplify Hardness # Alexander Healy + Salil Vadhan #
- On Constructing Parallel Pseudorandom Generators from One-Way Functions
- On Approximate Majority and Probabilistic Time Emanuele Viola #
- The Complexity of Hardness Amplification and Derandomization
- Technical analysis pulled out of the By Jonathan Davis
- Using Nondeterminism to Amplify Hardness Alexander Healy
- On Approximate Majority and Probabilistic Time Emanuele Viola
- The complexity of distributions Emanuele Viola
- ConstantDepth Circuits for Arithmetic in Finite Fields of Characteristic Two
- Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates
- Correlation bounds for polynomials over {0, 1}1 Emanuele Viola2
- Using Nondeterminism to Amplify Hardness Alexander Healy
- In Brute-Force Search of Correlation Bounds for Polynomials
- One-way multi-party communication lower bound for pointer jumping with applications
- A Computational View of Market Efficiency Jasmina Hasanhodzic
- Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates
- New correlation bounds for GF(2) polynomials using Gowers uniformity
- Hardness vs. Randomness within Alternating Time Emanuele Viola
- Bit-Probe Lower Bounds for Succinct Data Structures Emanuele Viola
- Do humans perceive temporal order in asset returns? Jasmina Hasanhodzic,
- Reducing 3XOR to listing triangles, an exposition Emanuele Viola
- The communication complexity of addition Emanuele Viola
- Think like the pros Emanuele Viola
- Substitution-permutation networks, pseudorandom functions, and Natural Proofs
- Do humans perceive temporal order in asset returns? Jasmina Hasanhodzic,