Emanuele Viola

202 papers A* 24A 18B 1Misc 1Journal 148Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Simple XOR lemma. Electron. Colloquium Comput. Complex. Emanuele Viola
2025	J	`jnl`	Boosting uniformity in quasirandom groups: fast and simple. Electron. Colloquium Comput. Complex. Harm Derksen, Chin Ho Lee, Emanuele Viola
2025	J	`jnl`	Communication complexity of pointer chasing via the fixed-set lemma. CoRR Emanuele Viola
2025	J	`jnl`	Communication complexity of pointer chasing via the fixed-set lemma. Electron. Colloquium Comput. Complex. Emanuele Viola
2025	J	`jnl`	Constant-time source decoding. Electron. Colloquium Comput. Complex. Jordan Horacsek, Chin Ho Lee, Igor Shinkar, Emanuele Viola, Renfei Zhou
2025	A	`conf`	Pseudorandom Bits for Non-Commutative Programs. CCC Chin Ho Lee, Emanuele Viola
2025	J	`jnl`	Pseudorandom bits for non-commutative programs. CoRR Chin Ho Lee, Emanuele Viola
2025	J	`jnl`	Pseudorandom bits for non-commutative programs. Electron. Colloquium Comput. Complex. Chin Ho Lee, Emanuele Viola
2025	J	`jnl`	Pseudorandomness, symmetry, smoothing: I. Electron. Colloquium Comput. Complex. Harm Derksen, Peter Ivanov, Chin Ho Lee, Emanuele Viola
2025	J	`jnl`	Pseudorandomness, symmetry, smoothing: II. Electron. Colloquium Comput. Complex. Harm Derksen, Peter Ivanov, Chin Ho Lee, Emanuele Viola
2024	A*	`conf`	Boosting Uniformity in Quasirandom Groups: Fast and Simple. FOCS Harm Derksen, Chin Ho Lee, Emanuele Viola
2024	J	`jnl`	Boosting uniformity in quasirandom groups: fast and simple. CoRR Harm Derksen, Chin Ho Lee, Emanuele Viola
2024	A	`conf`	Pseudorandomness, Symmetry, Smoothing: I. CCC Harm Derksen, Peter Ivanov, Chin Ho Lee, Emanuele Viola
2024	J	`jnl`	Pseudorandomness, symmetry, smoothing: I. CoRR Harm Derksen, Peter Ivanov, Chin Ho Lee, Emanuele Viola
2024	J	`jnl`	Pseudorandomness, symmetry, smoothing: II. CoRR Harm Derksen, Peter Ivanov, Chin Ho Lee, Emanuele Viola
2024	J	`jnl`	Resilient functions: Optimized, simplified, and generalized. CoRR Peter Ivanov, Emanuele Viola
2023	A*	`conf`	Efficient resilient functions. SODA Peter Ivanov, Raghu Meka, Emanuele Viola
2023	A	`conf`	New Sampling Lower Bounds via the Separator. CCC Emanuele Viola
2023	A	`conf`	On Correlation Bounds Against Polynomials. CCC Peter Ivanov, Liam Pavlovic, Emanuele Viola
2023	J	`jnl`	On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization. CoRR Ronen Shaltiel, Emanuele Viola
2023	J	`jnl`	On correlation bounds against polynomials. CoRR Peter Ivanov, Liam Pavlovic, Emanuele Viola
2022	A	`conf`	Affine Extractors and AC0-Parity. APPROX/RANDOM Xuangui Huang, Peter Ivanov, Emanuele Viola
2022	J	`jnl`	Approximate Degree, Weight, and Indistinguishability. ACM Trans. Comput. Theory Xuangui Huang, Emanuele Viola
2022	J	`jnl`	Correlation bounds against polynomials. Electron. Colloquium Comput. Complex. Emanuele Viola
2022	J	`jnl`	Efficient resilient functions. Electron. Colloquium Comput. Complex. Peter Ivanov, Raghu Meka, Emanuele Viola
2022	A*	`conf`	Fooling polynomials using invariant theory FOCS Harm Derksen, Emanuele Viola
2022	J	`jnl`	Fooling polynomials using invariant theory. Electron. Colloquium Comput. Complex. Harm Derksen, Emanuele Viola
2022	A	`conf`	Mixing in Non-Quasirandom Groups. ITCS W. T. Gowers, Emanuele Viola
2022	A	`conf`	On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization. ITCS Ronen Shaltiel, Emanuele Viola
2022	J	`jnl`	On correlation bounds against polynomials. Electron. Colloquium Comput. Complex. Peter Ivanov, Liam Pavlovic, Emanuele Viola
2022	J	`jnl`	Pseudorandom Bits and Lower Bounds for Randomized Turing Machines. Theory Comput. Emanuele Viola
2022	J	`jnl`	Quasirandom groups enjoy interleaved mixing. Electron. Colloquium Comput. Complex. Harm Derksen, Emanuele Viola
2021	J	`jnl`	AC0 Unpredictability. ACM Trans. Comput. Theory Emanuele Viola
2021	J	`jnl`	Affine extractors and AC0-Parity. Electron. Colloquium Comput. Complex. Xuangui Huang, Peter Ivanov, Emanuele Viola
2021	Misc	`conf`	Average-Case Rigidity Lower Bounds. CSR Xuangui Huang, Emanuele Viola
2021	A*	`conf`	Fourier Conjectures, Correlation Bounds, and Majority. ICALP Emanuele Viola
2021	—	`conf`	Fourier Growth of Structured 𝔽 APPROX-RANDOM Jaroslaw Blasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, Emanuele Viola
2021	J	`jnl`	Fourier growth of structured $\mathbb{F}_2$-polynomials and applications. CoRR Jaroslaw Blasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, Emanuele Viola
2021	J	`jnl`	Fourier growth of structured 𝔽 Electron. Colloquium Comput. Complex. Jaroslaw Blasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, Emanuele Viola
2021	J	`jnl`	Lower bounds for samplers and data structures via the cell-probe separator. Electron. Colloquium Comput. Complex. Emanuele Viola
2021	J	`jnl`	Mixing in non-quasirandom groups. Electron. Colloquium Comput. Complex. Timothy Gowers, Emanuele Viola
2021	J	`jnl`	On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization. Electron. Colloquium Comput. Complex. Ronen Shaltiel, Emanuele Viola
2020	J	`jnl`	Average-case rigidity lower bounds. Electron. Colloquium Comput. Complex. Xuangui Huang, Emanuele Viola
2020	J	`jnl`	Fourier conjectures, correlation bounds, and Majority. Electron. Colloquium Comput. Complex. Emanuele Viola
2020	A*	`conf`	How to Store a Random Walk. SODA Emanuele Viola, Omri Weinstein, Huacheng Yu
2020	J	`jnl`	More on Bounded Independence Plus Noise: Pseudorandom Generators for Read-Once Polynomials. Theory Comput. Chin Ho Lee, Emanuele Viola
2020	J	`jnl`	New lower bounds for probabilistic degree and AC0 with parity gates. Electron. Colloquium Comput. Complex. Emanuele Viola
2020	J	`jnl`	Sampling Lower Bounds: Boolean Average-Case and Permutations. SIAM J. Comput. Emanuele Viola
2019	J	`jnl`	Approximate Degree-Weight and Indistinguishability. Electron. Colloquium Comput. Complex. Xuangui Huang, Emanuele Viola
2019	J	`jnl`	Bounded Independence versus Symmetric Tests. ACM Trans. Comput. Theory Ravi B. Boppana, Johan Håstad, Chin Ho Lee, Emanuele Viola
2019	J	`jnl`	Constant-Error Pseudorandomness Proofs from Hardness Require Majority. ACM Trans. Comput. Theory Emanuele Viola
2019	J	`jnl`	Guest Column: Non-abelian Combinatorics and Communication Complexity. SIGACT News Emanuele Viola
2019	J	`jnl`	How to Store a Random Walk. CoRR Emanuele Viola, Omri Weinstein, Huacheng Yu
2019	J	`jnl`	Interleaved Group Products. SIAM J. Comput. W. T. Gowers, Emanuele Viola
2019	J	`jnl`	Lower Bounds for Data Structures with Space Close to Maximum Imply Circuit Lower Bounds. Theory Comput. Emanuele Viola
2019	J	`jnl`	Matching Smolensky's correlation bound with majority. Electron. Colloquium Comput. Complex. Emanuele Viola
2019	J	`jnl`	Pseudorandom bits and lower bounds for randomized Turing machines. Electron. Colloquium Comput. Complex. Emanuele Viola
2018	J	`jnl`	AC0 unpredictability. Electron. Colloquium Comput. Complex. Emanuele Viola
2018	J	`jnl`	Bounded Independence Plus Noise Fools Products. SIAM J. Comput. Elad Haramaty, Chin Ho Lee, Emanuele Viola
2018	J	`jnl`	Constant-error pseudorandomness proofs from hardness require majority. Electron. Colloquium Comput. Complex. Emanuele Viola
2018	A*	`conf`	Indistinguishability by Adaptive Procedures with Advice, and Lower Bounds on Hardness Amplification Proofs. FOCS Aryeh Grinberg, Ronen Shaltiel, Emanuele Viola
2018	J	`jnl`	Indistinguishability by adaptive procedures with advice, and lower bounds on hardness amplification proofs. Electron. Colloquium Comput. Complex. Aryeh Grinberg, Ronen Shaltiel, Emanuele Viola
2018	J	`jnl`	Interleaved group products. CoRR W. T. Gowers, Emanuele Viola
2018	J	`jnl`	Local Expanders. Comput. Complex. Emanuele Viola, Avi Wigderson
2018	J	`jnl`	Local reduction. Inf. Comput. Hamidreza Jahanjou, Eric Miles, Emanuele Viola
2018	J	`jnl`	Lower bounds for data structures with space close to maximum imply circuit lower bounds. Electron. Colloquium Comput. Complex. Emanuele Viola
2018	A*	`conf`	Revisiting Frequency Moment Estimation in Random Order Streams. ICALP Vladimir Braverman, Emanuele Viola, David P. Woodruff, Lin F. Yang
2018	J	`jnl`	Revisiting Frequency Moment Estimation in Random Order Streams. CoRR Vladimir Braverman, Emanuele Viola, David P. Woodruff, Lin F. Yang
2018	J	`jnl`	Sampling lower bounds: boolean average-case and permutations. Electron. Colloquium Comput. Complex. Emanuele Viola
2018	J	`jnl`	The Coin Problem for Product Tests. ACM Trans. Comput. Theory Chin Ho Lee, Emanuele Viola
2017	J	`jnl`	A sampling lower bound for permutations. Electron. Colloquium Comput. Complex. Emanuele Viola
2017	J	`jnl`	Block-symmetric polynomials correlate with parity better than symmetric. Comput. Complex. Frederic Green, Daniel Kreymer, Emanuele Viola
2017	A	`conf`	Bounded Independence Plus Noise Fools Products. CCC Elad Haramaty, Chin Ho Lee, Emanuele Viola
2017	J	`jnl`	More on bounded independence plus noise: Pseudorandom generators for read-once polynomials. Electron. Colloquium Comput. Complex. Chin Ho Lee, Emanuele Viola
2017	J	`jnl`	Selected challenges in computational lower bounds. SIGACT News Emanuele Viola
2017	J	`jnl`	Some Limitations of the Sum of Small-Bias Distributions. Theory Comput. Chin Ho Lee, Emanuele Viola
2017	J	`jnl`	The coin problem for product tests. Electron. Colloquium Comput. Complex. Chin Ho Lee, Emanuele Viola
2016	J	`jnl`	3SUM, 3XOR, Triangles. Algorithmica Zahra Jafargholi, Emanuele Viola
2016	—	`conf`	Bounded Independence vs. Moduli. APPROX-RANDOM Ravi B. Boppana, Johan Håstad, Chin Ho Lee, Emanuele Viola
2016	—	`conf`	Bounded Indistinguishability and the Complexity of Recovering Secrets. CRYPTO (3) Andrej Bogdanov, Yuval Ishai, Emanuele Viola, Christopher Williamson
2016	J	`jnl`	Bounded Indistinguishability and the Complexity of Recovering Secrets. IACR Cryptol. ePrint Arch. Andrej Bogdanov, Yuval Ishai, Emanuele Viola, Christopher Williamson
2016	J	`jnl`	Bounded independence plus noise fools products. Electron. Colloquium Comput. Complex. Elad Haramaty, Chin Ho Lee, Emanuele Viola
2016	J	`jnl`	Bounded independence vs. moduli. Electron. Colloquium Comput. Complex. Ravi B. Boppana, Johan Håstad, Chin Ho Lee, Emanuele Viola
2016	J	`jnl`	Local Expanders. Electron. Colloquium Comput. Complex. Emanuele Viola, Avi Wigderson
2016	J	`jnl`	On the complexity of constructing pseudorandom functions (especially when they don't exist). IACR Cryptol. ePrint Arch. Eric Miles, Emanuele Viola
2016	J	`jnl`	Quadratic Maps Are Hard to Sample. ACM Trans. Comput. Theory Emanuele Viola
2016	A*	`conf`	The Multiparty Communication Complexity of Interleaved Group Products. FOCS W. T. Gowers, Emanuele Viola
2016	J	`jnl`	The multiparty communication complexity of interleaved group products. Electron. Colloquium Comput. Complex. Timothy Gowers, Emanuele Viola
2015	J	`jnl`	Bounded Indistinguishability and the Complexity of Recovering Secrets. Electron. Colloquium Comput. Complex. Andrej Bogdanov, Yuval Ishai, Emanuele Viola, Christopher Williamson
2015	—	`conf`	Local Reductions. ICALP (1) Hamid Jahanjou, Eric Miles, Emanuele Viola
2015	A	`conf`	On Randomness Extraction in AC0. CCC Oded Goldreich, Emanuele Viola, Avi Wigderson
2015	J	`jnl`	On Randomness Extraction in AC0. Electron. Colloquium Comput. Complex. Oded Goldreich, Emanuele Viola, Avi Wigderson
2015	J	`jnl`	On the Complexity of Constructing Pseudorandom Functions (Especially when They Don't Exist). J. Cryptol. Eric Miles, Emanuele Viola
2015	J	`jnl`	Quadratic maps are hard to sample. Electron. Colloquium Comput. Complex. Emanuele Viola
2015	J	`jnl`	Some limitations of the sum of small-bias distributions. Electron. Colloquium Comput. Complex. Chin Ho Lee, Emanuele Viola
2015	J	`jnl`	Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs. J. ACM Eric Miles, Emanuele Viola
2015	J	`jnl`	The communication complexity of addition. Comb. Emanuele Viola
2015	A*	`conf`	The communication complexity of interleaved group products. STOC Timothy Gowers, Emanuele Viola
2015	J	`jnl`	The communication complexity of interleaved group products. Electron. Colloquium Comput. Complex. Timothy Gowers, Emanuele Viola
2014	J	`jnl`	Extractors for Circuit Sources. SIAM J. Comput. Emanuele Viola
2014	J	`jnl`	Global Information Sharing under Network Dynamics. CoRR Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola
2014	J	`jnl`	Randomness Buys Depth for Approximate Counting. Comput. Complex. Emanuele Viola
2014	—	`conf`	Short PCPs with Projection Queries. ICALP (1) Eli Ben-Sasson, Emanuele Viola
2014	J	`jnl`	Short PCPs with projection queries. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Emanuele Viola
2014	J	`jnl`	Succinct and explicit circuits for sorting and connectivity. Electron. Colloquium Comput. Complex. Hamidreza Jahanjou, Eric Miles, Emanuele Viola
2013	J	`jnl`	3SUM, 3XOR, Triangles CoRR Zahra Jafargholi, Emanuele Viola
2013	J	`jnl`	3SUM, 3XOR, Triangles. Electron. Colloquium Comput. Complex. Zahra Jafargholi, Emanuele Viola
2013	J	`jnl`	Challenges in computational lower bounds. CoRR Emanuele Viola
2013	J	`jnl`	Challenges in computational lower bounds. Electron. Colloquium Comput. Complex. Emanuele Viola
2013	J	`jnl`	Local reductions. CoRR Hamidreza Jahanjou, Eric Miles, Emanuele Viola
2013	J	`jnl`	Local reductions. Electron. Colloquium Comput. Complex. Hamidreza Jahanjou, Eric Miles, Emanuele Viola
2013	J	`jnl`	On Beating the Hybrid Argument. Theory Comput. Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola
2013	A*	`conf`	On the Complexity of Information Spreading in Dynamic Networks. SODA Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola
2013	J	`jnl`	Real Advantage. ACM Trans. Comput. Theory Alexander A. Razborov, Emanuele Viola
2013	A*	`conf`	Shielding circuits with groups. STOC Eric Miles, Emanuele Viola
2013	J	`jnl`	Shielding circuits with groups. Electron. Colloquium Comput. Complex. Eric Miles, Emanuele Viola
2013	J	`jnl`	Shielding circuits with groups. IACR Cryptol. ePrint Arch. Eric Miles, Emanuele Viola
2013	A*	`conf`	The communication complexity of addition. SODA Emanuele Viola
2013	J	`jnl`	Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates. IEEE Trans. Inf. Theory Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola
2012	J	`jnl`	Bit-Probe Lower Bounds for Succinct Data Structures. SIAM J. Comput. Emanuele Viola
2012	J	`jnl`	Block-symmetric polynomials correlate with parity better than symmetric. Electron. Colloquium Comput. Complex. Frederic Green, Daniel Kreymer, Emanuele Viola
2012	J	`jnl`	Bounded-Depth Circuits Cannot Sample Good Codes. Comput. Complex. Shachar Lovett, Emanuele Viola
2012	—	`conf`	Extractors for Turing-Machine Sources. APPROX-RANDOM Emanuele Viola
2012	J	`jnl`	Extractors for Turing-machine sources. Electron. Colloquium Comput. Complex. Emanuele Viola
2012	J	`jnl`	From RAM to SAT. Electron. Colloquium Comput. Complex. Zahra Jafargholi, Hamidreza Jahanjou, Eric Miles, Jaideep Ramachandran, Emanuele Viola
2012	J	`jnl`	On a special case of rigidity. Electron. Colloquium Comput. Complex. Rocco A. Servedio, Emanuele Viola
2012	A	`conf`	On beating the hybrid argument. ITCS Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola
2012	J	`jnl`	On the complexity of constructing pseudorandom functions (especially when they don't exist). Electron. Colloquium Comput. Complex. Eric Miles, Emanuele Viola
2012	J	`jnl`	Real Advantage. Electron. Colloquium Comput. Complex. Alexander A. Razborov, Emanuele Viola
2012	A*	`conf`	Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs. CRYPTO Eric Miles, Emanuele Viola
2012	J	`jnl`	The Complexity of Distributions. SIAM J. Comput. Emanuele Viola
2012	A*	`conf`	Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. STOC Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola
2011	A	`conf`	Bounded-Depth Circuits Cannot Sample Good Codes. CCC Shachar Lovett, Emanuele Viola
2011	A*	`conf`	Extractors for Circuit Sources. FOCS Emanuele Viola
2011	J	`jnl`	Extractors for circuit sources. Electron. Colloquium Comput. Complex. Emanuele Viola
2011	J	`jnl`	In Brute-Force Search of Correlation Bounds for Polynomials. Electron. Colloquium Comput. Complex. Frederic Green, Daniel Kreymer, Emanuele Viola
2011	B	`conf`	On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators. TCC Eric Miles, Emanuele Viola
2011	A*	`conf`	Randomness Buys Depth for Approximate Counting. FOCS Emanuele Viola
2011	J	`jnl`	Reducing 3XOR to listing triangles, an exposition. Electron. Colloquium Comput. Complex. Emanuele Viola
2011	J	`jnl`	Selected Results in Additive Combinatorics: An Exposition. Theory Comput. Emanuele Viola
2011	J	`jnl`	Special Section on Foundations of Computer Science. SIAM J. Comput. Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola
2011	J	`jnl`	The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs. Electron. Colloquium Comput. Complex. Eric Miles, Emanuele Viola
2011	J	`jnl`	The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs. IACR Cryptol. ePrint Arch. Eric Miles, Emanuele Viola
2011	J	`jnl`	The communication complexity of addition. Electron. Colloquium Comput. Complex. Emanuele Viola
2011	J	`jnl`	Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. Electron. Colloquium Comput. Complex. Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola
2010	J	`jnl`	Bounded Independence Fools Halfspaces. SIAM J. Comput. Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola
2010	J	`jnl`	Bounded-depth circuits cannot sample good codes. Electron. Colloquium Comput. Complex. Shachar Lovett, Emanuele Viola
2010	A*	`conf`	Cell-Probe Lower Bounds for Succinct Partial Sums. SODA Mihai Patrascu, Emanuele Viola
2010	J	`jnl`	Hardness Amplification Proofs Require Majority. SIAM J. Comput. Ronen Shaltiel, Emanuele Viola
2010	J	`jnl`	Is It Real, or Is It Randomized?: A Financial Turing Test CoRR Jasmina Hasanhodzic, Andrew W. Lo, Emanuele Viola
2010	J	`jnl`	On beating the hybrid argument. Electron. Colloquium Comput. Complex. Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola
2010	J	`jnl`	Pseudorandom Bits for Polynomials. SIAM J. Comput. Andrej Bogdanov, Emanuele Viola
2010	J	`jnl`	Randomness buys depth for approximate counting. Electron. Colloquium Comput. Complex. Emanuele Viola
2010	A*	`conf`	The Complexity of Distributions. FOCS Emanuele Viola
2009	J	`jnl`	A Computational View of Market Efficiency CoRR Jasmina Hasanhodzic, Andrew W. Lo, Emanuele Viola
2009	J	`jnl`	Are all distributions easy? Electron. Colloquium Comput. Complex. Emanuele Viola
2009	J	`jnl`	Bit-Probe Lower Bounds for Succinct Data Structures. Electron. Colloquium Comput. Complex. Emanuele Viola
2009	A*	`conf`	Bit-probe lower bounds for succinct data structures. STOC Emanuele Viola
2009	J	`jnl`	Bounded Independence Fools Halfspaces CoRR Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola
2009	A*	`conf`	Bounded Independence Fools Halfspaces. FOCS Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola
2009	J	`jnl`	Bounded Independence Fools Halfspaces. Electron. Colloquium Comput. Complex. Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola
2009	J	`jnl`	Cell-Probe Lower Bounds for Prefix Sums CoRR Emanuele Viola
2009	J	`jnl`	Cell-Probe Lower Bounds for Prefix Sums. Electron. Colloquium Comput. Complex. Emanuele Viola
2009	J	`jnl`	Guest Column: correlation bounds for polynomials over {0 1}. SIGACT News Emanuele Viola
2009	J	`jnl`	Improved Separations between Nondeterministic and Randomized Multiparty Communication. ACM Trans. Comput. Theory Matei David, Toniann Pitassi, Emanuele Viola
2009	J	`jnl`	On Approximate Majority and Probabilistic Time. Comput. Complex. Emanuele Viola
2009	J	`jnl`	On the Power of Small-Depth Computation. Found. Trends Theor. Comput. Sci. Emanuele Viola
2009	J	`jnl`	One-way multiparty communication lower bound for pointer jumping with applications. Comb. Emanuele Viola, Avi Wigderson
2009	J	`jnl`	The Sum of Comput. Complex. Emanuele Viola
2008	A*	`conf`	Hardness amplification proofs require majority. STOC Ronen Shaltiel, Emanuele Viola
2008	—	`conf`	Improved Separations between Nondeterministic and Randomized Multiparty Communication. APPROX-RANDOM Matei David, Toniann Pitassi, Emanuele Viola
2008	J	`jnl`	Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols. Theory Comput. Emanuele Viola, Avi Wigderson
2008	A	`conf`	The Sum of d Small-Bias Generators Fools Polynomials of Degree d. CCC Emanuele Viola
2007	J	`jnl`	Hardness amplification proofs require majority. Electron. Colloquium Comput. Complex. Ronen Shaltiel, Emanuele Viola
2007	A	`conf`	Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols. CCC Emanuele Viola, Avi Wigderson
2007	A	`conf`	On Approximate Majority and Probabilistic Time. CCC Emanuele Viola
2007	A*	`conf`	One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications. FOCS Emanuele Viola, Avi Wigderson
2007	J	`jnl`	One-way multi-party communication lower bound for pointer jumping with applications. Electron. Colloquium Comput. Complex. Emanuele Viola, Avi Wigderson
2007	J	`jnl`	Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates. SIAM J. Comput. Emanuele Viola
2007	A*	`conf`	Pseudorandom Bits for Polynomials. FOCS Andrej Bogdanov, Emanuele Viola
2007	J	`jnl`	Pseudorandom bits for polynomials. Electron. Colloquium Comput. Complex. Andrej Bogdanov, Emanuele Viola
2007	J	`jnl`	Selected Results in Additive Combinatorics: An Exposition. Electron. Colloquium Comput. Complex. Emanuele Viola
2007	J	`jnl`	The sum of d small-bias generators fools polynomials of degree d. Electron. Colloquium Comput. Complex. Emanuele Viola
2006	A	`conf`	Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two. STACS Alexander Healy, Emanuele Viola
2006	J	`jnl`	New correlation bounds for GF(2) polynomials using Gowers uniformity. Electron. Colloquium Comput. Complex. Emanuele Viola
2006	—	`conf`	On Probabilistic Time versus Alternating Time. Complexity of Boolean Functions Emanuele Viola
2006	J	`jnl`	Using Nondeterminism to Amplify Hardness. SIAM J. Comput. Alexander Healy, Salil P. Vadhan, Emanuele Viola
2005	J	`jnl`	Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two Electron. Colloquium Comput. Complex. Alexander Healy, Emanuele Viola
2005	A	`conf`	On Constructing Parallel Pseudorandom Generators from One-Way Functions. CCC Emanuele Viola
2005	J	`jnl`	On Constructing Parallel Pseudorandom Generators from One-Way Functions. IACR Cryptol. ePrint Arch. Emanuele Viola
2005	J	`jnl`	On Probabilistic Time versus Alternating Time Electron. Colloquium Comput. Complex. Emanuele Viola
2005	A	`conf`	Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates. CCC Emanuele Viola
2005	J	`jnl`	Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates Electron. Colloquium Comput. Complex. Emanuele Viola
2005	J	`jnl`	The complexity of constructing pseudorandom generators from hard functions. Comput. Complex. Emanuele Viola
2004	J	`jnl`	Fooling Parity Tests with Parity Gates Electron. Colloquium Comput. Complex. Emanuele Viola, Dan Gutfreund
2004	—	`conf`	Fooling Parity Tests with Parity Gates. APPROX-RANDOM Dan Gutfreund, Emanuele Viola
2004	J	`jnl`	On Parallel Pseudorandom Generators Electron. Colloquium Comput. Complex. Emanuele Viola
2004	J	`jnl`	The Complexity of Constructing Pseudorandom Generators from Hard Functions Electron. Colloquium Comput. Complex. Emanuele Viola
2004	J	`jnl`	Using Nondeterminism to Amplify Hardness Electron. Colloquium Comput. Complex. Alexander Healy, Salil P. Vadhan, Emanuele Viola
2004	A*	`conf`	Using nondeterminism to amplify hardness. STOC Alexander Healy, Salil P. Vadhan, Emanuele Viola
2003	A	`conf`	Hardness vs. Randomness within Alternating Time. CCC Emanuele Viola
2001	—	`conf`	E-unifiability via Narrowing. ICTCS Emanuele Viola

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.