Emanuele Viola
Orcid: 0000-0001-6091-1824Affiliations:
- Northeastern University, Khoury College of Computer Sciences, Boston, MA, USA
- Harvard University, Cambridge, MA, USA (PhD 2006)
According to our database1,
Emanuele Viola
authored at least 105 papers
between 2001 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on ccs.neu.edu
-
on orcid.org
On csauthors.net:
Bibliography
2024
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
Proceedings of the 39th Computational Complexity Conference, 2024
2023
Proceedings of the 38th Computational Complexity Conference, 2023
2022
Electron. Colloquium Comput. Complex., 2022
Electron. Colloquium Comput. Complex., 2022
Electron. Colloquium Comput. Complex., 2022
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
2021
Electron. Colloquium Comput. Complex., 2021
Electron. Colloquium Comput. Complex., 2021
Electron. Colloquium Comput. Complex., 2021
2020
Electron. Colloquium Comput. Complex., 2020
Electron. Colloquium Comput. Complex., 2020
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
2019
SIGACT News, 2019
Electron. Colloquium Comput. Complex., 2019
Electron. Colloquium Comput. Complex., 2019
Electron. Colloquium Comput. Complex., 2019
2018
Lower bounds for data structures with space close to maximum imply circuit lower bounds.
Electron. Colloquium Comput. Complex., 2018
Electron. Colloquium Comput. Complex., 2018
Indistinguishability by adaptive procedures with advice, and lower bounds on hardness amplification proofs.
Electron. Colloquium Comput. Complex., 2018
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
2017
More on bounded independence plus noise: Pseudorandom generators for read-once polynomials.
Electron. Colloquium Comput. Complex., 2017
Comput. Complex., 2017
2016
Electron. Colloquium Comput. Complex., 2016
2015
J. ACM, 2015
Electron. Colloquium Comput. Complex., 2015
Electron. Colloquium Comput. Complex., 2015
Electron. Colloquium Comput. Complex., 2015
2014
Electron. Colloquium Comput. Complex., 2014
2013
Electron. Colloquium Comput. Complex., 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
2012
On the complexity of constructing pseudorandom functions (especially when they don't exist).
Electron. Colloquium Comput. Complex., 2012
2011
Electron. Colloquium Comput. Complex., 2011
Electron. Colloquium Comput. Complex., 2011
The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs.
Electron. Colloquium Comput. Complex., 2011
Electron. Colloquium Comput. Complex., 2011
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates.
Electron. Colloquium Comput. Complex., 2011
On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011
2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
2009
Improved Separations between Nondeterministic and Randomized Multiparty Communication.
ACM Trans. Comput. Theory, 2009
Comb., 2009
Comput. Complex., 2009
2008
Theory Comput., 2008
2007
SIAM J. Comput., 2007
Electron. Colloquium Comput. Complex., 2007
Electron. Colloquium Comput. Complex., 2007
Electron. Colloquium Comput. Complex., 2007
Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 2007
2006
Electron. Colloquium Comput. Complex., 2006
2005
IACR Cryptol. ePrint Arch., 2005
Electron. Colloquium Comput. Complex., 2005
Electron. Colloquium Comput. Complex., 2005
Comput. Complex., 2005
2004
2003
Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003
2001
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001