Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Emanuele Viola
@inproceedings{DBLP:conf/coco/IvanovPV23, author = {Peter Ivanov and Liam Pavlovic and Emanuele Viola}, editor = {Amnon Ta{-}Shma}, title = {On Correlation Bounds Against Polynomials}, booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20, 2023, Warwick, {UK}}, series = {LIPIcs}, volume = {264}, pages = {3:1--3:35}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.CCC.2023.3}, doi = {10.4230/LIPICS.CCC.2023.3}, timestamp = {Mon, 10 Jul 2023 17:09:42 +0200}, biburl = {https://dblp.org/rec/conf/coco/IvanovPV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Viola23, author = {Emanuele Viola}, editor = {Amnon Ta{-}Shma}, title = {New Sampling Lower Bounds via the Separator}, booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20, 2023, Warwick, {UK}}, series = {LIPIcs}, volume = {264}, pages = {26:1--26:23}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.CCC.2023.26}, doi = {10.4230/LIPICS.CCC.2023.26}, timestamp = {Mon, 10 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/Viola23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/IvanovMV23, author = {Peter Ivanov and Raghu Meka and Emanuele Viola}, editor = {Nikhil Bansal and Viswanath Nagarajan}, title = {Efficient resilient functions}, booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2023, Florence, Italy, January 22-25, 2023}, pages = {2867--2874}, publisher = {{SIAM}}, year = {2023}, url = {https://doi.org/10.1137/1.9781611977554.ch108}, doi = {10.1137/1.9781611977554.CH108}, timestamp = {Fri, 17 Feb 2023 09:28:57 +0100}, biburl = {https://dblp.org/rec/conf/soda/IvanovMV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2311-09370, author = {Peter Ivanov and Liam Pavlovic and Emanuele Viola}, title = {On correlation bounds against polynomials}, journal = {CoRR}, volume = {abs/2311.09370}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2311.09370}, doi = {10.48550/ARXIV.2311.09370}, eprinttype = {arXiv}, eprint = {2311.09370}, timestamp = {Tue, 21 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2311-09370.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2311-11663, author = {Ronen Shaltiel and Emanuele Viola}, title = {On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization}, journal = {CoRR}, volume = {abs/2311.11663}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2311.11663}, doi = {10.48550/ARXIV.2311.11663}, eprinttype = {arXiv}, eprint = {2311.11663}, timestamp = {Thu, 23 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2311-11663.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/Viola22, author = {Emanuele Viola}, title = {Pseudorandom Bits and Lower Bounds for Randomized Turing Machines}, journal = {Theory Comput.}, volume = {18}, pages = {1--12}, year = {2022}, url = {https://theoryofcomputing.org/articles/v018a010/}, timestamp = {Thu, 02 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/toc/Viola22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/HuangV22, author = {Xuangui Huang and Emanuele Viola}, title = {Approximate Degree, Weight, and Indistinguishability}, journal = {{ACM} Trans. Comput. Theory}, volume = {14}, number = {1}, pages = {3:1--3:26}, year = {2022}, url = {https://doi.org/10.1145/3492338}, doi = {10.1145/3492338}, timestamp = {Wed, 18 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/HuangV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/HuangIV22, author = {Xuangui Huang and Peter Ivanov and Emanuele Viola}, editor = {Amit Chakrabarti and Chaitanya Swamy}, title = {Affine Extractors and AC0-Parity}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, {USA} (Virtual Conference)}, series = {LIPIcs}, volume = {245}, pages = {9:1--9:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.9}, doi = {10.4230/LIPICS.APPROX/RANDOM.2022.9}, timestamp = {Mon, 26 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/HuangIV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DerksenV22, author = {Harm Derksen and Emanuele Viola}, title = {Fooling polynomials using invariant theory\({}^{\mbox{*}}\)}, booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2022, Denver, CO, USA, October 31 - November 3, 2022}, pages = {399--406}, publisher = {{IEEE}}, year = {2022}, url = {https://doi.org/10.1109/FOCS54457.2022.00045}, doi = {10.1109/FOCS54457.2022.00045}, timestamp = {Sat, 31 Dec 2022 17:14:50 +0100}, biburl = {https://dblp.org/rec/conf/focs/DerksenV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/0001V22, author = {W. T. Gowers and Emanuele Viola}, editor = {Mark Braverman}, title = {Mixing in Non-Quasirandom Groups}, booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS} 2022, January 31 - February 3, 2022, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {215}, pages = {80:1--80:9}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.80}, doi = {10.4230/LIPICS.ITCS.2022.80}, timestamp = {Wed, 26 Jan 2022 14:33:51 +0100}, biburl = {https://dblp.org/rec/conf/innovations/0001V22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/ShaltielV22, author = {Ronen Shaltiel and Emanuele Viola}, editor = {Mark Braverman}, title = {On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization}, booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS} 2022, January 31 - February 3, 2022, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {215}, pages = {116:1--116:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.116}, doi = {10.4230/LIPICS.ITCS.2022.116}, timestamp = {Wed, 26 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/ShaltielV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DerksenV22, author = {Harm Derksen and Emanuele Viola}, title = {Quasirandom groups enjoy interleaved mixing}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR22-091}}, year = {2022}, url = {https://eccc.weizmann.ac.il/report/2022/091}, eprinttype = {ECCC}, eprint = {TR22-091}, timestamp = {Mon, 11 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DerksenV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DerksenV22a, author = {Harm Derksen and Emanuele Viola}, title = {Fooling polynomials using invariant theory}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR22-132}}, year = {2022}, url = {https://eccc.weizmann.ac.il/report/2022/132}, eprinttype = {ECCC}, eprint = {TR22-132}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DerksenV22a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/IvanovMV22, author = {Peter Ivanov and Raghu Meka and Emanuele Viola}, title = {Efficient resilient functions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR22-148}}, year = {2022}, url = {https://eccc.weizmann.ac.il/report/2022/148}, eprinttype = {ECCC}, eprint = {TR22-148}, timestamp = {Fri, 10 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eccc/IvanovMV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/IvanovPV22, author = {Peter Ivanov and Liam Pavlovic and Emanuele Viola}, title = {On correlation bounds against polynomials}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR22-092}}, year = {2022}, url = {https://eccc.weizmann.ac.il/report/2022/092}, eprinttype = {ECCC}, eprint = {TR22-092}, timestamp = {Mon, 11 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/IvanovPV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola22, author = {Emanuele Viola}, title = {Correlation bounds against polynomials}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR22-142}}, year = {2022}, url = {https://eccc.weizmann.ac.il/report/2022/142}, eprinttype = {ECCC}, eprint = {TR22-142}, timestamp = {Fri, 10 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eccc/Viola22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/Viola21, author = {Emanuele Viola}, title = {{AC0} Unpredictability}, journal = {{ACM} Trans. Comput. Theory}, volume = {13}, number = {1}, pages = {5:1--5:8}, year = {2021}, url = {https://doi.org/10.1145/3442362}, doi = {10.1145/3442362}, timestamp = {Mon, 26 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/Viola21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/BlasiokIJLSV21, author = {Jaroslaw Blasiok and Peter Ivanov and Yaonan Jin and Chin Ho Lee and Rocco A. Servedio and Emanuele Viola}, editor = {Mary Wootters and Laura Sanit{\`{a}}}, title = {Fourier Growth of Structured {\(\mathbb{F}\)}\({}_{\mbox{2}}\)-Polynomials and Applications}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2021, August 16-18, 2021, University of Washington, Seattle, Washington, {USA} (Virtual Conference)}, series = {LIPIcs}, volume = {207}, pages = {53:1--53:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.53}, doi = {10.4230/LIPICS.APPROX/RANDOM.2021.53}, timestamp = {Tue, 21 Sep 2021 09:36:32 +0200}, biburl = {https://dblp.org/rec/conf/approx/BlasiokIJLSV21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csr/HuangV21, author = {Xuangui Huang and Emanuele Viola}, editor = {Rahul Santhanam and Daniil Musatov}, title = {Average-Case Rigidity Lower Bounds}, booktitle = {Computer Science - Theory and Applications - 16th International Computer Science Symposium in Russia, {CSR} 2021, Sochi, Russia, June 28 - July 2, 2021, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {12730}, pages = {186--205}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-79416-3\_11}, doi = {10.1007/978-3-030-79416-3\_11}, timestamp = {Thu, 17 Jun 2021 14:43:33 +0200}, biburl = {https://dblp.org/rec/conf/csr/HuangV21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Viola21, author = {Emanuele Viola}, editor = {Nikhil Bansal and Emanuela Merelli and James Worrell}, title = {Fourier Conjectures, Correlation Bounds, and Majority}, booktitle = {48th International Colloquium on Automata, Languages, and Programming, {ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)}, series = {LIPIcs}, volume = {198}, pages = {111:1--111:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.111}, doi = {10.4230/LIPICS.ICALP.2021.111}, timestamp = {Tue, 15 Feb 2022 07:54:27 +0100}, biburl = {https://dblp.org/rec/conf/icalp/Viola21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2107-10797, author = {Jaroslaw Blasiok and Peter Ivanov and Yaonan Jin and Chin Ho Lee and Rocco A. Servedio and Emanuele Viola}, title = {Fourier growth of structured {\textdollar}{\textbackslash}mathbb\{F\}{\_}2{\textdollar}-polynomials and applications}, journal = {CoRR}, volume = {abs/2107.10797}, year = {2021}, url = {https://arxiv.org/abs/2107.10797}, eprinttype = {arXiv}, eprint = {2107.10797}, timestamp = {Thu, 29 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2107-10797.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BlasiokIJLSV21, author = {Jaroslaw Blasiok and Peter Ivanov and Yaonan Jin and Chin Ho Lee and Rocco A. Servedio and Emanuele Viola}, title = {Fourier growth of structured {\(\mathbb{F}\)}\({}_{\mbox{2}}\)-polynomials and applications}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR21-110}}, year = {2021}, url = {https://eccc.weizmann.ac.il/report/2021/110}, eprinttype = {ECCC}, eprint = {TR21-110}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BlasiokIJLSV21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GowersV21, author = {Timothy Gowers and Emanuele Viola}, title = {Mixing in non-quasirandom groups}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR21-017}}, year = {2021}, url = {https://eccc.weizmann.ac.il/report/2021/017}, eprinttype = {ECCC}, eprint = {TR21-017}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GowersV21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HuangIV21, author = {Xuangui Huang and Peter Ivanov and Emanuele Viola}, title = {Affine extractors and AC0-Parity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR21-137}}, year = {2021}, url = {https://eccc.weizmann.ac.il/report/2021/137}, eprinttype = {ECCC}, eprint = {TR21-137}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HuangIV21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ShaltielV21, author = {Ronen Shaltiel and Emanuele Viola}, title = {On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR21-153}}, year = {2021}, url = {https://eccc.weizmann.ac.il/report/2021/153}, eprinttype = {ECCC}, eprint = {TR21-153}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ShaltielV21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola21, author = {Emanuele Viola}, title = {Lower bounds for samplers and data structures via the cell-probe separator}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR21-073}}, year = {2021}, url = {https://eccc.weizmann.ac.il/report/2021/073}, eprinttype = {ECCC}, eprint = {TR21-073}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Viola20, author = {Emanuele Viola}, title = {Sampling Lower Bounds: Boolean Average-Case and Permutations}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {1}, pages = {119--137}, year = {2020}, url = {https://doi.org/10.1137/18M1198405}, doi = {10.1137/18M1198405}, timestamp = {Wed, 11 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/Viola20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/LeeV20, author = {Chin Ho Lee and Emanuele Viola}, title = {More on Bounded Independence Plus Noise: Pseudorandom Generators for Read-Once Polynomials}, journal = {Theory Comput.}, volume = {16}, pages = {1--50}, year = {2020}, url = {https://doi.org/10.4086/toc.2020.v016a007}, doi = {10.4086/TOC.2020.V016A007}, timestamp = {Wed, 10 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/toc/LeeV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ViolaWY20, author = {Emanuele Viola and Omri Weinstein and Huacheng Yu}, editor = {Shuchi Chawla}, title = {How to Store a Random Walk}, booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020}, pages = {426--445}, publisher = {{SIAM}}, year = {2020}, url = {https://doi.org/10.1137/1.9781611975994.26}, doi = {10.1137/1.9781611975994.26}, timestamp = {Thu, 15 Jul 2021 13:48:53 +0200}, biburl = {https://dblp.org/rec/conf/soda/ViolaWY20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HuangV20, author = {Xuangui Huang and Emanuele Viola}, title = {Average-case rigidity lower bounds}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR20-193}}, year = {2020}, url = {https://eccc.weizmann.ac.il/report/2020/193}, eprinttype = {ECCC}, eprint = {TR20-193}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HuangV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola20, author = {Emanuele Viola}, title = {New lower bounds for probabilistic degree and {AC0} with parity gates}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR20-015}}, year = {2020}, url = {https://eccc.weizmann.ac.il/report/2020/015}, eprinttype = {ECCC}, eprint = {TR20-015}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola20a, author = {Emanuele Viola}, title = {Fourier conjectures, correlation bounds, and Majority}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR20-175}}, year = {2020}, url = {https://eccc.weizmann.ac.il/report/2020/175}, eprinttype = {ECCC}, eprint = {TR20-175}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola20a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/GowersV19, author = {W. T. Gowers and Emanuele Viola}, title = {Interleaved Group Products}, journal = {{SIAM} J. Comput.}, volume = {48}, number = {2}, pages = {554--580}, year = {2019}, url = {https://doi.org/10.1137/17M1126783}, doi = {10.1137/17M1126783}, timestamp = {Fri, 12 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/GowersV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/Viola19, author = {Emanuele Viola}, title = {Guest Column: Non-abelian Combinatorics and Communication Complexity}, journal = {{SIGACT} News}, volume = {50}, number = {3}, pages = {52--74}, year = {2019}, url = {https://doi.org/10.1145/3364626.3364637}, doi = {10.1145/3364626.3364637}, timestamp = {Mon, 14 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigact/Viola19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/Viola19, author = {Emanuele Viola}, title = {Lower Bounds for Data Structures with Space Close to Maximum Imply Circuit Lower Bounds}, journal = {Theory Comput.}, volume = {15}, pages = {1--9}, year = {2019}, url = {https://doi.org/10.4086/toc.2019.v015a018}, doi = {10.4086/TOC.2019.V015A018}, timestamp = {Tue, 09 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/toc/Viola19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/Viola19, author = {Emanuele Viola}, title = {Constant-Error Pseudorandomness Proofs from Hardness Require Majority}, journal = {{ACM} Trans. Comput. Theory}, volume = {11}, number = {4}, pages = {19:1--19:11}, year = {2019}, url = {https://doi.org/10.1145/3322815}, doi = {10.1145/3322815}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/Viola19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/BoppanaHLV19, author = {Ravi B. Boppana and Johan H{\aa}stad and Chin Ho Lee and Emanuele Viola}, title = {Bounded Independence versus Symmetric Tests}, journal = {{ACM} Trans. Comput. Theory}, volume = {11}, number = {4}, pages = {21:1--21:27}, year = {2019}, url = {https://doi.org/10.1145/3337783}, doi = {10.1145/3337783}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/BoppanaHLV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1907-10874, author = {Emanuele Viola and Omri Weinstein and Huacheng Yu}, title = {How to Store a Random Walk}, journal = {CoRR}, volume = {abs/1907.10874}, year = {2019}, url = {http://arxiv.org/abs/1907.10874}, eprinttype = {arXiv}, eprint = {1907.10874}, timestamp = {Thu, 01 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1907-10874.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HuangV19, author = {Xuangui Huang and Emanuele Viola}, title = {Approximate Degree-Weight and Indistinguishability}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR19-085}}, year = {2019}, url = {https://eccc.weizmann.ac.il/report/2019/085}, eprinttype = {ECCC}, eprint = {TR19-085}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HuangV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola19, author = {Emanuele Viola}, title = {Pseudorandom bits and lower bounds for randomized Turing machines}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR19-051}}, year = {2019}, url = {https://eccc.weizmann.ac.il/report/2019/051}, eprinttype = {ECCC}, eprint = {TR19-051}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola19a, author = {Emanuele Viola}, title = {Matching Smolensky's correlation bound with majority}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR19-175}}, year = {2019}, url = {https://eccc.weizmann.ac.il/report/2019/175}, eprinttype = {ECCC}, eprint = {TR19-175}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola19a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/ViolaW18, author = {Emanuele Viola and Avi Wigderson}, title = {Local Expanders}, journal = {Comput. Complex.}, volume = {27}, number = {2}, pages = {225--244}, year = {2018}, url = {https://doi.org/10.1007/s00037-017-0155-1}, doi = {10.1007/S00037-017-0155-1}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/ViolaW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/JahanjouMV18, author = {Hamidreza Jahanjou and Eric Miles and Emanuele Viola}, title = {Local reduction}, journal = {Inf. Comput.}, volume = {261}, pages = {281--295}, year = {2018}, url = {https://doi.org/10.1016/j.ic.2018.02.009}, doi = {10.1016/J.IC.2018.02.009}, timestamp = {Tue, 03 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/JahanjouMV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HaramatyLV18, author = {Elad Haramaty and Chin Ho Lee and Emanuele Viola}, title = {Bounded Independence Plus Noise Fools Products}, journal = {{SIAM} J. Comput.}, volume = {47}, number = {2}, pages = {493--523}, year = {2018}, url = {https://doi.org/10.1137/17M1129088}, doi = {10.1137/17M1129088}, timestamp = {Wed, 23 May 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HaramatyLV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/LeeV18, author = {Chin Ho Lee and Emanuele Viola}, title = {The Coin Problem for Product Tests}, journal = {{ACM} Trans. Comput. Theory}, volume = {10}, number = {3}, pages = {14:1--14:10}, year = {2018}, url = {https://doi.org/10.1145/3201787}, doi = {10.1145/3201787}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/LeeV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/GrinbergSV18, author = {Aryeh Grinberg and Ronen Shaltiel and Emanuele Viola}, editor = {Mikkel Thorup}, title = {Indistinguishability by Adaptive Procedures with Advice, and Lower Bounds on Hardness Amplification Proofs}, booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2018, Paris, France, October 7-9, 2018}, pages = {956--966}, publisher = {{IEEE} Computer Society}, year = {2018}, url = {https://doi.org/10.1109/FOCS.2018.00094}, doi = {10.1109/FOCS.2018.00094}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/GrinbergSV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BravermanVWY18, author = {Vladimir Braverman and Emanuele Viola and David P. Woodruff and Lin F. Yang}, editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'{a}}niel Marx and Donald Sannella}, title = {Revisiting Frequency Moment Estimation in Random Order Streams}, booktitle = {45th International Colloquium on Automata, Languages, and Programming, {ICALP} 2018, July 9-13, 2018, Prague, Czech Republic}, series = {LIPIcs}, volume = {107}, pages = {25:1--25:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.25}, doi = {10.4230/LIPICS.ICALP.2018.25}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BravermanVWY18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1803-02270, author = {Vladimir Braverman and Emanuele Viola and David P. Woodruff and Lin F. Yang}, title = {Revisiting Frequency Moment Estimation in Random Order Streams}, journal = {CoRR}, volume = {abs/1803.02270}, year = {2018}, url = {http://arxiv.org/abs/1803.02270}, eprinttype = {arXiv}, eprint = {1803.02270}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1803-02270.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1804-09787, author = {W. T. Gowers and Emanuele Viola}, title = {Interleaved group products}, journal = {CoRR}, volume = {abs/1804.09787}, year = {2018}, url = {http://arxiv.org/abs/1804.09787}, eprinttype = {arXiv}, eprint = {1804.09787}, timestamp = {Fri, 12 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1804-09787.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GrinbergSV18, author = {Aryeh Grinberg and Ronen Shaltiel and Emanuele Viola}, title = {Indistinguishability by adaptive procedures with advice, and lower bounds on hardness amplification proofs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-061}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/061}, eprinttype = {ECCC}, eprint = {TR18-061}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GrinbergSV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola18, author = {Emanuele Viola}, title = {Sampling lower bounds: boolean average-case and permutations}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-060}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/060}, eprinttype = {ECCC}, eprint = {TR18-060}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola18a, author = {Emanuele Viola}, title = {Constant-error pseudorandomness proofs from hardness require majority}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-133}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/133}, eprinttype = {ECCC}, eprint = {TR18-133}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola18a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola18b, author = {Emanuele Viola}, title = {Lower bounds for data structures with space close to maximum imply circuit lower bounds}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-186}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/186}, eprinttype = {ECCC}, eprint = {TR18-186}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola18b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola18c, author = {Emanuele Viola}, title = {{AC0} unpredictability}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-209}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/209}, eprinttype = {ECCC}, eprint = {TR18-209}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola18c.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/GreenKV17, author = {Frederic Green and Daniel Kreymer and Emanuele Viola}, title = {Block-symmetric polynomials correlate with parity better than symmetric}, journal = {Comput. Complex.}, volume = {26}, number = {2}, pages = {323--364}, year = {2017}, url = {https://doi.org/10.1007/s00037-017-0153-3}, doi = {10.1007/S00037-017-0153-3}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/GreenKV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/Viola17, author = {Emanuele Viola}, title = {Selected challenges in computational lower bounds}, journal = {{SIGACT} News}, volume = {48}, number = {1}, pages = {39--45}, year = {2017}, url = {https://doi.org/10.1145/3061640.3061648}, doi = {10.1145/3061640.3061648}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/sigact/Viola17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/LeeV17, author = {Chin Ho Lee and Emanuele Viola}, title = {Some Limitations of the Sum of Small-Bias Distributions}, journal = {Theory Comput.}, volume = {13}, number = {1}, pages = {1--23}, year = {2017}, url = {https://doi.org/10.4086/toc.2017.v013a016}, doi = {10.4086/TOC.2017.V013A016}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/LeeV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/HaramatyLV17, author = {Elad Haramaty and Chin Ho Lee and Emanuele Viola}, editor = {Ryan O'Donnell}, title = {Bounded Independence Plus Noise Fools Products}, booktitle = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017, Riga, Latvia}, series = {LIPIcs}, volume = {79}, pages = {14:1--14:30}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CCC.2017.14}, doi = {10.4230/LIPICS.CCC.2017.14}, timestamp = {Thu, 02 Feb 2023 13:27:05 +0100}, biburl = {https://dblp.org/rec/conf/coco/HaramatyLV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LeeV17, author = {Chin Ho Lee and Emanuele Viola}, title = {The coin problem for product tests}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-090}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/090}, eprinttype = {ECCC}, eprint = {TR17-090}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LeeV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LeeV17a, author = {Chin Ho Lee and Emanuele Viola}, title = {More on bounded independence plus noise: Pseudorandom generators for read-once polynomials}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-167}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/167}, eprinttype = {ECCC}, eprint = {TR17-167}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LeeV17a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola17, author = {Emanuele Viola}, title = {A sampling lower bound for permutations}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-166}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/166}, eprinttype = {ECCC}, eprint = {TR17-166}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/JafargholiV16, author = {Zahra Jafargholi and Emanuele Viola}, title = {3SUM, 3XOR, Triangles}, journal = {Algorithmica}, volume = {74}, number = {1}, pages = {326--343}, year = {2016}, url = {https://doi.org/10.1007/s00453-014-9946-9}, doi = {10.1007/S00453-014-9946-9}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/JafargholiV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/Viola16, author = {Emanuele Viola}, title = {Quadratic Maps Are Hard to Sample}, journal = {{ACM} Trans. Comput. Theory}, volume = {8}, number = {4}, pages = {18:1--18:4}, year = {2016}, url = {https://doi.org/10.1145/2934308}, doi = {10.1145/2934308}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/Viola16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/BoppanaHLV16, author = {Ravi B. Boppana and Johan H{\aa}stad and Chin Ho Lee and Emanuele Viola}, editor = {Klaus Jansen and Claire Mathieu and Jos{\'{e}} D. P. Rolim and Chris Umans}, title = {Bounded Independence vs. Moduli}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris, France}, series = {LIPIcs}, volume = {60}, pages = {24:1--24:9}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.24}, doi = {10.4230/LIPICS.APPROX-RANDOM.2016.24}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/BoppanaHLV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/crypto/BogdanovIVW16, author = {Andrej Bogdanov and Yuval Ishai and Emanuele Viola and Christopher Williamson}, editor = {Matthew Robshaw and Jonathan Katz}, title = {Bounded Indistinguishability and the Complexity of Recovering Secrets}, booktitle = {Advances in Cryptology - {CRYPTO} 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part {III}}, series = {Lecture Notes in Computer Science}, volume = {9816}, pages = {593--618}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53015-3\_21}, doi = {10.1007/978-3-662-53015-3\_21}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/crypto/BogdanovIVW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/GowersV16, author = {W. T. Gowers and Emanuele Viola}, editor = {Irit Dinur}, title = {The Multiparty Communication Complexity of Interleaved Group Products}, booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS} 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, {USA}}, pages = {289--294}, publisher = {{IEEE} Computer Society}, year = {2016}, url = {https://doi.org/10.1109/FOCS.2016.39}, doi = {10.1109/FOCS.2016.39}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/GowersV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BoppanaHLV16, author = {Ravi B. Boppana and Johan H{\aa}stad and Chin Ho Lee and Emanuele Viola}, title = {Bounded independence vs. moduli}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-102}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/102}, eprinttype = {ECCC}, eprint = {TR16-102}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BoppanaHLV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GowersV16, author = {Timothy Gowers and Emanuele Viola}, title = {The multiparty communication complexity of interleaved group products}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-127}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/127}, eprinttype = {ECCC}, eprint = {TR16-127}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GowersV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HaramatyLV16, author = {Elad Haramaty and Chin Ho Lee and Emanuele Viola}, title = {Bounded independence plus noise fools products}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-169}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/169}, eprinttype = {ECCC}, eprint = {TR16-169}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HaramatyLV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ViolaW16, author = {Emanuele Viola and Avi Wigderson}, title = {Local Expanders}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-129}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/129}, eprinttype = {ECCC}, eprint = {TR16-129}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ViolaW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/MilesV16, author = {Eric Miles and Emanuele Viola}, title = {On the complexity of constructing pseudorandom functions (especially when they don't exist)}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {343}, year = {2016}, url = {http://eprint.iacr.org/2016/343}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/MilesV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/BogdanovIVW16, author = {Andrej Bogdanov and Yuval Ishai and Emanuele Viola and Christopher Williamson}, title = {Bounded Indistinguishability and the Complexity of Recovering Secrets}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {565}, year = {2016}, url = {http://eprint.iacr.org/2016/565}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/BogdanovIVW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/Viola15, author = {Emanuele Viola}, title = {The communication complexity of addition}, journal = {Comb.}, volume = {35}, number = {6}, pages = {703--747}, year = {2015}, url = {https://doi.org/10.1007/s00493-014-3078-3}, doi = {10.1007/S00493-014-3078-3}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/Viola15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/MilesV15, author = {Eric Miles and Emanuele Viola}, title = {Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs}, journal = {J. {ACM}}, volume = {62}, number = {6}, pages = {46:1--46:29}, year = {2015}, url = {https://doi.org/10.1145/2792978}, doi = {10.1145/2792978}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jacm/MilesV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/joc/MilesV15, author = {Eric Miles and Emanuele Viola}, title = {On the Complexity of Constructing Pseudorandom Functions (Especially when They Don't Exist)}, journal = {J. Cryptol.}, volume = {28}, number = {3}, pages = {509--532}, year = {2015}, url = {https://doi.org/10.1007/s00145-013-9161-x}, doi = {10.1007/S00145-013-9161-X}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/joc/MilesV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/GoldreichVW15, author = {Oded Goldreich and Emanuele Viola and Avi Wigderson}, editor = {David Zuckerman}, title = {On Randomness Extraction in {AC0}}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {601--668}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.601}, doi = {10.4230/LIPICS.CCC.2015.601}, timestamp = {Thu, 02 Feb 2023 13:27:06 +0100}, biburl = {https://dblp.org/rec/conf/coco/GoldreichVW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/JahanjouMV15, author = {Hamid Jahanjou and Eric Miles and Emanuele Viola}, editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and Kazuo Iwama and Naoki Kobayashi and Bettina Speckmann}, title = {Local Reductions}, booktitle = {Automata, Languages, and Programming - 42nd International Colloquium, {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {9134}, pages = {749--760}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-47672-7\_61}, doi = {10.1007/978-3-662-47672-7\_61}, timestamp = {Fri, 27 Mar 2020 09:02:59 +0100}, biburl = {https://dblp.org/rec/conf/icalp/JahanjouMV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GowersV15, author = {Timothy Gowers and Emanuele Viola}, editor = {Rocco A. Servedio and Ronitt Rubinfeld}, title = {The communication complexity of interleaved group products}, booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015}, pages = {351--360}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2746539.2746560}, doi = {10.1145/2746539.2746560}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GowersV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BogdanovIVW15, author = {Andrej Bogdanov and Yuval Ishai and Emanuele Viola and Christopher Williamson}, title = {Bounded Indistinguishability and the Complexity of Recovering Secrets}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-182}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/182}, eprinttype = {ECCC}, eprint = {TR15-182}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BogdanovIVW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GoldreichVW15, author = {Oded Goldreich and Emanuele Viola and Avi Wigderson}, title = {On Randomness Extraction in {AC0}}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-003}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/003}, eprinttype = {ECCC}, eprint = {TR15-003}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GoldreichVW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GowersV15, author = {Timothy Gowers and Emanuele Viola}, title = {The communication complexity of interleaved group products}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-044}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/044}, eprinttype = {ECCC}, eprint = {TR15-044}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GowersV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LeeV15, author = {Chin Ho Lee and Emanuele Viola}, title = {Some limitations of the sum of small-bias distributions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-005}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/005}, eprinttype = {ECCC}, eprint = {TR15-005}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LeeV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola15, author = {Emanuele Viola}, title = {Quadratic maps are hard to sample}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-205}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/205}, eprinttype = {ECCC}, eprint = {TR15-205}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Viola14, author = {Emanuele Viola}, title = {Randomness Buys Depth for Approximate Counting}, journal = {Comput. Complex.}, volume = {23}, number = {3}, pages = {479--508}, year = {2014}, url = {https://doi.org/10.1007/s00037-013-0076-6}, doi = {10.1007/S00037-013-0076-6}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Viola14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Viola14, author = {Emanuele Viola}, title = {Extractors for Circuit Sources}, journal = {{SIAM} J. Comput.}, volume = {43}, number = {2}, pages = {655--672}, year = {2014}, url = {https://doi.org/10.1137/11085983X}, doi = {10.1137/11085983X}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Viola14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Ben-SassonV14, author = {Eli Ben{-}Sasson and Emanuele Viola}, editor = {Javier Esparza and Pierre Fraigniaud and Thore Husfeldt and Elias Koutsoupias}, title = {Short PCPs with Projection Queries}, booktitle = {Automata, Languages, and Programming - 41st International Colloquium, {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {8572}, pages = {163--173}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-43948-7\_14}, doi = {10.1007/978-3-662-43948-7\_14}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Ben-SassonV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/DuttaPRSV14, author = {Chinmoy Dutta and Gopal Pandurangan and Rajmohan Rajaraman and Zhifeng Sun and Emanuele Viola}, title = {Global Information Sharing under Network Dynamics}, journal = {CoRR}, volume = {abs/1409.7771}, year = {2014}, url = {http://arxiv.org/abs/1409.7771}, eprinttype = {arXiv}, eprint = {1409.7771}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/DuttaPRSV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonV14, author = {Eli Ben{-}Sasson and Emanuele Viola}, title = {Short PCPs with projection queries}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-017}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/017}, eprinttype = {ECCC}, eprint = {TR14-017}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/JahanjouMV14, author = {Hamidreza Jahanjou and Eric Miles and Emanuele Viola}, title = {Succinct and explicit circuits for sorting and connectivity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-037}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/037}, eprinttype = {ECCC}, eprint = {TR14-037}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/JahanjouMV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/GalHKPV13, author = {Anna G{\'{a}}l and Kristoffer Arnsfelt Hansen and Michal Kouck{\'{y}} and Pavel Pudl{\'{a}}k and Emanuele Viola}, title = {Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates}, journal = {{IEEE} Trans. Inf. Theory}, volume = {59}, number = {10}, pages = {6611--6627}, year = {2013}, url = {https://doi.org/10.1109/TIT.2013.2270275}, doi = {10.1109/TIT.2013.2270275}, timestamp = {Thu, 02 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tit/GalHKPV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/FeffermanSUV13, author = {Bill Fefferman and Ronen Shaltiel and Christopher Umans and Emanuele Viola}, title = {On Beating the Hybrid Argument}, journal = {Theory Comput.}, volume = {9}, pages = {809--843}, year = {2013}, url = {https://doi.org/10.4086/toc.2013.v009a026}, doi = {10.4086/TOC.2013.V009A026}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/FeffermanSUV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/RazborovV13, author = {Alexander A. Razborov and Emanuele Viola}, title = {Real Advantage}, journal = {{ACM} Trans. Comput. Theory}, volume = {5}, number = {4}, pages = {17:1--17:8}, year = {2013}, url = {https://doi.org/10.1145/2540089}, doi = {10.1145/2540089}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/RazborovV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Viola13, author = {Emanuele Viola}, editor = {Sanjeev Khanna}, title = {The communication complexity of addition}, booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8, 2013}, pages = {632--651}, publisher = {{SIAM}}, year = {2013}, url = {https://doi.org/10.1137/1.9781611973105.46}, doi = {10.1137/1.9781611973105.46}, timestamp = {Tue, 02 Feb 2021 17:07:29 +0100}, biburl = {https://dblp.org/rec/conf/soda/Viola13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DuttaPRSV13, author = {Chinmoy Dutta and Gopal Pandurangan and Rajmohan Rajaraman and Zhifeng Sun and Emanuele Viola}, editor = {Sanjeev Khanna}, title = {On the Complexity of Information Spreading in Dynamic Networks}, booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8, 2013}, pages = {717--736}, publisher = {{SIAM}}, year = {2013}, url = {https://doi.org/10.1137/1.9781611973105.52}, doi = {10.1137/1.9781611973105.52}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/DuttaPRSV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/MilesV13, author = {Eric Miles and Emanuele Viola}, editor = {Dan Boneh and Tim Roughgarden and Joan Feigenbaum}, title = {Shielding circuits with groups}, booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013}, pages = {251--260}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2488608.2488640}, doi = {10.1145/2488608.2488640}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/MilesV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1305-3827, author = {Zahra Jafargholi and Emanuele Viola}, title = {3SUM, 3XOR, Triangles}, journal = {CoRR}, volume = {abs/1305.3827}, year = {2013}, url = {http://arxiv.org/abs/1305.3827}, eprinttype = {arXiv}, eprint = {1305.3827}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1305-3827.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/JahanjouMV13, author = {Hamidreza Jahanjou and Eric Miles and Emanuele Viola}, title = {Local reductions}, journal = {CoRR}, volume = {abs/1311.3171}, year = {2013}, url = {http://arxiv.org/abs/1311.3171}, eprinttype = {arXiv}, eprint = {1311.3171}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/JahanjouMV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Viola13, author = {Emanuele Viola}, title = {Challenges in computational lower bounds}, journal = {CoRR}, volume = {abs/1311.5467}, year = {2013}, url = {http://arxiv.org/abs/1311.5467}, eprinttype = {arXiv}, eprint = {1311.5467}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Viola13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/JafargholiV13, author = {Zahra Jafargholi and Emanuele Viola}, title = {3SUM, 3XOR, Triangles}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-009}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/009}, eprinttype = {ECCC}, eprint = {TR13-009}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/JafargholiV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/JahanjouMV13, author = {Hamidreza Jahanjou and Eric Miles and Emanuele Viola}, title = {Local reductions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-099}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/099}, eprinttype = {ECCC}, eprint = {TR13-099}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/JahanjouMV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/MilesV13, author = {Eric Miles and Emanuele Viola}, title = {Shielding circuits with groups}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-003}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/003}, eprinttype = {ECCC}, eprint = {TR13-003}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/MilesV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola13, author = {Emanuele Viola}, title = {Challenges in computational lower bounds}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-119}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/119}, eprinttype = {ECCC}, eprint = {TR13-119}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/MilesV13, author = {Eric Miles and Emanuele Viola}, title = {Shielding circuits with groups}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {1}, year = {2013}, url = {http://eprint.iacr.org/2013/001}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/MilesV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/LovettV12, author = {Shachar Lovett and Emanuele Viola}, title = {Bounded-Depth Circuits Cannot Sample Good Codes}, journal = {Comput. Complex.}, volume = {21}, number = {2}, pages = {245--266}, year = {2012}, url = {https://doi.org/10.1007/s00037-012-0039-3}, doi = {10.1007/S00037-012-0039-3}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/LovettV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Viola12, author = {Emanuele Viola}, title = {The Complexity of Distributions}, journal = {{SIAM} J. Comput.}, volume = {41}, number = {1}, pages = {191--218}, year = {2012}, url = {https://doi.org/10.1137/100814998}, doi = {10.1137/100814998}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Viola12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Viola12a, author = {Emanuele Viola}, title = {Bit-Probe Lower Bounds for Succinct Data Structures}, journal = {{SIAM} J. Comput.}, volume = {41}, number = {6}, pages = {1593--1604}, year = {2012}, url = {https://doi.org/10.1137/090766619}, doi = {10.1137/090766619}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Viola12a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Viola12, author = {Emanuele Viola}, editor = {Anupam Gupta and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Rocco A. Servedio}, title = {Extractors for Turing-Machine Sources}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, {APPROX} 2012, and 16th International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7408}, pages = {663--671}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-32512-0\_56}, doi = {10.1007/978-3-642-32512-0\_56}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/Viola12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/crypto/MilesV12, author = {Eric Miles and Emanuele Viola}, editor = {Reihaneh Safavi{-}Naini and Ran Canetti}, title = {Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs}, booktitle = {Advances in Cryptology - {CRYPTO} 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7417}, pages = {68--85}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-32009-5\_5}, doi = {10.1007/978-3-642-32009-5\_5}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/crypto/MilesV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/FeffermanSUV12, author = {Bill Fefferman and Ronen Shaltiel and Christopher Umans and Emanuele Viola}, editor = {Shafi Goldwasser}, title = {On beating the hybrid argument}, booktitle = {Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA, January 8-10, 2012}, pages = {468--483}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2090236.2090273}, doi = {10.1145/2090236.2090273}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/FeffermanSUV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GalHKPV12, author = {Anna G{\'{a}}l and Kristoffer Arnsfelt Hansen and Michal Kouck{\'{y}} and Pavel Pudl{\'{a}}k and Emanuele Viola}, editor = {Howard J. Karloff and Toniann Pitassi}, title = {Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates}, booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference, {STOC} 2012, New York, NY, USA, May 19 - 22, 2012}, pages = {479--494}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2213977.2214023}, doi = {10.1145/2213977.2214023}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GalHKPV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GreenKV12, author = {Frederic Green and Daniel Kreymer and Emanuele Viola}, title = {Block-symmetric polynomials correlate with parity better than symmetric}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-160}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/160}, eprinttype = {ECCC}, eprint = {TR12-160}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GreenKV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/JafargholiJMRV12, author = {Zahra Jafargholi and Hamidreza Jahanjou and Eric Miles and Jaideep Ramachandran and Emanuele Viola}, title = {From {RAM} to {SAT}}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-125}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/125}, eprinttype = {ECCC}, eprint = {TR12-125}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/JafargholiJMRV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/MilesV12, author = {Eric Miles and Emanuele Viola}, title = {On the complexity of constructing pseudorandom functions (especially when they don't exist)}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-019}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/019}, eprinttype = {ECCC}, eprint = {TR12-019}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/MilesV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/RazborovV12, author = {Alexander A. Razborov and Emanuele Viola}, title = {Real Advantage}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-134}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/134}, eprinttype = {ECCC}, eprint = {TR12-134}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/RazborovV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ServedioV12, author = {Rocco A. Servedio and Emanuele Viola}, title = {On a special case of rigidity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-144}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/144}, eprinttype = {ECCC}, eprint = {TR12-144}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ServedioV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola12, author = {Emanuele Viola}, title = {Extractors for Turing-machine sources}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-047}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/047}, eprinttype = {ECCC}, eprint = {TR12-047}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/AaronsonEMRV11, author = {Scott Aaronson and Jeff Erickson and Mohammad Mahdian and R. Ravi and Emanuele Viola}, title = {Special Section on Foundations of Computer Science}, journal = {{SIAM} J. Comput.}, volume = {40}, number = {3}, pages = {770}, year = {2011}, url = {https://doi.org/10.1137/SMJCAT000040000003000770000001}, doi = {10.1137/SMJCAT000040000003000770000001}, timestamp = {Fri, 23 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/AaronsonEMRV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/Viola11, author = {Emanuele Viola}, title = {Selected Results in Additive Combinatorics: An Exposition}, journal = {Theory Comput.}, volume = {3}, pages = {1--15}, year = {2011}, url = {https://doi.org/10.4086/toc.gs.2011.003}, doi = {10.4086/TOC.GS.2011.003}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/Viola11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/LovettV11, author = {Shachar Lovett and Emanuele Viola}, title = {Bounded-Depth Circuits Cannot Sample Good Codes}, booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011}, pages = {243--251}, publisher = {{IEEE} Computer Society}, year = {2011}, url = {https://doi.org/10.1109/CCC.2011.11}, doi = {10.1109/CCC.2011.11}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/LovettV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Viola11, author = {Emanuele Viola}, editor = {Rafail Ostrovsky}, title = {Extractors for Circuit Sources}, booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS} 2011, Palm Springs, CA, USA, October 22-25, 2011}, pages = {220--229}, publisher = {{IEEE} Computer Society}, year = {2011}, url = {https://doi.org/10.1109/FOCS.2011.20}, doi = {10.1109/FOCS.2011.20}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Viola11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Viola11a, author = {Emanuele Viola}, editor = {Rafail Ostrovsky}, title = {Randomness Buys Depth for Approximate Counting}, booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS} 2011, Palm Springs, CA, USA, October 22-25, 2011}, pages = {230--239}, publisher = {{IEEE} Computer Society}, year = {2011}, url = {https://doi.org/10.1109/FOCS.2011.19}, doi = {10.1109/FOCS.2011.19}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Viola11a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tcc/MilesV11, author = {Eric Miles and Emanuele Viola}, editor = {Yuval Ishai}, title = {On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators}, booktitle = {Theory of Cryptography - 8th Theory of Cryptography Conference, {TCC} 2011, Providence, RI, USA, March 28-30, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6597}, pages = {522--539}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-19571-6\_31}, doi = {10.1007/978-3-642-19571-6\_31}, timestamp = {Tue, 14 May 2019 10:00:47 +0200}, biburl = {https://dblp.org/rec/conf/tcc/MilesV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GalHKPV11, author = {Anna G{\'{a}}l and Kristoffer Arnsfelt Hansen and Michal Kouck{\'{y}} and Pavel Pudl{\'{a}}k and Emanuele Viola}, title = {Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-150}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/150}, eprinttype = {ECCC}, eprint = {TR11-150}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GalHKPV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GreenKV11, author = {Frederic Green and Daniel Kreymer and Emanuele Viola}, title = {In Brute-Force Search of Correlation Bounds for Polynomials}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-039}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/039}, eprinttype = {ECCC}, eprint = {TR11-039}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GreenKV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/MilesV11, author = {Eric Miles and Emanuele Viola}, title = {The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-076}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/076}, eprinttype = {ECCC}, eprint = {TR11-076}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/MilesV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola11, author = {Emanuele Viola}, title = {Extractors for circuit sources}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-056}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/056}, eprinttype = {ECCC}, eprint = {TR11-056}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola11a, author = {Emanuele Viola}, title = {Reducing 3XOR to listing triangles, an exposition}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-113}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/113}, eprinttype = {ECCC}, eprint = {TR11-113}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola11a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola11b, author = {Emanuele Viola}, title = {The communication complexity of addition}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-152}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/152}, eprinttype = {ECCC}, eprint = {TR11-152}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola11b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/MilesV11, author = {Eric Miles and Emanuele Viola}, title = {The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {226}, year = {2011}, url = {http://eprint.iacr.org/2011/226}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/MilesV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BogdanovV10, author = {Andrej Bogdanov and Emanuele Viola}, title = {Pseudorandom Bits for Polynomials}, journal = {{SIAM} J. Comput.}, volume = {39}, number = {6}, pages = {2464--2486}, year = {2010}, url = {https://doi.org/10.1137/070712109}, doi = {10.1137/070712109}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/BogdanovV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/ShaltielV10, author = {Ronen Shaltiel and Emanuele Viola}, title = {Hardness Amplification Proofs Require Majority}, journal = {{SIAM} J. Comput.}, volume = {39}, number = {7}, pages = {3122--3154}, year = {2010}, url = {https://doi.org/10.1137/080735096}, doi = {10.1137/080735096}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/ShaltielV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DiakonikolasGJSV10, author = {Ilias Diakonikolas and Parikshit Gopalan and Ragesh Jaiswal and Rocco A. Servedio and Emanuele Viola}, title = {Bounded Independence Fools Halfspaces}, journal = {{SIAM} J. Comput.}, volume = {39}, number = {8}, pages = {3441--3462}, year = {2010}, url = {https://doi.org/10.1137/100783030}, doi = {10.1137/100783030}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/DiakonikolasGJSV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Viola10, author = {Emanuele Viola}, title = {The Complexity of Distributions}, booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2010, October 23-26, 2010, Las Vegas, Nevada, {USA}}, pages = {202--211}, publisher = {{IEEE} Computer Society}, year = {2010}, url = {https://doi.org/10.1109/FOCS.2010.27}, doi = {10.1109/FOCS.2010.27}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Viola10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/PatrascuV10, author = {Mihai P{u{a}}tra{c{s}}cu and Emanuele Viola}, editor = {Moses Charikar}, title = {Cell-Probe Lower Bounds for Succinct Partial Sums}, booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010}, pages = {117--122}, publisher = {{SIAM}}, year = {2010}, url = {https://doi.org/10.1137/1.9781611973075.11}, doi = {10.1137/1.9781611973075.11}, timestamp = {Tue, 02 Feb 2021 17:07:39 +0100}, biburl = {https://dblp.org/rec/conf/soda/PatrascuV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1002-4592, author = {Jasmina Hasanhodzic and Andrew W. Lo and Emanuele Viola}, title = {Is It Real, or Is It Randomized?: {A} Financial Turing Test}, journal = {CoRR}, volume = {abs/1002.4592}, year = {2010}, url = {http://arxiv.org/abs/1002.4592}, eprinttype = {arXiv}, eprint = {1002.4592}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1002-4592.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/FeffermanSUV10, author = {Bill Fefferman and Ronen Shaltiel and Christopher Umans and Emanuele Viola}, title = {On beating the hybrid argument}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-186}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/186}, eprinttype = {ECCC}, eprint = {TR10-186}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/FeffermanSUV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettV10, author = {Shachar Lovett and Emanuele Viola}, title = {Bounded-depth circuits cannot sample good codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-115}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/115}, eprinttype = {ECCC}, eprint = {TR10-115}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola10, author = {Emanuele Viola}, title = {Randomness buys depth for approximate counting}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-175}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/175}, eprinttype = {ECCC}, eprint = {TR10-175}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Viola09, author = {Emanuele Viola}, title = {The Sum of \emph{D} Small-Bias Generators Fools Polynomials of Degree \emph{D}}, journal = {Comput. Complex.}, volume = {18}, number = {2}, pages = {209--217}, year = {2009}, url = {https://doi.org/10.1007/s00037-009-0273-5}, doi = {10.1007/S00037-009-0273-5}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Viola09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Viola09a, author = {Emanuele Viola}, title = {On Approximate Majority and Probabilistic Time}, journal = {Comput. Complex.}, volume = {18}, number = {3}, pages = {337--375}, year = {2009}, url = {https://doi.org/10.1007/s00037-009-0267-3}, doi = {10.1007/S00037-009-0267-3}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Viola09a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/ViolaW09, author = {Emanuele Viola and Avi Wigderson}, title = {One-way multiparty communication lower bound for pointer jumping with applications}, journal = {Comb.}, volume = {29}, number = {6}, pages = {719--743}, year = {2009}, url = {https://doi.org/10.1007/s00493-009-2667-z}, doi = {10.1007/S00493-009-2667-Z}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/ViolaW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fttcs/Viola09, author = {Emanuele Viola}, title = {On the Power of Small-Depth Computation}, journal = {Found. Trends Theor. Comput. Sci.}, volume = {5}, number = {1}, pages = {1--72}, year = {2009}, url = {https://doi.org/10.1561/0400000033}, doi = {10.1561/0400000033}, timestamp = {Thu, 20 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fttcs/Viola09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/Viola09, author = {Emanuele Viola}, title = {Guest Column: correlation bounds for polynomials over \{0 1\}}, journal = {{SIGACT} News}, volume = {40}, number = {1}, pages = {27--44}, year = {2009}, url = {https://doi.org/10.1145/1515698.1515709}, doi = {10.1145/1515698.1515709}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/sigact/Viola09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/DavidPV09, author = {Matei David and Toniann Pitassi and Emanuele Viola}, title = {Improved Separations between Nondeterministic and Randomized Multiparty Communication}, journal = {{ACM} Trans. Comput. Theory}, volume = {1}, number = {2}, pages = {5:1--5:20}, year = {2009}, url = {https://doi.org/10.1145/1595391.1595392}, doi = {10.1145/1595391.1595392}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/DavidPV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DiakonikolasGJSV09, author = {Ilias Diakonikolas and Parikshit Gopalan and Ragesh Jaiswal and Rocco A. Servedio and Emanuele Viola}, title = {Bounded Independence Fools Halfspaces}, booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2009, October 25-27, 2009, Atlanta, Georgia, {USA}}, pages = {171--180}, publisher = {{IEEE} Computer Society}, year = {2009}, url = {https://doi.org/10.1109/FOCS.2009.68}, doi = {10.1109/FOCS.2009.68}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/DiakonikolasGJSV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Viola09, author = {Emanuele Viola}, editor = {Michael Mitzenmacher}, title = {Bit-probe lower bounds for succinct data structures}, booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing, {STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009}, pages = {475--482}, publisher = {{ACM}}, year = {2009}, url = {https://doi.org/10.1145/1536414.1536480}, doi = {10.1145/1536414.1536480}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Viola09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0902-3757, author = {Ilias Diakonikolas and Parikshit Gopalan and Ragesh Jaiswal and Rocco A. Servedio and Emanuele Viola}, title = {Bounded Independence Fools Halfspaces}, journal = {CoRR}, volume = {abs/0902.3757}, year = {2009}, url = {http://arxiv.org/abs/0902.3757}, eprinttype = {arXiv}, eprint = {0902.3757}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0902-3757.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0906-1370, author = {Emanuele Viola}, title = {Cell-Probe Lower Bounds for Prefix Sums}, journal = {CoRR}, volume = {abs/0906.1370}, year = {2009}, url = {http://arxiv.org/abs/0906.1370}, eprinttype = {arXiv}, eprint = {0906.1370}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0906-1370.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0908-4580, author = {Jasmina Hasanhodzic and Andrew W. Lo and Emanuele Viola}, title = {A Computational View of Market Efficiency}, journal = {CoRR}, volume = {abs/0908.4580}, year = {2009}, url = {http://arxiv.org/abs/0908.4580}, eprinttype = {arXiv}, eprint = {0908.4580}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0908-4580.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DiakonikolasGJSV09, author = {Ilias Diakonikolas and Parikshit Gopalan and Ragesh Jaiswal and Rocco A. Servedio and Emanuele Viola}, title = {Bounded Independence Fools Halfspaces}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR09-016}}, year = {2009}, url = {https://eccc.weizmann.ac.il/report/2009/016}, eprinttype = {ECCC}, eprint = {TR09-016}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DiakonikolasGJSV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola09, author = {Emanuele Viola}, title = {Bit-Probe Lower Bounds for Succinct Data Structures}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR09-005}}, year = {2009}, url = {https://eccc.weizmann.ac.il/report/2009/005}, eprinttype = {ECCC}, eprint = {TR09-005}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola09a, author = {Emanuele Viola}, title = {Are all distributions easy?}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR09-114}}, year = {2009}, url = {https://eccc.weizmann.ac.il/report/2009/114}, eprinttype = {ECCC}, eprint = {TR09-114}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola09a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ViolaV09, author = {Emanuele Viola}, title = {Cell-Probe Lower Bounds for Prefix Sums}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR09-054}}, year = {2009}, url = {https://eccc.weizmann.ac.il/report/2009/054}, eprinttype = {ECCC}, eprint = {TR09-054}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ViolaV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/ViolaW08, author = {Emanuele Viola and Avi Wigderson}, title = {Norms, {XOR} Lemmas, and Lower Bounds for Polynomials and Protocols}, journal = {Theory Comput.}, volume = {4}, number = {1}, pages = {137--168}, year = {2008}, url = {https://doi.org/10.4086/toc.2008.v004a007}, doi = {10.4086/TOC.2008.V004A007}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/ViolaW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/DavidPV08, author = {Matei David and Toniann Pitassi and Emanuele Viola}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Improved Separations between Nondeterministic and Randomized Multiparty Communication}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {371--384}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_30}, doi = {10.1007/978-3-540-85363-3\_30}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/DavidPV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Viola08, author = {Emanuele Viola}, title = {The Sum of d Small-Bias Generators Fools Polynomials of Degree d}, booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}}, pages = {124--127}, publisher = {{IEEE} Computer Society}, year = {2008}, url = {https://doi.org/10.1109/CCC.2008.16}, doi = {10.1109/CCC.2008.16}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Viola08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ShaltielV08, author = {Ronen Shaltiel and Emanuele Viola}, editor = {Cynthia Dwork}, title = {Hardness amplification proofs require majority}, booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008}, pages = {589--598}, publisher = {{ACM}}, year = {2008}, url = {https://doi.org/10.1145/1374376.1374461}, doi = {10.1145/1374376.1374461}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ShaltielV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Viola07, author = {Emanuele Viola}, title = {Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates}, journal = {{SIAM} J. Comput.}, volume = {36}, number = {5}, pages = {1387--1403}, year = {2007}, url = {https://doi.org/10.1137/050640941}, doi = {10.1137/050640941}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Viola07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/ViolaW07, author = {Emanuele Viola and Avi Wigderson}, title = {Norms, {XOR} Lemmas, and Lower Bounds for {GF(2)} Polynomials and Multiparty Protocols}, booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007), 13-16 June 2007, San Diego, California, {USA}}, pages = {141--154}, publisher = {{IEEE} Computer Society}, year = {2007}, url = {https://doi.org/10.1109/CCC.2007.15}, doi = {10.1109/CCC.2007.15}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/ViolaW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Viola07, author = {Emanuele Viola}, title = {On Approximate Majority and Probabilistic Time}, booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007), 13-16 June 2007, San Diego, California, {USA}}, pages = {155--168}, publisher = {{IEEE} Computer Society}, year = {2007}, url = {https://doi.org/10.1109/CCC.2007.16}, doi = {10.1109/CCC.2007.16}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Viola07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/BogdanovV07, author = {Andrej Bogdanov and Emanuele Viola}, title = {Pseudorandom Bits for Polynomials}, booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS} 2007), October 20-23, 2007, Providence, RI, USA, Proceedings}, pages = {41--51}, publisher = {{IEEE} Computer Society}, year = {2007}, url = {https://doi.org/10.1109/FOCS.2007.56}, doi = {10.1109/FOCS.2007.56}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/BogdanovV07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/ViolaW07, author = {Emanuele Viola and Avi Wigderson}, title = {One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications}, booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS} 2007), October 20-23, 2007, Providence, RI, USA, Proceedings}, pages = {427--437}, publisher = {{IEEE} Computer Society}, year = {2007}, url = {https://doi.org/10.1109/FOCS.2007.51}, doi = {10.1109/FOCS.2007.51}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/ViolaW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BogdanovV07, author = {Andrej Bogdanov and Emanuele Viola}, title = {Pseudorandom bits for polynomials}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR07-081}}, year = {2007}, url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-081/index.html}, eprinttype = {ECCC}, eprint = {TR07-081}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BogdanovV07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ShaltielV07, author = {Ronen Shaltiel and Emanuele Viola}, title = {Hardness amplification proofs require majority}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR07-130}}, year = {2007}, url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-130/index.html}, eprinttype = {ECCC}, eprint = {TR07-130}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ShaltielV07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola07, author = {Emanuele Viola}, title = {Selected Results in Additive Combinatorics: An Exposition}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR07-103}}, year = {2007}, url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-103/index.html}, eprinttype = {ECCC}, eprint = {TR07-103}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola07a, author = {Emanuele Viola}, title = {The sum of d small-bias generators fools polynomials of degree d}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR07-132}}, year = {2007}, url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-132/index.html}, eprinttype = {ECCC}, eprint = {TR07-132}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola07a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ViolaW07, author = {Emanuele Viola and Avi Wigderson}, title = {One-way multi-party communication lower bound for pointer jumping with applications}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR07-079}}, year = {2007}, url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-079/index.html}, eprinttype = {ECCC}, eprint = {TR07-079}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ViolaW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HealyVV06, author = {Alexander Healy and Salil P. Vadhan and Emanuele Viola}, title = {Using Nondeterminism to Amplify Hardness}, journal = {{SIAM} J. Comput.}, volume = {35}, number = {4}, pages = {903--931}, year = {2006}, url = {https://doi.org/10.1137/S0097539705447281}, doi = {10.1137/S0097539705447281}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HealyVV06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/HealyV06, author = {Alexander Healy and Emanuele Viola}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {672--683}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_55}, doi = {10.1007/11672142\_55}, timestamp = {Wed, 19 May 2021 12:05:43 +0200}, biburl = {https://dblp.org/rec/conf/stacs/HealyV06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/Viola06, author = {Emanuele Viola}, editor = {Matthias Krause and Pavel Pudl{\'{a}}k and R{\"{u}}diger Reischuk and Dieter van Melkebeek}, title = {On Probabilistic Time versus Alternating Time}, booktitle = {Complexity of Boolean Functions, 12.03. - 17.03.2006}, series = {Dagstuhl Seminar Proceedings}, volume = {06111}, publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany}, year = {2006}, url = {http://drops.dagstuhl.de/opus/volltexte/2006/619}, timestamp = {Thu, 10 Jun 2021 13:02:07 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/Viola06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Viola06, author = {Emanuele Viola}, title = {New correlation bounds for {GF(2)} polynomials using Gowers uniformity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR06-097}}, year = {2006}, url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-097/index.html}, eprinttype = {ECCC}, eprint = {TR06-097}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Viola06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Viola05, author = {Emanuele Viola}, title = {The complexity of constructing pseudorandom generators from hard functions}, journal = {Comput. Complex.}, volume = {13}, number = {3-4}, pages = {147--188}, year = {2005}, url = {https://doi.org/10.1007/s00037-004-0187-1}, doi = {10.1007/S00037-004-0187-1}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Viola05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Viola05, author = {Emanuele Viola}, title = {On Constructing Parallel Pseudorandom Generators from One-Way Functions}, booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005), 11-15 June 2005, San Jose, CA, {USA}}, pages = {183--197}, publisher = {{IEEE} Computer Society}, year = {2005}, url = {https://doi.org/10.1109/CCC.2005.16}, doi = {10.1109/CCC.2005.16}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Viola05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Viola05a, author = {Emanuele Viola}, title = {Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates}, booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005), 11-15 June 2005, San Jose, CA, {USA}}, pages = {198--209}, publisher = {{IEEE} Computer Society}, year = {2005}, url = {https://doi.org/10.1109/CCC.2005.25}, doi = {10.1109/CCC.2005.25}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Viola05a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR05-043, author = {Emanuele Viola}, title = {Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR05-043}}, year = {2005}, url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-043/index.html}, eprinttype = {ECCC}, eprint = {TR05-043}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-043.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR05-087, author = {Alexander Healy and Emanuele Viola}, title = {Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR05-087}}, year = {2005}, url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-087/index.html}, eprinttype = {ECCC}, eprint = {TR05-087}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-087.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR05-137, author = {Emanuele Viola}, title = {On Probabilistic Time versus Alternating Time}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR05-137}}, year = {2005}, url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-137/index.html}, eprinttype = {ECCC}, eprint = {TR05-137}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-137.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Viola05, author = {Emanuele Viola}, title = {On Constructing Parallel Pseudorandom Generators from One-Way Functions}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {159}, year = {2005}, url = {http://eprint.iacr.org/2005/159}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/Viola05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/GutfreundV04, author = {Dan Gutfreund and Emanuele Viola}, editor = {Klaus Jansen and Sanjeev Khanna and Jos{\'{e}} D. P. Rolim and Dana Ron}, title = {Fooling Parity Tests with Parity Gates}, booktitle = {Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2004, and 8th International Workshop on Randomization and Computation, {RANDOM} 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3122}, pages = {381--392}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-27821-4\_34}, doi = {10.1007/978-3-540-27821-4\_34}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/GutfreundV04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HealyVV04, author = {Alexander Healy and Salil P. Vadhan and Emanuele Viola}, editor = {L{\'{a}}szl{\'{o}} Babai}, title = {Using nondeterminism to amplify hardness}, booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004}, pages = {192--201}, publisher = {{ACM}}, year = {2004}, url = {https://doi.org/10.1145/1007352.1007389}, doi = {10.1145/1007352.1007389}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/HealyVV04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR04-020, author = {Emanuele Viola}, title = {The Complexity of Constructing Pseudorandom Generators from Hard Functions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR04-020}}, year = {2004}, url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-020/index.html}, eprinttype = {ECCC}, eprint = {TR04-020}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-020.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR04-074, author = {Emanuele Viola}, title = {On Parallel Pseudorandom Generators}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR04-074}}, year = {2004}, url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-074/index.html}, eprinttype = {ECCC}, eprint = {TR04-074}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-074.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR04-087, author = {Alexander Healy and Salil P. Vadhan and Emanuele Viola}, title = {Using Nondeterminism to Amplify Hardness}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR04-087}}, year = {2004}, url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-087/index.html}, eprinttype = {ECCC}, eprint = {TR04-087}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-087.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR04-088, author = {Emanuele Viola and Dan Gutfreund}, title = {Fooling Parity Tests with Parity Gates}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR04-088}}, year = {2004}, url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-088/index.html}, eprinttype = {ECCC}, eprint = {TR04-088}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-088.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Viola03, author = {Emanuele Viola}, title = {Hardness vs. Randomness within Alternating Time}, booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark}, pages = {53}, publisher = {{IEEE} Computer Society}, year = {2003}, url = {https://doi.org/10.1109/CCC.2003.1214410}, doi = {10.1109/CCC.2003.1214410}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Viola03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ictcs/Viola01, author = {Emanuele Viola}, editor = {Antonio Restivo and Simona Ronchi Della Rocca and Luca Roversi}, title = {E-unifiability via Narrowing}, booktitle = {Theoretical Computer Science, 7th Italian Conference, {ICTCS} 2001, Torino, Italy, October 4-6, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2202}, pages = {426--438}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45446-2\_27}, doi = {10.1007/3-540-45446-2\_27}, timestamp = {Tue, 14 May 2019 10:00:45 +0200}, biburl = {https://dblp.org/rec/conf/ictcs/Viola01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.