Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Shachar Lovett
@article{DBLP:journals/tit/BhowmickL23, author = {Abhishek Bhowmick and Shachar Lovett}, title = {Bias vs Structure of Polynomials in Large Fields, and Applications in Information Theory}, journal = {{IEEE} Trans. Inf. Theory}, volume = {69}, number = {2}, pages = {963--977}, year = {2023}, url = {https://doi.org/10.1109/TIT.2022.3214372}, doi = {10.1109/TIT.2022.3214372}, timestamp = {Fri, 10 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/BhowmickL23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/LiuMKLWS23, author = {Sihan Liu and Gaurav Mahajan and Daniel Kane and Shachar Lovett and Gell{\'{e}}rt Weisz and Csaba Szepesv{\'{a}}ri}, editor = {Gergely Neu and Lorenzo Rosasco}, title = {Exponential Hardness of Reinforcement Learning with Linear Function Approximation}, booktitle = {The Thirty Sixth Annual Conference on Learning Theory, {COLT} 2023, 12-15 July 2023, Bangalore, India}, series = {Proceedings of Machine Learning Research}, volume = {195}, pages = {1588--1617}, publisher = {{PMLR}}, year = {2023}, url = {https://proceedings.mlr.press/v195/liu23b.html}, timestamp = {Wed, 06 Sep 2023 17:49:05 +0200}, biburl = {https://dblp.org/rec/conf/colt/LiuMKLWS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/LovettZ23, author = {Shachar Lovett and Jiapeng Zhang}, title = {Streaming Lower Bounds and Asymmetric Set-Disjointness}, booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2023, Santa Cruz, CA, USA, November 6-9, 2023}, pages = {871--882}, publisher = {{IEEE}}, year = {2023}, url = {https://doi.org/10.1109/FOCS57990.2023.00056}, doi = {10.1109/FOCS57990.2023.00056}, timestamp = {Tue, 02 Jan 2024 14:56:14 +0100}, biburl = {https://dblp.org/rec/conf/focs/LovettZ23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/LovettZ23, author = {Shachar Lovett and Jiapeng Zhang}, editor = {Yael Tauman Kalai}, title = {Fractional Certificates for Bounded Functions}, booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS} 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}}, series = {LIPIcs}, volume = {251}, pages = {84:1--84:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.84}, doi = {10.4230/LIPICS.ITCS.2023.84}, timestamp = {Thu, 02 Feb 2023 12:50:42 +0100}, biburl = {https://dblp.org/rec/conf/innovations/LovettZ23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BeagleholeHKLL23, author = {Daniel Beaglehole and Max Hopkins and Daniel Kane and Sihan Liu and Shachar Lovett}, editor = {Nikhil Bansal and Viswanath Nagarajan}, title = {Sampling Equilibria: Fast No-Regret Learning in Structured Games}, booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2023, Florence, Italy, January 22-25, 2023}, pages = {3817--3855}, publisher = {{SIAM}}, year = {2023}, url = {https://doi.org/10.1137/1.9781611977554.ch149}, doi = {10.1137/1.9781611977554.CH149}, timestamp = {Fri, 17 Feb 2023 09:28:57 +0100}, biburl = {https://dblp.org/rec/conf/soda/BeagleholeHKLL23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2301-05658, author = {Shachar Lovett and Jiapeng Zhang}, title = {Streaming Lower Bounds and Asymmetric Set-Disjointness}, journal = {CoRR}, volume = {abs/2301.05658}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2301.05658}, doi = {10.48550/ARXIV.2301.05658}, eprinttype = {arXiv}, eprint = {2301.05658}, timestamp = {Thu, 19 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2301-05658.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2302-06285, author = {Max Hopkins and Daniel M. Kane and Shachar Lovett and Gaurav Mahajan}, title = {Do PAC-Learners Learn the Marginal Distribution?}, journal = {CoRR}, volume = {abs/2302.06285}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2302.06285}, doi = {10.48550/ARXIV.2302.06285}, eprinttype = {arXiv}, eprint = {2302.06285}, timestamp = {Mon, 20 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2302-06285.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2302-12940, author = {Daniel Kane and Sihan Liu and Shachar Lovett and Gaurav Mahajan and Csaba Szepesv{\'{a}}ri and Gell{\'{e}}rt Weisz}, title = {Exponential Hardness of Reinforcement Learning with Linear Function Approximation}, journal = {CoRR}, volume = {abs/2302.12940}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2302.12940}, doi = {10.48550/ARXIV.2302.12940}, eprinttype = {arXiv}, eprint = {2302.12940}, timestamp = {Tue, 28 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2302-12940.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2308-12451, author = {Zander Kelley and Shachar Lovett and Raghu Meka}, title = {Explicit separations between randomized and deterministic Number-on-Forehead communication}, journal = {CoRR}, volume = {abs/2308.12451}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2308.12451}, doi = {10.48550/ARXIV.2308.12451}, eprinttype = {arXiv}, eprint = {2308.12451}, timestamp = {Wed, 30 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2308-12451.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2311-09095, author = {Amir Abboud and Nick Fischer and Zander Kelley and Shachar Lovett and Raghu Meka}, title = {New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms}, journal = {CoRR}, volume = {abs/2311.09095}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2311.09095}, doi = {10.48550/ARXIV.2311.09095}, eprinttype = {arXiv}, eprint = {2311.09095}, timestamp = {Tue, 21 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2311-09095.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2312-09400, author = {Hamed Hatami and Kaave Hosseini and Shachar Lovett and Anthony Ostuni}, title = {Refuting approaches to the log-rank conjecture for {XOR} functions}, journal = {CoRR}, volume = {abs/2312.09400}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2312.09400}, doi = {10.48550/ARXIV.2312.09400}, eprinttype = {arXiv}, eprint = {2312.09400}, timestamp = {Tue, 09 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2312-09400.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AbboudFKLM23, author = {Amir Abboud and Nick Fischer and Zander Kelley and Shachar Lovett and Raghu Meka}, title = {New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR23-180}}, year = {2023}, url = {https://eccc.weizmann.ac.il/report/2023/180}, eprinttype = {ECCC}, eprint = {TR23-180}, timestamp = {Wed, 10 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eccc/AbboudFKLM23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HatamiHLO23, author = {Hamed Hatami and Kaave Hosseini and Shachar Lovett and Anthony Ostuni}, title = {Refuting approaches to the log-rank conjecture for {XOR} functions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR23-203}}, year = {2023}, url = {https://eccc.weizmann.ac.il/report/2023/203}, eprinttype = {ECCC}, eprint = {TR23-203}, timestamp = {Wed, 10 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eccc/HatamiHLO23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KelleyLM23, author = {Zander Kelley and Shachar Lovett and Raghu Meka}, title = {Explicit separations between randomized and deterministic Number-on-Forehead communication}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR23-124}}, year = {2023}, url = {https://eccc.weizmann.ac.il/report/2023/124}, eprinttype = {ECCC}, eprint = {TR23-124}, timestamp = {Wed, 30 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KelleyLM23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettZ23, author = {Shachar Lovett and Jiapeng Zhang}, title = {Streaming Lower Bounds and Asymmetric Set-Disjointness}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR23-003}}, year = {2023}, url = {https://eccc.weizmann.ac.il/report/2023/003}, eprinttype = {ECCC}, eprint = {TR23-003}, timestamp = {Mon, 06 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eccc/LovettZ23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/0006LZ22, author = {Xin Li and Shachar Lovett and Jiapeng Zhang}, title = {Sunflowers and Robust Sunflowers from Randomness Extractors}, journal = {Theory Comput.}, volume = {18}, pages = {1--18}, year = {2022}, url = {https://theoryofcomputing.org/articles/v018a002/}, timestamp = {Thu, 02 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/toc/0006LZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/HosseiniHL22, author = {Kaave Hosseini and Hamed Hatami and Shachar Lovett}, title = {Sign-Rank vs. Discrepancy}, journal = {Theory Comput.}, volume = {18}, pages = {1--22}, year = {2022}, url = {https://theoryofcomputing.org/articles/v018a019/}, timestamp = {Thu, 02 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/toc/HosseiniHL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/GaitondeHKLZ22, author = {Jason Gaitonde and Max Hopkins and Tali Kaufman and Shachar Lovett and Ruizhe Zhang}, editor = {Amit Chakrabarti and Chaitanya Swamy}, title = {Eigenstripping, Spectral Decay, and Edge-Expansion on Posets}, 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 = {16:1--16:24}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.16}, doi = {10.4230/LIPICS.APPROX/RANDOM.2022.16}, timestamp = {Mon, 26 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/GaitondeHKLZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/KaneLLM22, author = {Daniel Kane and Sihan Liu and Shachar Lovett and Gaurav Mahajan}, editor = {Po{-}Ling Loh and Maxim Raginsky}, title = {Computational-Statistical Gap in Reinforcement Learning}, booktitle = {Conference on Learning Theory, 2-5 July 2022, London, {UK}}, series = {Proceedings of Machine Learning Research}, volume = {178}, pages = {1282--1302}, publisher = {{PMLR}}, year = {2022}, url = {https://proceedings.mlr.press/v178/kane22a.html}, timestamp = {Tue, 12 Jul 2022 17:36:51 +0200}, biburl = {https://dblp.org/rec/conf/colt/KaneLLM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/HopkinsKLM22, author = {Max Hopkins and Daniel M. Kane and Shachar Lovett and Gaurav Mahajan}, editor = {Po{-}Ling Loh and Maxim Raginsky}, title = {Realizable Learning is All You Need}, booktitle = {Conference on Learning Theory, 2-5 July 2022, London, {UK}}, series = {Proceedings of Machine Learning Research}, volume = {178}, pages = {3015--3069}, publisher = {{PMLR}}, year = {2022}, url = {https://proceedings.mlr.press/v178/hopkins22a.html}, timestamp = {Tue, 12 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/HopkinsKLM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/LovettMMPZ22, author = {Shachar Lovett and Raghu Meka and Ian Mertz and Toniann Pitassi and Jiapeng Zhang}, editor = {Mark Braverman}, title = {Lifting with Sunflowers}, booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS} 2022, January 31 - February 3, 2022, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {215}, pages = {104:1--104:24}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.104}, doi = {10.4230/LIPICS.ITCS.2022.104}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/LovettMMPZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BafnaHKL22, author = {Mitali Bafna and Max Hopkins and Tali Kaufman and Shachar Lovett}, editor = {Joseph (Seffi) Naor and Niv Buchbinder}, title = {High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games}, booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022}, pages = {1069--1128}, publisher = {{SIAM}}, year = {2022}, url = {https://doi.org/10.1137/1.9781611977073.47}, doi = {10.1137/1.9781611977073.47}, timestamp = {Tue, 12 Apr 2022 11:24:56 +0200}, biburl = {https://dblp.org/rec/conf/soda/BafnaHKL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BafnaHKL22, author = {Mitali Bafna and Max Hopkins and Tali Kaufman and Shachar Lovett}, editor = {Stefano Leonardi and Anupam Gupta}, title = {Hypercontractivity on high dimensional expanders}, booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022}, pages = {185--194}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3519935.3520040}, doi = {10.1145/3519935.3520040}, timestamp = {Tue, 27 Dec 2022 09:06:31 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BafnaHKL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/coco/2022, editor = {Shachar Lovett}, title = {37th Computational Complexity Conference, {CCC} 2022, July 20-23, 2022, Philadelphia, PA, {USA}}, series = {LIPIcs}, volume = {234}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://www.dagstuhl.de/dagpub/978-3-95977-241-9}, isbn = {978-3-95977-241-9}, timestamp = {Tue, 12 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/2022.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2202-05444, author = {Daniel Kane and Sihan Liu and Shachar Lovett and Gaurav Mahajan}, title = {Computational-Statistical Gaps in Reinforcement Learning}, journal = {CoRR}, volume = {abs/2202.05444}, year = {2022}, url = {https://arxiv.org/abs/2202.05444}, eprinttype = {arXiv}, eprint = {2202.05444}, timestamp = {Fri, 18 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2202-05444.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2205-00644, author = {Jason Gaitonde and Max Hopkins and Tali Kaufman and Shachar Lovett and Ruizhe Zhang}, title = {Eigenstripping, Spectral Decay, and Edge-Expansion on Posets}, journal = {CoRR}, volume = {abs/2205.00644}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2205.00644}, doi = {10.48550/ARXIV.2205.00644}, eprinttype = {arXiv}, eprint = {2205.00644}, timestamp = {Tue, 03 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2205-00644.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettZ22, author = {Shachar Lovett and Jiapeng Zhang}, title = {Fractional certificates for bounded functions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR22-107}}, year = {2022}, url = {https://eccc.weizmann.ac.il/report/2022/107}, eprinttype = {ECCC}, eprint = {TR22-107}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/LovettWZ21, author = {Shachar Lovett and Kewen Wu and Jiapeng Zhang}, title = {Decision List Compression by Mild Random Restrictions}, journal = {J. {ACM}}, volume = {68}, number = {6}, pages = {45:1--45:17}, year = {2021}, url = {https://doi.org/10.1145/3485007}, doi = {10.1145/3485007}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/LovettWZ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Lovett21, author = {Shachar Lovett}, title = {Sparse {MDS} Matrices over Small Fields: {A} Proof of the {GM-MDS} Conjecture}, journal = {{SIAM} J. Comput.}, volume = {50}, number = {4}, pages = {1248--1262}, year = {2021}, url = {https://doi.org/10.1137/20M1323345}, doi = {10.1137/20M1323345}, timestamp = {Tue, 05 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Lovett21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/KnopLMY21, author = {Alexander Knop and Shachar Lovett and Sam McGuire and Weiqiang Yuan}, title = {Guest Column: Models of computation between decision trees and communication}, journal = {{SIGACT} News}, volume = {52}, number = {2}, pages = {46--70}, year = {2021}, url = {https://doi.org/10.1145/3471469.3471479}, doi = {10.1145/3471469.3471479}, timestamp = {Wed, 14 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigact/KnopLMY21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/KaringulaL21, author = {Sankeerth Rao Karingula and Shachar Lovett}, editor = {Mary Wootters and Laura Sanit{\`{a}}}, title = {Singularity of Random Integer Matrices with Large Entries}, 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 = {33:1--33:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.33}, doi = {10.4230/LIPICS.APPROX/RANDOM.2021.33}, timestamp = {Tue, 21 Sep 2021 09:36:32 +0200}, biburl = {https://dblp.org/rec/conf/approx/KaringulaL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/ChattopadhyayGL21, author = {Eshan Chattopadhyay and Jason Gaitonde and Chin Ho Lee and Shachar Lovett and Abhishek Shetty}, editor = {Valentine Kabanets}, title = {Fractional Pseudorandom Generators from Any Fourier Level}, booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)}, series = {LIPIcs}, volume = {200}, pages = {10:1--10:24}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.CCC.2021.10}, doi = {10.4230/LIPICS.CCC.2021.10}, timestamp = {Thu, 02 Feb 2023 13:27:03 +0100}, biburl = {https://dblp.org/rec/conf/coco/ChattopadhyayGL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/HopkinsKLM21, author = {Max Hopkins and Daniel Kane and Shachar Lovett and Michal Moshkovitz}, editor = {Mikhail Belkin and Samory Kpotufe}, title = {Bounded Memory Active Learning through Enriched Queries}, booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder, Colorado, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {134}, pages = {2358--2387}, publisher = {{PMLR}}, year = {2021}, url = {http://proceedings.mlr.press/v134/hopkins21a.html}, timestamp = {Wed, 25 Aug 2021 17:11:16 +0200}, biburl = {https://dblp.org/rec/conf/colt/HopkinsKLM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/DuKLLMSW21, author = {Simon S. Du and Sham M. Kakade and Jason D. Lee and Shachar Lovett and Gaurav Mahajan and Wen Sun and Ruosong Wang}, editor = {Marina Meila and Tong Zhang}, title = {Bilinear Classes: {A} Structural Framework for Provable Generalization in {RL}}, booktitle = {Proceedings of the 38th International Conference on Machine Learning, {ICML} 2021, 18-24 July 2021, Virtual Event}, series = {Proceedings of Machine Learning Research}, volume = {139}, pages = {2826--2836}, publisher = {{PMLR}}, year = {2021}, url = {http://proceedings.mlr.press/v139/du21a.html}, timestamp = {Tue, 06 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icml/DuKLLMSW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KnopLM021, author = {Alexander Knop and Shachar Lovett and Sam McGuire and Weiqiang Yuan}, editor = {Samir Khuller and Virginia Vassilevska Williams}, title = {Log-rank and lifting for AND-functions}, booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021}, pages = {197--208}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3406325.3450999}, doi = {10.1145/3406325.3450999}, timestamp = {Sat, 08 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KnopLM021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2102-05047, author = {Max Hopkins and Daniel Kane and Shachar Lovett and Michal Moshkovitz}, title = {Bounded Memory Active Learning through Enriched Queries}, journal = {CoRR}, volume = {abs/2102.05047}, year = {2021}, url = {https://arxiv.org/abs/2102.05047}, eprinttype = {arXiv}, eprint = {2102.05047}, timestamp = {Thu, 18 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2102-05047.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2103-10897, author = {Simon S. Du and Sham M. Kakade and Jason D. Lee and Shachar Lovett and Gaurav Mahajan and Wen Sun and Ruosong Wang}, title = {Bilinear Classes: {A} Structural Framework for Provable Generalization in {RL}}, journal = {CoRR}, volume = {abs/2103.10897}, year = {2021}, url = {https://arxiv.org/abs/2103.10897}, eprinttype = {arXiv}, eprint = {2103.10897}, timestamp = {Tue, 06 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2103-10897.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2111-04746, author = {Max Hopkins and Daniel Kane and Shachar Lovett and Gaurav Mahajan}, title = {Realizable Learning is All You Need}, journal = {CoRR}, volume = {abs/2111.04746}, year = {2021}, url = {https://arxiv.org/abs/2111.04746}, eprinttype = {arXiv}, eprint = {2111.04746}, timestamp = {Wed, 10 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2111-04746.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2111-09444, author = {Mitali Bafna and Max Hopkins and Tali Kaufman and Shachar Lovett}, title = {Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments}, journal = {CoRR}, volume = {abs/2111.09444}, year = {2021}, url = {https://arxiv.org/abs/2111.09444}, eprinttype = {arXiv}, eprint = {2111.09444}, timestamp = {Fri, 26 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2111-09444.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BafnaHKL21, author = {Mitali Bafna and Max Hopkins and Tali Kaufman and Shachar Lovett}, title = {Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR21-169}}, year = {2021}, url = {https://eccc.weizmann.ac.il/report/2021/169}, eprinttype = {ECCC}, eprint = {TR21-169}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BafnaHKL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcta/LovettRV20, author = {Shachar Lovett and Sankeerth Rao and Alexander Vardy}, title = {Probabilistic existence of large sets of designs}, journal = {J. Comb. Theory, Ser. {A}}, volume = {176}, pages = {105286}, year = {2020}, url = {https://doi.org/10.1016/j.jcta.2020.105286}, doi = {10.1016/J.JCTA.2020.105286}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcta/LovettRV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/HatamiHL20, author = {Hamed Hatami and Kaave Hosseini and Shachar Lovett}, editor = {Shubhangi Saraf}, title = {Sign Rank vs Discrepancy}, booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31, 2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)}, series = {LIPIcs}, volume = {169}, pages = {18:1--18:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.CCC.2020.18}, doi = {10.4230/LIPICS.CCC.2020.18}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/HatamiHL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/HopkinsKLM20, author = {Max Hopkins and Daniel Kane and Shachar Lovett and Gaurav Mahajan}, editor = {Jacob D. Abernethy and Shivani Agarwal}, title = {Noise-tolerant, Reliable Active Classification with Comparison Queries}, booktitle = {Conference on Learning Theory, {COLT} 2020, 9-12 July 2020, Virtual Event [Graz, Austria]}, series = {Proceedings of Machine Learning Research}, volume = {125}, pages = {1957--2006}, publisher = {{PMLR}}, year = {2020}, url = {http://proceedings.mlr.press/v125/hopkins20a.html}, timestamp = {Fri, 27 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/colt/HopkinsKLM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/HopkinsKLM20, author = {Max Hopkins and Daniel Kane and Shachar Lovett and Gaurav Mahajan}, editor = {Sandy Irani}, title = {Point Location and Active Learning: Learning Halfspaces Almost Optimally}, booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2020, Durham, NC, USA, November 16-19, 2020}, pages = {1034--1044}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/FOCS46700.2020.00100}, doi = {10.1109/FOCS46700.2020.00100}, timestamp = {Wed, 15 Dec 2021 10:49:16 +0100}, biburl = {https://dblp.org/rec/conf/focs/HopkinsKLM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/GonenLM20, author = {Alon Gonen and Shachar Lovett and Michal Moshkovitz}, editor = {Hugo Larochelle and Marc'Aurelio Ranzato and Raia Hadsell and Maria{-}Florina Balcan and Hsuan{-}Tien Lin}, title = {Towards a Combinatorial Characterization of Bounded-Memory Learning}, booktitle = {Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual}, year = {2020}, url = {https://proceedings.neurips.cc/paper/2020/hash/665d5cbb82b5785d9f344c46417c6c36-Abstract.html}, timestamp = {Tue, 19 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/GonenLM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/HopkinsKL20, author = {Max Hopkins and Daniel Kane and Shachar Lovett}, editor = {Hugo Larochelle and Marc'Aurelio Ranzato and Raia Hadsell and Maria{-}Florina Balcan and Hsuan{-}Tien Lin}, title = {The Power of Comparisons for Actively Learning Linear Classifiers}, booktitle = {Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual}, year = {2020}, url = {https://proceedings.neurips.cc/paper/2020/hash/4607f7fff0dce694258e1c637512aa9d-Abstract.html}, timestamp = {Tue, 19 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/HopkinsKL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ChattopadhyayHH20, author = {Eshan Chattopadhyay and Pooya Hatami and Kaave Hosseini and Shachar Lovett and David Zuckerman}, editor = {Konstantin Makarychev and Yury Makarychev and Madhur Tulsiani and Gautam Kamath and Julia Chuzhoy}, title = {{XOR} lemmas for resilient functions against polynomials}, booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020}, pages = {234--246}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3357713.3384242}, doi = {10.1145/3357713.3384242}, timestamp = {Mon, 18 Dec 2023 07:33:37 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ChattopadhyayHH20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Lovett0Z20, author = {Shachar Lovett and Kewen Wu and Jiapeng Zhang}, editor = {Konstantin Makarychev and Yury Makarychev and Madhur Tulsiani and Gautam Kamath and Julia Chuzhoy}, title = {Decision list compression by mild random restrictions}, booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020}, pages = {247--254}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3357713.3384241}, doi = {10.1145/3357713.3384241}, timestamp = {Tue, 09 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Lovett0Z20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AlweissL0Z20, author = {Ryan Alweiss and Shachar Lovett and Kewen Wu and Jiapeng Zhang}, editor = {Konstantin Makarychev and Yury Makarychev and Madhur Tulsiani and Gautam Kamath and Julia Chuzhoy}, title = {Improved bounds for the sunflower lemma}, booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020}, pages = {624--630}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3357713.3384234}, doi = {10.1145/3357713.3384234}, timestamp = {Tue, 09 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/AlweissL0Z20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2001-05497, author = {Max Hopkins and Daniel Kane and Shachar Lovett and Gaurav Mahajan}, title = {Noise-tolerant, Reliable Active Classification with Comparison Queries}, journal = {CoRR}, volume = {abs/2001.05497}, year = {2020}, url = {https://arxiv.org/abs/2001.05497}, eprinttype = {arXiv}, eprint = {2001.05497}, timestamp = {Fri, 17 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2001-05497.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2002-03123, author = {Alon Gonen and Shachar Lovett and Michal Moshkovitz}, title = {Towards a combinatorial characterization of bounded memory learning}, journal = {CoRR}, volume = {abs/2002.03123}, year = {2020}, url = {https://arxiv.org/abs/2002.03123}, eprinttype = {arXiv}, eprint = {2002.03123}, timestamp = {Wed, 12 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2002-03123.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2004-11380, author = {Max Hopkins and Daniel M. Kane and Shachar Lovett and Gaurav Mahajan}, title = {Point Location and Active Learning: Learning Halfspaces Almost Optimally}, journal = {CoRR}, volume = {abs/2004.11380}, year = {2020}, url = {https://arxiv.org/abs/2004.11380}, eprinttype = {arXiv}, eprint = {2004.11380}, timestamp = {Tue, 28 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2004-11380.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2008-01316, author = {Eshan Chattopadhyay and Jason Gaitonde and Chin Ho Lee and Shachar Lovett and Abhishek Shetty}, title = {Fractional Pseudorandom Generators from Any Fourier Level}, journal = {CoRR}, volume = {abs/2008.01316}, year = {2020}, url = {https://arxiv.org/abs/2008.01316}, eprinttype = {arXiv}, eprint = {2008.01316}, timestamp = {Fri, 14 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2008-01316.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2010-08994, author = {Alexander Knop and Shachar Lovett and Sam McGuire and Weiqiang Yuan}, title = {Log-rank and lifting for AND-functions}, journal = {CoRR}, volume = {abs/2010.08994}, year = {2020}, url = {https://arxiv.org/abs/2010.08994}, eprinttype = {arXiv}, eprint = {2010.08994}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2010-08994.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2010-12081, author = {Sankeerth Rao Karingula and Shachar Lovett}, title = {Codes over integers, and the singularity of random matrices with large entries}, journal = {CoRR}, volume = {abs/2010.12081}, year = {2020}, url = {https://arxiv.org/abs/2010.12081}, eprinttype = {arXiv}, eprint = {2010.12081}, timestamp = {Tue, 27 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2010-12081.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2011-04658, author = {Max Hopkins and Tali Kaufman and Shachar Lovett}, title = {High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games}, journal = {CoRR}, volume = {abs/2011.04658}, year = {2020}, url = {https://arxiv.org/abs/2011.04658}, eprinttype = {arXiv}, eprint = {2011.04658}, timestamp = {Thu, 12 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2011-04658.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HopkinsKL20, author = {Max Hopkins and Tali Kaufman and Shachar Lovett}, title = {High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR20-170}}, year = {2020}, url = {https://eccc.weizmann.ac.il/report/2020/170}, eprinttype = {ECCC}, eprint = {TR20-170}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HopkinsKL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KaringulaL20, author = {Sankeerth Rao Karingula and Shachar Lovett}, title = {Codes over integers, and the singularity of random matrices with large entries}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR20-156}}, year = {2020}, url = {https://eccc.weizmann.ac.il/report/2020/156}, eprinttype = {ECCC}, eprint = {TR20-156}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KaringulaL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KnopLMY20, author = {Alexander Knop and Shachar Lovett and Sam McGuire and Weiqiang Yuan}, title = {Log-rank and lifting for AND-functions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR20-155}}, year = {2020}, url = {https://eccc.weizmann.ac.il/report/2020/155}, eprinttype = {ECCC}, eprint = {TR20-155}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KnopLMY20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettMZ20, author = {Shachar Lovett and Raghu Meka and Jiapeng Zhang}, title = {Improved lifting theorems via robust sunflowers}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR20-048}}, year = {2020}, url = {https://eccc.weizmann.ac.il/report/2020/048}, eprinttype = {ECCC}, eprint = {TR20-048}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettMZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fttcs/HatamiHL19, author = {Hamed Hatami and Pooya Hatami and Shachar Lovett}, title = {Higher-order Fourier Analysis and Applications}, journal = {Found. Trends Theor. Comput. Sci.}, volume = {13}, number = {4}, pages = {247--448}, year = {2019}, url = {https://doi.org/10.1561/0400000064}, doi = {10.1561/0400000064}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fttcs/HatamiHL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/KaneLM19, author = {Daniel M. Kane and Shachar Lovett and Shay Moran}, title = {Near-optimal Linear Decision Trees for k-SUM and Related Problems}, journal = {J. {ACM}}, volume = {66}, number = {3}, pages = {16:1--16:18}, year = {2019}, url = {https://doi.org/10.1145/3285953}, doi = {10.1145/3285953}, timestamp = {Sat, 08 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/KaneLM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/EzraL19, author = {Esther Ezra and Shachar Lovett}, title = {On the Beck-Fiala conjecture for random set systems}, journal = {Random Struct. Algorithms}, volume = {54}, number = {4}, pages = {665--675}, year = {2019}, url = {https://doi.org/10.1002/rsa.20810}, doi = {10.1002/RSA.20810}, timestamp = {Sun, 22 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/EzraL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KaneLR19, author = {Daniel Kane and Shachar Lovett and Sankeerth Rao}, title = {The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes}, journal = {{SIAM} J. Comput.}, volume = {48}, number = {4}, pages = {1425--1435}, year = {2019}, url = {https://doi.org/10.1137/18M1205856}, doi = {10.1137/18M1205856}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/KaneLR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/BansalDGL19, author = {Nikhil Bansal and Daniel Dadush and Shashwat Garg and Shachar Lovett}, title = {The Gram-Schmidt Walk: {A} Cure for the Banaszczyk Blues}, journal = {Theory Comput.}, volume = {15}, pages = {1--27}, year = {2019}, url = {https://doi.org/10.4086/toc.2019.v015a021}, doi = {10.4086/TOC.2019.V015A021}, timestamp = {Tue, 15 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/toc/BansalDGL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/ChattopadhyayHH19, author = {Eshan Chattopadhyay and Pooya Hatami and Kaave Hosseini and Shachar Lovett}, title = {Pseudorandom Generators from Polarizing Random Walks}, journal = {Theory Comput.}, volume = {15}, pages = {1--26}, year = {2019}, url = {https://doi.org/10.4086/toc.2019.v015a010}, doi = {10.4086/TOC.2019.V015A010}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/ChattopadhyayHH19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/DadushGLN19, author = {Daniel Dadush and Shashwat Garg and Shachar Lovett and Aleksandar Nikolov}, title = {Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem}, journal = {Theory Comput.}, volume = {15}, pages = {1--58}, year = {2019}, url = {https://doi.org/10.4086/toc.2019.v015a015}, doi = {10.4086/TOC.2019.V015A015}, timestamp = {Tue, 09 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/toc/DadushGLN19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/LovettSZ19, author = {Shachar Lovett and Noam Solomon and Jiapeng Zhang}, editor = {Amir Shpilka}, title = {From {DNF} Compression to Sunflower Theorems via Regularity}, booktitle = {34th Computational Complexity Conference, {CCC} 2019, July 18-20, 2019, New Brunswick, NJ, {USA}}, series = {LIPIcs}, volume = {137}, pages = {5:1--5:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.CCC.2019.5}, doi = {10.4230/LIPICS.CCC.2019.5}, timestamp = {Thu, 02 Feb 2023 13:27:04 +0100}, biburl = {https://dblp.org/rec/conf/coco/LovettSZ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/HosseiniLY19, author = {Kaave Hosseini and Shachar Lovett and Grigory Yaroslavtsev}, editor = {Amir Shpilka}, title = {Optimality of Linear Sketching Under Modular Updates}, booktitle = {34th Computational Complexity Conference, {CCC} 2019, July 18-20, 2019, New Brunswick, NJ, {USA}}, series = {LIPIcs}, volume = {137}, pages = {13:1--13:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.CCC.2019.13}, doi = {10.4230/LIPICS.CCC.2019.13}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/HosseiniLY19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/ChattopadhyayLV19, author = {Arkadev Chattopadhyay and Shachar Lovett and Marc Vinyals}, editor = {Amir Shpilka}, title = {Equality Alone Does not Simulate Randomness}, booktitle = {34th Computational Complexity Conference, {CCC} 2019, July 18-20, 2019, New Brunswick, NJ, {USA}}, series = {LIPIcs}, volume = {137}, pages = {14:1--14:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.CCC.2019.14}, doi = {10.4230/LIPICS.CCC.2019.14}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/ChattopadhyayLV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/BhrushundiHLR19, author = {Abhishek Bhrushundi and Kaave Hosseini and Shachar Lovett and Sankeerth Rao}, editor = {Avrim Blum}, title = {Torus Polynomials: An Algebraic Approach to {ACC} Lower Bounds}, booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS} 2019, January 10-12, 2019, San Diego, California, {USA}}, series = {LIPIcs}, volume = {124}, pages = {13:1--13:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.13}, doi = {10.4230/LIPICS.ITCS.2019.13}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/BhrushundiHLR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/ChattopadhyayHL19, author = {Eshan Chattopadhyay and Pooya Hatami and Shachar Lovett and Avishay Tal}, editor = {Avrim Blum}, title = {Pseudorandom Generators from the Second Fourier Level and Applications to {AC0} with Parity Gates}, booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS} 2019, January 10-12, 2019, San Diego, California, {USA}}, series = {LIPIcs}, volume = {124}, pages = {22:1--22:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.22}, doi = {10.4230/LIPICS.ITCS.2019.22}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/ChattopadhyayHL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LovettZ19, author = {Shachar Lovett and Jiapeng Zhang}, editor = {Moses Charikar and Edith Cohen}, title = {{DNF} sparsification beyond sunflowers}, booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019}, pages = {454--460}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3313276.3316323}, doi = {10.1145/3313276.3316323}, timestamp = {Sat, 22 Jun 2019 17:42:26 +0200}, biburl = {https://dblp.org/rec/conf/stoc/LovettZ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1903-00580, author = {Shachar Lovett and Noam Solomon and Jiapeng Zhang}, title = {From {DNF} compression to sunflower theorems via regularity}, journal = {CoRR}, volume = {abs/1903.00580}, year = {2019}, url = {http://arxiv.org/abs/1903.00580}, eprinttype = {arXiv}, eprint = {1903.00580}, timestamp = {Tue, 02 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1903-00580.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1907-03816, author = {Max Hopkins and Daniel M. Kane and Shachar Lovett}, title = {The Power of Comparisons for Actively Learning Linear Classifiers}, journal = {CoRR}, volume = {abs/1907.03816}, year = {2019}, url = {http://arxiv.org/abs/1907.03816}, eprinttype = {arXiv}, eprint = {1907.03816}, timestamp = {Wed, 17 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1907-03816.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1908-08483, author = {Ryan Alweiss and Shachar Lovett and Kewen Wu and Jiapeng Zhang}, title = {Improved bounds for the sunflower lemma}, journal = {CoRR}, volume = {abs/1908.08483}, year = {2019}, url = {http://arxiv.org/abs/1908.08483}, eprinttype = {arXiv}, eprint = {1908.08483}, timestamp = {Sat, 23 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1908-08483.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1909-10658, author = {Shachar Lovett and Kewen Wu and Jiapeng Zhang}, title = {Decision list compression by mild random restrictions}, journal = {CoRR}, volume = {abs/1909.10658}, year = {2019}, url = {http://arxiv.org/abs/1909.10658}, eprinttype = {arXiv}, eprint = {1909.10658}, timestamp = {Sat, 23 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1909-10658.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AlweissLWZ19, author = {Ryan Alweiss and Shachar Lovett and Kewen Wu and Jiapeng Zhang}, title = {Improved bounds for the sunflower lemma}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR19-110}}, year = {2019}, url = {https://eccc.weizmann.ac.il/report/2019/110}, eprinttype = {ECCC}, eprint = {TR19-110}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AlweissLWZ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChattopadhyayHH19, author = {Eshan Chattopadhyay and Pooya Hatami and Kaave Hosseini and Shachar Lovett and David Zuckerman}, title = {{XOR} Lemmas for Resilient Functions Against Polynomials}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR19-145}}, year = {2019}, url = {https://eccc.weizmann.ac.il/report/2019/145}, eprinttype = {ECCC}, eprint = {TR19-145}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayHH19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HatamiHL19, author = {Hamed Hatami and Kaave Hosseini and Shachar Lovett}, title = {Sign rank vs Discrepancy}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR19-067}}, year = {2019}, url = {https://eccc.weizmann.ac.il/report/2019/067}, eprinttype = {ECCC}, eprint = {TR19-067}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HatamiHL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettSZ19, author = {Shachar Lovett and Noam Solomon and Jiapeng Zhang}, title = {From {DNF} compression to sunflower theorems via regularity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR19-028}}, year = {2019}, url = {https://eccc.weizmann.ac.il/report/2019/028}, eprinttype = {ECCC}, eprint = {TR19-028}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettSZ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettWZ19, author = {Shachar Lovett and Kewen Wu and Jiapeng Zhang}, title = {Decision list compression by mild random restrictions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR19-137}}, year = {2019}, url = {https://eccc.weizmann.ac.il/report/2019/137}, eprinttype = {ECCC}, eprint = {TR19-137}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettWZ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/ApplebaumL18, author = {Benny Applebaum and Shachar Lovett}, title = {Algebraic Attacks against Random Local Functions and Their Countermeasures}, journal = {{SIAM} J. Comput.}, volume = {47}, number = {1}, pages = {52--79}, year = {2018}, url = {https://doi.org/10.1137/16M1085942}, doi = {10.1137/16M1085942}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/ApplebaumL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HatamiHL18, author = {Hamed Hatami and Kaave Hosseini and Shachar Lovett}, title = {Structure of Protocols for {XOR} Functions}, journal = {{SIAM} J. Comput.}, volume = {47}, number = {1}, pages = {208--217}, year = {2018}, url = {https://doi.org/10.1137/17M1136869}, doi = {10.1137/17M1136869}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HatamiHL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/AggarwalDL18, author = {Divesh Aggarwal and Yevgeniy Dodis and Shachar Lovett}, title = {Non-Malleable Codes from Additive Combinatorics}, journal = {{SIAM} J. Comput.}, volume = {47}, number = {2}, pages = {524--546}, year = {2018}, url = {https://doi.org/10.1137/140985251}, doi = {10.1137/140985251}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/AggarwalDL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/BhowmickL18, author = {Abhishek Bhowmick and Shachar Lovett}, title = {The List Decoding Radius for Reed-Muller Codes Over Small Fields}, journal = {{IEEE} Trans. Inf. Theory}, volume = {64}, number = {6}, pages = {4382--4391}, year = {2018}, url = {https://doi.org/10.1109/TIT.2018.2822686}, doi = {10.1109/TIT.2018.2822686}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/BhowmickL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/LovettO18, author = {Shachar Lovett and Ryan O'Donnell}, title = {Special Issue: {CCC} 2017: Guest Editor's Foreword}, journal = {Theory Comput.}, volume = {14}, number = {1}, pages = {1--2}, year = {2018}, url = {https://doi.org/10.4086/toc.2018.v014a002}, doi = {10.4086/TOC.2018.V014A002}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/LovettO18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/LiLZ18, author = {Xin Li and Shachar Lovett and Jiapeng Zhang}, editor = {Eric Blais and Klaus Jansen and Jos{\'{e}} D. P. Rolim and David Steurer}, title = {Sunflowers and Quasi-Sunflowers from Randomness Extractors}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton, NJ, {USA}}, series = {LIPIcs}, volume = {116}, pages = {51:1--51:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.51}, doi = {10.4230/LIPICS.APPROX-RANDOM.2018.51}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/LiLZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/ChattopadhyayHH18, author = {Eshan Chattopadhyay and Pooya Hatami and Kaave Hosseini and Shachar Lovett}, editor = {Rocco A. Servedio}, title = {Pseudorandom Generators from Polarizing Random Walks}, booktitle = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24, 2018, San Diego, CA, {USA}}, series = {LIPIcs}, volume = {102}, pages = {1:1--1:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.CCC.2018.1}, doi = {10.4230/LIPICS.CCC.2018.1}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/ChattopadhyayHH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/CarmosinoILM18, author = {Marco L. Carmosino and Russell Impagliazzo and Shachar Lovett and Ivan Mihajlin}, editor = {Rocco A. Servedio}, title = {Hardness Amplification for Non-Commutative Arithmetic Circuits}, booktitle = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24, 2018, San Diego, CA, {USA}}, series = {LIPIcs}, volume = {102}, pages = {12:1--12:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.CCC.2018.12}, doi = {10.4230/LIPICS.CCC.2018.12}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/CarmosinoILM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Lovett18, author = {Shachar Lovett}, editor = {Mikkel Thorup}, title = {{MDS} Matrices over Small Fields: {A} Proof of the {GM-MDS} Conjecture}, booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2018, Paris, France, October 7-9, 2018}, pages = {194--199}, publisher = {{IEEE} Computer Society}, year = {2018}, url = {https://doi.org/10.1109/FOCS.2018.00027}, doi = {10.1109/FOCS.2018.00027}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Lovett18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/KaneLM18, author = {Daniel M. Kane and Shachar Lovett and Shay Moran}, editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'{a}}niel Marx and Donald Sannella}, title = {Generalized Comparison Trees for Point-Location Problems}, booktitle = {45th International Colloquium on Automata, Languages, and Programming, {ICALP} 2018, July 9-13, 2018, Prague, Czech Republic}, series = {LIPIcs}, volume = {107}, pages = {82:1--82:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.82}, doi = {10.4230/LIPICS.ICALP.2018.82}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/KaneLM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/LovettRV18, author = {Shachar Lovett and Sankeerth Rao and Alexander Vardy}, editor = {Artur Czumaj}, title = {Probabilistic Existence of Large Sets of Designs}, booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018}, pages = {1545--1556}, publisher = {{SIAM}}, year = {2018}, url = {https://doi.org/10.1137/1.9781611975031.101}, doi = {10.1137/1.9781611975031.101}, timestamp = {Tue, 02 Feb 2021 17:07:58 +0100}, biburl = {https://dblp.org/rec/conf/soda/LovettRV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/LovettTZ18, author = {Shachar Lovett and Avishay Tal and Jiapeng Zhang}, editor = {Artur Czumaj}, title = {The Robust Sensitivity of Boolean Functions}, booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018}, pages = {1822--1833}, publisher = {{SIAM}}, year = {2018}, url = {https://doi.org/10.1137/1.9781611975031.119}, doi = {10.1137/1.9781611975031.119}, timestamp = {Tue, 02 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/LovettTZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KaneLM18, author = {Daniel M. Kane and Shachar Lovett and Shay Moran}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Near-optimal linear decision trees for k-SUM and related problems}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {554--563}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188770}, doi = {10.1145/3188745.3188770}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KaneLM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BansalDGL18, author = {Nikhil Bansal and Daniel Dadush and Shashwat Garg and Shachar Lovett}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {The gram-schmidt walk: a cure for the Banaszczyk blues}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {587--597}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188850}, doi = {10.1145/3188745.3188850}, timestamp = {Tue, 15 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BansalDGL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1803-02523, author = {Shachar Lovett}, title = {{MDS} matrices over small fields: {A} proof of the {GM-MDS} conjecture}, journal = {CoRR}, volume = {abs/1803.02523}, year = {2018}, url = {http://arxiv.org/abs/1803.02523}, eprinttype = {arXiv}, eprint = {1803.02523}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1803-02523.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1804-08176, author = {Abhishek Bhrushundi and Kaave Hosseini and Shachar Lovett and Sankeerth Rao}, title = {Torus polynomials: an algebraic approach to {ACC} lower bounds}, journal = {CoRR}, volume = {abs/1804.08176}, year = {2018}, url = {http://arxiv.org/abs/1804.08176}, eprinttype = {arXiv}, eprint = {1804.08176}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1804-08176.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1804-08237, author = {Daniel M. Kane and Shachar Lovett and Shay Moran}, title = {Generalized comparison trees for point-location problems}, journal = {CoRR}, volume = {abs/1804.08237}, year = {2018}, url = {http://arxiv.org/abs/1804.08237}, eprinttype = {arXiv}, eprint = {1804.08237}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1804-08237.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1809-09063, author = {Kaave Hosseini and Shachar Lovett and Grigory Yaroslavtsev}, title = {Optimality of Linear Sketching under Modular Updates}, journal = {CoRR}, volume = {abs/1809.09063}, year = {2018}, url = {http://arxiv.org/abs/1809.09063}, eprinttype = {arXiv}, eprint = {1809.09063}, timestamp = {Fri, 05 Oct 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1809-09063.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BhrushundiHLR18, author = {Abhishek Bhrushundi and Kaave Hosseini and Shachar Lovett and Sankeerth Rao}, title = {Torus polynomials: an algebraic approach to {ACC} lower bounds}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-076}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/076}, eprinttype = {ECCC}, eprint = {TR18-076}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BhrushundiHLR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/CarmosinoILM18, author = {Marco Carmosino and Russell Impagliazzo and Shachar Lovett and Ivan Mihajlin}, title = {Hardness Amplification for Non-Commutative Arithmetic Circuits}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-095}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/095}, eprinttype = {ECCC}, eprint = {TR18-095}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/CarmosinoILM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChattopadhyayHH18, author = {Eshan Chattopadhyay and Pooya Hatami and Kaave Hosseini and Shachar Lovett}, title = {Pseudorandom Generators from Polarizing Random Walks}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-015}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/015}, eprinttype = {ECCC}, eprint = {TR18-015}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayHH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChattopadhyayHL18, author = {Eshan Chattopadhyay and Pooya Hatami and Shachar Lovett and Avishay Tal}, title = {Pseudorandom generators from the second Fourier level and applications to {AC0} with parity gates}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-155}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/155}, eprinttype = {ECCC}, eprint = {TR18-155}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayHL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChattopadhyayLV18, author = {Arkadev Chattopadhyay and Shachar Lovett and Marc Vinyals}, title = {Equality Alone Does Not Simulate Randomness}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-206}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/206}, eprinttype = {ECCC}, eprint = {TR18-206}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayLV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HosseiniL18, author = {Kaave Hosseini and Shachar Lovett}, title = {A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-142}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/142}, eprinttype = {ECCC}, eprint = {TR18-142}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HosseiniL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HosseiniLY18, author = {Kaave Hosseini and Shachar Lovett and Grigory Yaroslavtsev}, title = {Optimality of Linear Sketching under Modular Updates}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-169}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/169}, eprinttype = {ECCC}, eprint = {TR18-169}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HosseiniLY18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KaneLM18, author = {Daniel M. Kane and Shachar Lovett and Shay Moran}, title = {Generalized comparison trees for point-location problems}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-074}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/074}, eprinttype = {ECCC}, eprint = {TR18-074}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KaneLM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LiLZ18, author = {Xin Li and Shachar Lovett and Jiapeng Zhang}, title = {Sunflowers and Quasi-sunflowers from Randomness Extractors}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-082}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/082}, eprinttype = {ECCC}, eprint = {TR18-082}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LiLZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Lovett18, author = {Shachar Lovett}, title = {A proof of the {GM-MDS} conjecture}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-047}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/047}, eprinttype = {ECCC}, eprint = {TR18-047}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Lovett18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettZ18, author = {Shachar Lovett and Jiapeng Zhang}, title = {{DNF} sparsification beyond sunflowers}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-190}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/190}, eprinttype = {ECCC}, eprint = {TR18-190}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/HosseiniL17, author = {Kaave Hosseini and Shachar Lovett}, title = {On the structure of the spectrum of small sets}, journal = {J. Comb. Theory, Ser. {A}}, volume = {148}, pages = {1--14}, year = {2017}, url = {https://doi.org/10.1016/j.jcta.2016.11.009}, doi = {10.1016/J.JCTA.2016.11.009}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/HosseiniL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/Lovett17, author = {Shachar Lovett}, title = {Additive Combinatorics and its Applications in Theoretical Computer Science}, journal = {Theory Comput.}, volume = {8}, pages = {1--55}, year = {2017}, url = {https://doi.org/10.4086/toc.gs.2017.008}, doi = {10.4086/TOC.GS.2017.008}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/Lovett17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/LovettZ17, author = {Shachar Lovett and Jiapeng Zhang}, editor = {Satyen Kale and Ohad Shamir}, title = {Noisy Population Recovery from Unknown Noise}, booktitle = {Proceedings of the 30th Conference on Learning Theory, {COLT} 2017, Amsterdam, The Netherlands, 7-10 July 2017}, series = {Proceedings of Machine Learning Research}, volume = {65}, pages = {1417--1431}, publisher = {{PMLR}}, year = {2017}, url = {http://proceedings.mlr.press/v65/lovett17a.html}, timestamp = {Wed, 29 May 2019 08:41:46 +0200}, biburl = {https://dblp.org/rec/conf/colt/LovettZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/KaneLR17, author = {Daniel Kane and Shachar Lovett and Sankeerth Rao}, editor = {Chris Umans}, title = {The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes}, booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2017, Berkeley, CA, USA, October 15-17, 2017}, pages = {252--259}, publisher = {{IEEE} Computer Society}, year = {2017}, url = {https://doi.org/10.1109/FOCS.2017.31}, doi = {10.1109/FOCS.2017.31}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/KaneLR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/KaneLMZ17, author = {Daniel M. Kane and Shachar Lovett and Shay Moran and Jiapeng Zhang}, editor = {Chris Umans}, title = {Active Classification with Comparison Queries}, booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2017, Berkeley, CA, USA, October 15-17, 2017}, pages = {355--366}, publisher = {{IEEE} Computer Society}, year = {2017}, url = {https://doi.org/10.1109/FOCS.2017.40}, doi = {10.1109/FOCS.2017.40}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/KaneLMZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tcc/LovettZ17, author = {Shachar Lovett and Jiapeng Zhang}, editor = {Yael Kalai and Leonid Reyzin}, title = {On the Impossibility of Entropy Reversal, and Its Application to Zero-Knowledge Proofs}, booktitle = {Theory of Cryptography - 15th International Conference, {TCC} 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {10677}, pages = {31--55}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-70500-2\_2}, doi = {10.1007/978-3-319-70500-2\_2}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tcc/LovettZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/KaneLR17, author = {Daniel M. Kane and Shachar Lovett and Sankeerth Rao}, title = {Labeling the complete bipartite graph with no zero cycles}, journal = {CoRR}, volume = {abs/1702.05773}, year = {2017}, url = {http://arxiv.org/abs/1702.05773}, eprinttype = {arXiv}, eprint = {1702.05773}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/KaneLR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/KaneLMZ17, author = {Daniel M. Kane and Shachar Lovett and Shay Moran and Jiapeng Zhang}, title = {Active classification with comparison queries}, journal = {CoRR}, volume = {abs/1704.03564}, year = {2017}, url = {http://arxiv.org/abs/1704.03564}, eprinttype = {arXiv}, eprint = {1704.03564}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/KaneLMZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/KaneLM17, author = {Daniel M. Kane and Shachar Lovett and Shay Moran}, title = {Near-optimal linear decision trees for k-SUM and related problems}, journal = {CoRR}, volume = {abs/1705.01720}, year = {2017}, url = {http://arxiv.org/abs/1705.01720}, eprinttype = {arXiv}, eprint = {1705.01720}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/KaneLM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1708-01079, author = {Nikhil Bansal and Daniel Dadush and Shashwat Garg and Shachar Lovett}, title = {The Gram-Schmidt Walk: {A} Cure for the Banaszczyk Blues}, journal = {CoRR}, volume = {abs/1708.01079}, year = {2017}, url = {http://arxiv.org/abs/1708.01079}, eprinttype = {arXiv}, eprint = {1708.01079}, timestamp = {Tue, 15 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1708-01079.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KaneLM17, author = {Daniel M. Kane and Shachar Lovett and Shay Moran}, title = {Near-optimal linear decision trees for k-SUM and related problems}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-082}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/082}, eprinttype = {ECCC}, eprint = {TR17-082}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KaneLM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KaneLMZ17, author = {Daniel M. Kane and Shachar Lovett and Shay Moran and Jiapeng Zhang}, title = {Active classification with comparison queries}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-085}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/085}, eprinttype = {ECCC}, eprint = {TR17-085}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KaneLMZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KaneLR17, author = {Daniel M. Kane and Shachar Lovett and Sankeerth Rao}, title = {Labeling the complete bipartite graph with no zero cycles}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-033}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/033}, eprinttype = {ECCC}, eprint = {TR17-033}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KaneLR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettRV17, author = {Shachar Lovett and Sankeerth Rao and Alexander Vardy}, title = {Probabilistic Existence of Large Sets of Designs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-070}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/070}, eprinttype = {ECCC}, eprint = {TR17-070}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettRV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/LovettZ17, author = {Shachar Lovett and Jiapeng Zhang}, title = {On the impossibility of entropy reversal, and its application to zero-knowledge proofs}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {922}, year = {2017}, url = {http://eprint.iacr.org/2017/922}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/LovettZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/Lovett16, author = {Shachar Lovett}, title = {Communication is Bounded by Root of Rank}, journal = {J. {ACM}}, volume = {63}, number = {1}, pages = {1:1--1:9}, year = {2016}, url = {https://doi.org/10.1145/2724704}, doi = {10.1145/2724704}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/Lovett16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/GoosLMWZ16, author = {Mika G{\"{o}}{\"{o}}s and Shachar Lovett and Raghu Meka and Thomas Watson and David Zuckerman}, title = {Rectangles Are Nonnegative Juntas}, journal = {{SIAM} J. Comput.}, volume = {45}, number = {5}, pages = {1835--1869}, year = {2016}, url = {https://doi.org/10.1137/15M103145X}, doi = {10.1137/15M103145X}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/GoosLMWZ16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/DadushGLN16, author = {Daniel Dadush and Shashwat Garg and Shachar Lovett and Aleksandar Nikolov}, editor = {Klaus Jansen and Claire Mathieu and Jos{\'{e}} D. P. Rolim and Chris Umans}, title = {Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris, France}, series = {LIPIcs}, volume = {60}, pages = {28:1--28:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.28}, doi = {10.4230/LIPICS.APPROX-RANDOM.2016.28}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/DadushGLN16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/EzraL16, author = {Esther Ezra and Shachar Lovett}, editor = {Klaus Jansen and Claire Mathieu and Jos{\'{e}} D. P. Rolim and Chris Umans}, title = {On the Beck-Fiala Conjecture for Random Set Systems}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris, France}, series = {LIPIcs}, volume = {60}, pages = {29:1--29:10}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.29}, doi = {10.4230/LIPICS.APPROX-RANDOM.2016.29}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/EzraL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/HatamiHL16, author = {Hamed Hatami and Kaave Hosseini and Shachar Lovett}, editor = {Irit Dinur}, title = {Structure of Protocols for {XOR} Functions}, booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS} 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, {USA}}, pages = {282--288}, publisher = {{IEEE} Computer Society}, year = {2016}, url = {https://doi.org/10.1109/FOCS.2016.38}, doi = {10.1109/FOCS.2016.38}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/focs/HatamiHL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isit/AggarwalHL16, author = {Divesh Aggarwal and Kaave Hosseini and Shachar Lovett}, title = {Affine-malleable extractors, spectrum doubling, and application to privacy amplification}, booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2016, Barcelona, Spain, July 10-15, 2016}, pages = {2913--2917}, publisher = {{IEEE}}, year = {2016}, url = {https://doi.org/10.1109/ISIT.2016.7541832}, doi = {10.1109/ISIT.2016.7541832}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isit/AggarwalHL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ApplebaumL16, author = {Benny Applebaum and Shachar Lovett}, editor = {Daniel Wichs and Yishay Mansour}, title = {Algebraic attacks against random local functions and their countermeasures}, booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016}, pages = {1087--1100}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2897518.2897554}, doi = {10.1145/2897518.2897554}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/ApplebaumL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/DadushGLN16, author = {Daniel Dadush and Shashwat Garg and Shachar Lovett and Aleksandar Nikolov}, title = {Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem}, journal = {CoRR}, volume = {abs/1612.04304}, year = {2016}, url = {http://arxiv.org/abs/1612.04304}, eprinttype = {arXiv}, eprint = {1612.04304}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/DadushGLN16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HosseiniL16, author = {Kaave Hosseini and Shachar Lovett}, title = {Structure of protocols for {XOR} functions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-044}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/044}, eprinttype = {ECCC}, eprint = {TR16-044}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HosseiniL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Lovett16, author = {Shachar Lovett}, title = {The Fourier structure of low degree polynomials}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-025}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/025}, eprinttype = {ECCC}, eprint = {TR16-025}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Lovett16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettZ16, author = {Shachar Lovett and Jiapeng Zhang}, title = {Noisy Population Recovery from Unknown Noise}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-021}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/021}, eprinttype = {ECCC}, eprint = {TR16-021}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettZ16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettZ16a, author = {Shachar Lovett and Jiapeng Zhang}, title = {On the impossibility of entropy reversal, and its application to zero-knowledge proofs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-118}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/118}, eprinttype = {ECCC}, eprint = {TR16-118}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettZ16a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettZ16b, author = {Shachar Lovett and Jiapeng Zhang}, title = {Robust sensitivity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-161}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/161}, eprinttype = {ECCC}, eprint = {TR16-161}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettZ16b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/GavinskyLSS15, author = {Dmitry Gavinsky and Shachar Lovett and Michael E. Saks and Srikanth Srinivasan}, title = {A tail bound for read-\emph{k} families of functions}, journal = {Random Struct. Algorithms}, volume = {47}, number = {1}, pages = {99--108}, year = {2015}, url = {https://doi.org/10.1002/rsa.20532}, doi = {10.1002/RSA.20532}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/GavinskyLSS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/LovettMR15, author = {Shachar Lovett and Cristopher Moore and Alexander Russell}, title = {Group representations that resist random sampling}, journal = {Random Struct. Algorithms}, volume = {47}, number = {3}, pages = {605--614}, year = {2015}, url = {https://doi.org/10.1002/rsa.20555}, doi = {10.1002/RSA.20555}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rsa/LovettMR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/LovettM15, author = {Shachar Lovett and Raghu Meka}, title = {Constructive Discrepancy Minimization by Walking on the Edges}, journal = {{SIAM} J. Comput.}, volume = {44}, number = {5}, pages = {1573--1582}, year = {2015}, url = {https://doi.org/10.1137/130929400}, doi = {10.1137/130929400}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/LovettM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/Lovett15, author = {Shachar Lovett}, title = {An Exposition of Sanders' Quasi-Polynomial Freiman-Ruzsa Theorem}, journal = {Theory Comput.}, volume = {6}, pages = {1--14}, year = {2015}, url = {https://doi.org/10.4086/toc.gs.2015.006}, doi = {10.4086/TOC.GS.2015.006}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/Lovett15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/AnbalaganHLNVW15, author = {Yogesh Anbalagan and Hao Huang and Shachar Lovett and Sergey Norin and Adrian Vetta and Hehui Wu}, editor = {Naveen Garg and Klaus Jansen and Anup Rao and Jos{\'{e}} D. P. Rolim}, title = {Large Supports are Required for Well-Supported Nash Equilibria}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton, NJ, {USA}}, series = {LIPIcs}, volume = {40}, pages = {78--84}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.78}, doi = {10.4230/LIPICS.APPROX-RANDOM.2015.78}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/AnbalaganHLNVW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/0001L15, author = {Abhishek Bhowmick and Shachar Lovett}, editor = {David Zuckerman}, title = {Nonclassical Polynomials as a Barrier to Polynomial Lower Bounds}, booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19, 2015, Portland, Oregon, {USA}}, series = {LIPIcs}, volume = {33}, pages = {72--87}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.CCC.2015.72}, doi = {10.4230/LIPICS.CCC.2015.72}, timestamp = {Thu, 02 Feb 2023 13:27:06 +0100}, biburl = {https://dblp.org/rec/conf/coco/0001L15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LovettZ15, author = {Shachar Lovett and Jiapeng Zhang}, editor = {Rocco A. Servedio and Ronitt Rubinfeld}, title = {Improved Noisy Population Recovery, and Reverse Bonami-Beckner Inequality for Sparse Functions}, booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015}, pages = {137--142}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2746539.2746540}, doi = {10.1145/2746539.2746540}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/LovettZ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GoosLM0Z15, author = {Mika G{\"{o}}{\"{o}}s and Shachar Lovett and Raghu Meka and Thomas Watson and David Zuckerman}, editor = {Rocco A. Servedio and Ronitt Rubinfeld}, title = {Rectangles Are Nonnegative Juntas}, booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015}, pages = {257--266}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2746539.2746596}, doi = {10.1145/2746539.2746596}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/GoosLM0Z15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/0001L15, author = {Abhishek Bhowmick and Shachar Lovett}, editor = {Rocco A. Servedio and Ronitt Rubinfeld}, title = {The List Decoding Radius of Reed-Muller Codes over Small Fields}, booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015}, pages = {277--285}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2746539.2746543}, doi = {10.1145/2746539.2746543}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/0001L15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/AnbalaganHLNVW15, author = {Yogesh Anbalagan and Hao Huang and Shachar Lovett and Sergey Norin and Adrian Vetta and Hehui Wu}, title = {Large Supports are required for Well-Supported Nash Equilibria}, journal = {CoRR}, volume = {abs/1504.03602}, year = {2015}, url = {http://arxiv.org/abs/1504.03602}, eprinttype = {arXiv}, eprint = {1504.03602}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/AnbalaganHLNVW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/0001L15, author = {Abhishek Bhowmick and Shachar Lovett}, title = {Bias vs structure of polynomials in large fields, and applications in effective algebraic geometry and coding theory}, journal = {CoRR}, volume = {abs/1506.02047}, year = {2015}, url = {http://arxiv.org/abs/1506.02047}, eprinttype = {arXiv}, eprint = {1506.02047}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/0001L15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/0001L15, author = {Abhishek Bhowmick and Shachar Lovett}, title = {Bias vs structure of polynomials in large fields, and applications in effective algebraic geometry and coding theory}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-096}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/096}, eprinttype = {ECCC}, eprint = {TR15-096}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/0001L15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AggarwalHL15, author = {Divesh Aggarwal and Kaave Hosseini and Shachar Lovett}, title = {Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-179}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/179}, eprinttype = {ECCC}, eprint = {TR15-179}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AggarwalHL15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ApplebaumL15, author = {Benny Applebaum and Shachar Lovett}, title = {Algebraic Attacks against Random Local Functions and Their Countermeasures}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-172}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/172}, eprinttype = {ECCC}, eprint = {TR15-172}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ApplebaumL15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/EzraL15, author = {Esther Ezra and Shachar Lovett}, title = {On the Beck-Fiala Conjecture for Random Set Systems}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-190}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/190}, eprinttype = {ECCC}, eprint = {TR15-190}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/EzraL15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/AggarwalHL15, author = {Divesh Aggarwal and Kaave Hosseini and Shachar Lovett}, title = {Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {1094}, year = {2015}, url = {http://eprint.iacr.org/2015/1094}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/AggarwalHL15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/DvirKL14, author = {Zeev Dvir and J{\'{a}}nos Koll{\'{a}}r and Shachar Lovett}, title = {Variety Evasive Sets}, journal = {Comput. Complex.}, volume = {23}, number = {4}, pages = {509--529}, year = {2014}, url = {https://doi.org/10.1007/s00037-013-0073-9}, doi = {10.1007/S00037-013-0073-9}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/DvirKL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/LovettA14, author = {Shachar Lovett}, title = {Recent Advances on the Log-Rank Conjecture in Communication Complexity}, journal = {Bull. {EATCS}}, volume = {112}, year = {2014}, url = {http://eatcs.org/beatcs/index.php/beatcs/article/view/260}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eatcs/LovettA14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/Ben-SassonLR14, author = {Eli Ben{-}Sasson and Shachar Lovett and Noga Ron{-}Zewi}, title = {An Additive Combinatorics Approach Relating Rank to Communication Complexity}, journal = {J. {ACM}}, volume = {61}, number = {4}, pages = {22:1--22:18}, year = {2014}, url = {https://doi.org/10.1145/2629598}, doi = {10.1145/2629598}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jacm/Ben-SassonLR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Even-ZoharL14, author = {Chaim Even{-}Zohar and Shachar Lovett}, title = {The Freiman-Ruzsa theorem over finite fields}, journal = {J. Comb. Theory, Ser. {A}}, volume = {125}, pages = {333--341}, year = {2014}, url = {https://doi.org/10.1016/j.jcta.2014.03.011}, doi = {10.1016/J.JCTA.2014.03.011}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jct/Even-ZoharL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/FazeliLV14, author = {Arman Fazeli and Shachar Lovett and Alexander Vardy}, title = {Nontrivial t-designs over finite fields exist for all t}, journal = {J. Comb. Theory, Ser. {A}}, volume = {127}, pages = {149--160}, year = {2014}, url = {https://doi.org/10.1016/j.jcta.2014.06.001}, doi = {10.1016/J.JCTA.2014.06.001}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jct/FazeliLV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HatamiL14, author = {Hamed Hatami and Shachar Lovett}, title = {Correlation Testing for Affine Invariant Properties on {\unicode{54589}}\({}_{\mbox{p\({}^{\mbox{n}}\)}}\) in the High Error Regime}, journal = {{SIAM} J. Comput.}, volume = {43}, number = {4}, pages = {1417--1455}, year = {2014}, url = {https://doi.org/10.1137/110831349}, doi = {10.1137/110831349}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HatamiL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/0001DL14, author = {Abhishek Bhowmick and Zeev Dvir and Shachar Lovett}, title = {New Bounds for Matching Vector Families}, journal = {{SIAM} J. Comput.}, volume = {43}, number = {5}, pages = {1654--1683}, year = {2014}, url = {https://doi.org/10.1137/130932296}, doi = {10.1137/130932296}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/0001DL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/atal/BachrachLLRZ14, author = {Yoram Bachrach and Omer Lev and Shachar Lovett and Jeffrey S. Rosenschein and Morteza Zadimoghaddam}, editor = {Ana L. C. Bazzan and Michael N. Huhns and Alessio Lomuscio and Paul Scerri}, title = {Cooperative weakest link games}, booktitle = {International conference on Autonomous Agents and Multi-Agent Systems, {AAMAS} '14, Paris, France, May 5-9, 2014}, pages = {589--596}, publisher = {{IFAAMAS/ACM}}, year = {2014}, url = {http://dl.acm.org/citation.cfm?id=2615827}, timestamp = {Thu, 25 Sep 2014 07:46:15 +0200}, biburl = {https://dblp.org/rec/conf/atal/BachrachLLRZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/GavinskyL14, author = {Dmitry Gavinsky and Shachar Lovett}, editor = {Javier Esparza and Pierre Fraigniaud and Thore Husfeldt and Elias Koutsoupias}, title = {En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations}, 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 = {514--524}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-43948-7\_43}, doi = {10.1007/978-3-662-43948-7\_43}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/GavinskyL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AggarwalDL14, author = {Divesh Aggarwal and Yevgeniy Dodis and Shachar Lovett}, editor = {David B. Shmoys}, title = {Non-malleable codes from additive combinatorics}, booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA, May 31 - June 03, 2014}, pages = {774--783}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2591796.2591804}, doi = {10.1145/2591796.2591804}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AggarwalDL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Lovett14, author = {Shachar Lovett}, editor = {David B. Shmoys}, title = {Communication is bounded by root of rank}, booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA, May 31 - June 03, 2014}, pages = {842--846}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2591796.2591799}, doi = {10.1145/2591796.2591799}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Lovett14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/ImpagliazzoLPS14, author = {Russell Impagliazzo and Shachar Lovett and Ramamohan Paturi and Stefan Schneider}, title = {0-1 Integer Linear Programming with a Linear Number of Constraints}, journal = {CoRR}, volume = {abs/1401.5512}, year = {2014}, url = {http://arxiv.org/abs/1401.5512}, eprinttype = {arXiv}, eprint = {1401.5512}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ImpagliazzoLPS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Lovett14, author = {Shachar Lovett}, title = {Recent advances on the log-rank conjecture in communication complexity}, journal = {CoRR}, volume = {abs/1403.8106}, year = {2014}, url = {http://arxiv.org/abs/1403.8106}, eprinttype = {arXiv}, eprint = {1403.8106}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Lovett14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BhowmickL14, author = {Abhishek Bhowmick and Shachar Lovett}, title = {List decoding Reed-Muller codes over small fields}, journal = {CoRR}, volume = {abs/1407.3433}, year = {2014}, url = {http://arxiv.org/abs/1407.3433}, eprinttype = {arXiv}, eprint = {1407.3433}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BhowmickL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/0001L14a, author = {Abhishek Bhowmick and Shachar Lovett}, title = {Nonclassical polynomials as a barrier to polynomial lower bounds}, journal = {CoRR}, volume = {abs/1412.4719}, year = {2014}, url = {http://arxiv.org/abs/1412.4719}, eprinttype = {arXiv}, eprint = {1412.4719}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/0001L14a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/0001L14, author = {Abhishek Bhowmick and Shachar Lovett}, title = {Nonclassical polynomials as a barrier to polynomial lower bounds}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-175}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/175}, eprinttype = {ECCC}, eprint = {TR14-175}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/0001L14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BhowmickL14, author = {Abhishek Bhowmick and Shachar Lovett}, title = {List decoding Reed-Muller codes over small fields}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-087}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/087}, eprinttype = {ECCC}, eprint = {TR14-087}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BhowmickL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GoosLMWZ14, author = {Mika G{\"{o}}{\"{o}}s and Shachar Lovett and Raghu Meka and Thomas Watson and David Zuckerman}, title = {Rectangles Are Nonnegative Juntas}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-147}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/147}, eprinttype = {ECCC}, eprint = {TR14-147}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GoosLMWZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HatamiHL14, author = {Hamed Hatami and Pooya Hatami and Shachar Lovett}, title = {General systems of linear forms: equidistribution and true complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-040}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/040}, eprinttype = {ECCC}, eprint = {TR14-040}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HatamiHL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ImpagliazzoLPS14, author = {Russell Impagliazzo and Shachar Lovett and Ramamohan Paturi and Stefan Schneider}, title = {0-1 Integer Linear Programming with a Linear Number of Constraints}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-024}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/024}, eprinttype = {ECCC}, eprint = {TR14-024}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ImpagliazzoLPS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Lovett14, author = {Shachar Lovett}, title = {Recent advances on the log-rank conjecture in communication complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-041}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/041}, eprinttype = {ECCC}, eprint = {TR14-041}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Lovett14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Lovett14a, author = {Shachar Lovett}, title = {Linear codes cannot approximate the network capacity within any constant factor}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-141}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/141}, eprinttype = {ECCC}, eprint = {TR14-141}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Lovett14a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettMR14, author = {Shachar Lovett and Cristopher Moore and Alexander Russell}, title = {Group representations that resist random sampling}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-073}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/073}, eprinttype = {ECCC}, eprint = {TR14-073}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettMR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettZ14, author = {Shachar Lovett and Jiapeng Zhang}, title = {Improved noisy population recovery, and reverse Bonami-Beckner inequality for sparse functions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-123}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/123}, eprinttype = {ECCC}, eprint = {TR14-123}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/LovettMS13, author = {Shachar Lovett and Partha Mukhopadhyay and Amir Shpilka}, title = {Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields}, journal = {Comput. Complex.}, volume = {22}, number = {4}, pages = {679--725}, year = {2013}, url = {https://doi.org/10.1007/s00037-012-0051-7}, doi = {10.1007/S00037-012-0051-7}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/LovettMS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/LovettP13, author = {Shachar Lovett and Ely Porat}, title = {A Space Lower Bound for Dynamic Approximate Membership Data Structures}, journal = {{SIAM} J. Comput.}, volume = {42}, number = {6}, pages = {2182--2196}, year = {2013}, url = {https://doi.org/10.1137/120867044}, doi = {10.1137/120867044}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/LovettP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/AlonL13, author = {Noga Alon and Shachar Lovett}, title = {Almost k-Wise vs. k-Wise Independent Permutations, and Uniformity for General Group Actions}, journal = {Theory Comput.}, volume = {9}, pages = {559--577}, year = {2013}, url = {https://doi.org/10.4086/toc.2013.v009a015}, doi = {10.4086/TOC.2013.V009A015}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/AlonL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/HatamiL13, author = {Hamed Hatami and Shachar Lovett}, title = {Estimating the Distance from Testable Affine-Invariant Properties}, booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2013, 26-29 October, 2013, Berkeley, CA, {USA}}, pages = {237--242}, publisher = {{IEEE} Computer Society}, year = {2013}, url = {https://doi.org/10.1109/FOCS.2013.33}, doi = {10.1109/FOCS.2013.33}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/HatamiL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BhattacharyyaFL13, author = {Arnab Bhattacharyya and Eldar Fischer and Shachar Lovett}, editor = {Sanjeev Khanna}, title = {Testing Low Complexity Affine-Invariant Properties}, booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8, 2013}, pages = {1337--1355}, publisher = {{SIAM}}, year = {2013}, url = {https://doi.org/10.1137/1.9781611973105.97}, doi = {10.1137/1.9781611973105.97}, timestamp = {Tue, 02 Feb 2021 17:07:29 +0100}, biburl = {https://dblp.org/rec/conf/soda/BhattacharyyaFL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BhattacharyyaFHHL13, author = {Arnab Bhattacharyya and Eldar Fischer and Hamed Hatami and Pooya Hatami and Shachar Lovett}, editor = {Dan Boneh and Tim Roughgarden and Joan Feigenbaum}, title = {Every locally characterized affine-invariant property is testable}, booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013}, pages = {429--436}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2488608.2488662}, doi = {10.1145/2488608.2488662}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BhattacharyyaFHHL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BhowmickDL13, author = {Abhishek Bhowmick and Zeev Dvir and Shachar Lovett}, editor = {Dan Boneh and Tim Roughgarden and Joan Feigenbaum}, title = {New bounds for matching vector families}, booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013}, pages = {823--832}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2488608.2488713}, doi = {10.1145/2488608.2488713}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BhowmickDL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1302-4295, author = {Greg Kuperberg and Shachar Lovett and Ron Peled}, title = {Probabilistic existence of regular combinatorial structures}, journal = {CoRR}, volume = {abs/1302.4295}, year = {2013}, url = {http://arxiv.org/abs/1302.4295}, eprinttype = {arXiv}, eprint = {1302.4295}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1302-4295.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/HatamiL13, author = {Hamed Hatami and Shachar Lovett}, title = {Estimating the distance from testable affine-invariant properties}, journal = {CoRR}, volume = {abs/1306.0649}, year = {2013}, url = {http://arxiv.org/abs/1306.0649}, eprinttype = {arXiv}, eprint = {1306.0649}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/HatamiL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Lovett13, author = {Shachar Lovett}, title = {Communication is bounded by root of rank}, journal = {CoRR}, volume = {abs/1306.1877}, year = {2013}, url = {http://arxiv.org/abs/1306.1877}, eprinttype = {arXiv}, eprint = {1306.1877}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Lovett13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AggarwalDL13, author = {Divesh Aggarwal and Yevgeniy Dodis and Shachar Lovett}, title = {Non-malleable Codes from Additive Combinatorics}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-081}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/081}, eprinttype = {ECCC}, eprint = {TR13-081}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AggarwalDL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/FazeliLV13, author = {Arman Fazeli and Shachar Lovett and Alexander Vardy}, title = {Nontrivial t-designs over finite fields exist for all t}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-126}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/126}, eprinttype = {ECCC}, eprint = {TR13-126}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/FazeliLV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GavinskyL13, author = {Dmitry Gavinsky and Shachar Lovett}, title = {En Route to the log-rank Conjecture: New Reductions and Equivalent Formulations}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-080}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/080}, eprinttype = {ECCC}, eprint = {TR13-080}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GavinskyL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HatamiL13, author = {Hamed Hatami and Shachar Lovett}, title = {Estimating the distance from testable affine-invariant properties}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-087}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/087}, eprinttype = {ECCC}, eprint = {TR13-087}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HatamiL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Lovett13, author = {Shachar Lovett}, title = {Communication is bounded by root of rank}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-084}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/084}, eprinttype = {ECCC}, eprint = {TR13-084}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Lovett13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/AggarwalDL13, author = {Divesh Aggarwal and Yevgeniy Dodis and Shachar Lovett}, title = {Non-malleable Codes from Additive Combinatorics}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {201}, year = {2013}, url = {http://eprint.iacr.org/2013/201}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/AggarwalDL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Ben-EliezerHL12, author = {Ido Ben{-}Eliezer and Rani Hod and Shachar Lovett}, title = {Random low-degree polynomials are hard to approximate}, journal = {Comput. Complex.}, volume = {21}, number = {1}, pages = {63--81}, year = {2012}, url = {https://doi.org/10.1007/s00037-011-0020-6}, doi = {10.1007/S00037-011-0020-6}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/Ben-EliezerHL12.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/combinatorica/Lovett12, author = {Shachar Lovett}, title = {Equivalence of polynomial conjectures in additive combinatorics}, journal = {Comb.}, volume = {32}, number = {5}, pages = {607--618}, year = {2012}, url = {https://doi.org/10.1007/s00493-012-2714-z}, doi = {10.1007/S00493-012-2714-Z}, timestamp = {Sun, 22 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/Lovett12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/KaufmanLP12, author = {Tali Kaufman and Shachar Lovett and Ely Porat}, title = {Weight Distribution and List-Decoding Size of Reed-Muller Codes}, journal = {{IEEE} Trans. Inf. Theory}, volume = {58}, number = {5}, pages = {2689--2696}, year = {2012}, url = {https://doi.org/10.1109/TIT.2012.2184841}, doi = {10.1109/TIT.2012.2184841}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tit/KaufmanLP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/AlonL12, author = {Noga Alon and Shachar Lovett}, editor = {Anupam Gupta and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Rocco A. Servedio}, title = {Almost K-Wise vs. K-Wise Independent Permutations, and Uniformity for General Group Actions}, 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 = {350--361}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-32512-0\_30}, doi = {10.1007/978-3-642-32512-0\_30}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/AlonL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/GavinskyLS12, author = {Dmitry Gavinsky and Shachar Lovett and Srikanth Srinivasan}, title = {Pseudorandom Generators for Read-Once ACC{\^{}}0}, booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC} 2012, Porto, Portugal, June 26-29, 2012}, pages = {287--297}, publisher = {{IEEE} Computer Society}, year = {2012}, url = {https://doi.org/10.1109/CCC.2012.37}, doi = {10.1109/CCC.2012.37}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/GavinskyLS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/KarninLLSW12, author = {Zohar Shay Karnin and Edo Liberty and Shachar Lovett and Roy Schwartz and Omri Weinstein}, editor = {Shie Mannor and Nathan Srebro and Robert C. Williamson}, title = {Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem}, booktitle = {{COLT} 2012 - The 25th Annual Conference on Learning Theory, June 25-27, 2012, Edinburgh, Scotland}, series = {{JMLR} Proceedings}, volume = {23}, pages = {2.1--2.17}, publisher = {JMLR.org}, year = {2012}, url = {http://proceedings.mlr.press/v23/karnin12/karnin12.pdf}, timestamp = {Wed, 23 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/colt/KarninLLSW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/LovettM12, author = {Shachar Lovett and Raghu Meka}, title = {Constructive Discrepancy Minimization by Walking on the Edges}, booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2012, New Brunswick, NJ, USA, October 20-23, 2012}, pages = {61--67}, publisher = {{IEEE} Computer Society}, year = {2012}, url = {https://doi.org/10.1109/FOCS.2012.23}, doi = {10.1109/FOCS.2012.23}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/LovettM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/BeckIL12, author = {Chris Beck and Russell Impagliazzo and Shachar Lovett}, title = {Large Deviation Bounds for Decision Trees and Sampling Lower Bounds for AC0-Circuits}, booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2012, New Brunswick, NJ, USA, October 20-23, 2012}, pages = {101--110}, publisher = {{IEEE} Computer Society}, year = {2012}, url = {https://doi.org/10.1109/FOCS.2012.82}, doi = {10.1109/FOCS.2012.82}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/focs/BeckIL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Ben-SassonLR12, author = {Eli Ben{-}Sasson and Shachar Lovett and Noga Ron{-}Zewi}, title = {An Additive Combinatorics Approach Relating Rank to Communication Complexity}, booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2012, New Brunswick, NJ, USA, October 20-23, 2012}, pages = {177--186}, publisher = {{IEEE} Computer Society}, year = {2012}, url = {https://doi.org/10.1109/FOCS.2012.39}, doi = {10.1109/FOCS.2012.39}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Ben-SassonLR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DvirL12, author = {Zeev Dvir and Shachar Lovett}, editor = {Howard J. Karloff and Toniann Pitassi}, title = {Subspace evasive sets}, booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference, {STOC} 2012, New York, NY, USA, May 19 - 22, 2012}, pages = {351--358}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2213977.2214010}, doi = {10.1145/2213977.2214010}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DvirL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KuperbergLP12, author = {Greg Kuperberg and Shachar Lovett and Ron Peled}, editor = {Howard J. Karloff and Toniann Pitassi}, title = {Probabilistic existence of rigid combinatorial structures}, booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference, {STOC} 2012, New York, NY, USA, May 19 - 22, 2012}, pages = {1091--1106}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2213977.2214075}, doi = {10.1145/2213977.2214075}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KuperbergLP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1201-0330, author = {Arnab Bhattacharyya and Eldar Fischer and Shachar Lovett}, title = {Testing Low Complexity Affine-Invariant Properties}, journal = {CoRR}, volume = {abs/1201.0330}, year = {2012}, url = {http://arxiv.org/abs/1201.0330}, eprinttype = {arXiv}, eprint = {1201.0330}, timestamp = {Thu, 07 Feb 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1201-0330.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1203-4532, author = {Zeev Dvir and J{\'{a}}nos Koll{\'{a}}r and Shachar Lovett}, title = {Variety Evasive Sets}, journal = {CoRR}, volume = {abs/1203.4532}, year = {2012}, url = {http://arxiv.org/abs/1203.4532}, eprinttype = {arXiv}, eprint = {1203.4532}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1203-4532.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1203-5747, author = {Shachar Lovett and Raghu Meka}, title = {Constructive Discrepancy Minimization by Walking on The Edges}, journal = {CoRR}, volume = {abs/1203.5747}, year = {2012}, url = {http://arxiv.org/abs/1203.5747}, eprinttype = {arXiv}, eprint = {1203.5747}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1203-5747.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1204-1367, author = {Abhishek Bhowmick and Zeev Dvir and Shachar Lovett}, title = {New Lower Bounds for Matching Vector Codes}, journal = {CoRR}, volume = {abs/1204.1367}, year = {2012}, url = {http://arxiv.org/abs/1204.1367}, eprinttype = {arXiv}, eprint = {1204.1367}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1204-1367.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1205-1478, author = {Dmitry Gavinsky and Shachar Lovett and Michael E. Saks and Srikanth Srinivasan}, title = {A Tail Bound for Read-k Families of Functions}, journal = {CoRR}, volume = {abs/1205.1478}, year = {2012}, url = {http://arxiv.org/abs/1205.1478}, eprinttype = {arXiv}, eprint = {1205.1478}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1205-1478.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1212-3849, author = {Arnab Bhattacharyya and Eldar Fischer and Hamed Hatami and Pooya Hatami and Shachar Lovett}, title = {Every locally characterized affine-invariant property is testable}, journal = {CoRR}, volume = {abs/1212.3849}, year = {2012}, url = {http://arxiv.org/abs/1212.3849}, eprinttype = {arXiv}, eprint = {1212.3849}, timestamp = {Thu, 07 Feb 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1212-3849.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BeckIL12, author = {Chris Beck and Russell Impagliazzo and Shachar Lovett}, title = {Large Deviation Bounds for Decision Trees and Sampling Lower Bounds for AC0-circuits}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-042}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/042}, eprinttype = {ECCC}, eprint = {TR12-042}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BeckIL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BhattacharyyaFHHL12, author = {Arnab Bhattacharyya and Eldar Fischer and Hamed Hatami and Pooya Hatami and Shachar Lovett}, title = {Every locally characterized affine-invariant property is testable}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-184}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/184}, eprinttype = {ECCC}, eprint = {TR12-184}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BhattacharyyaFHHL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BhattacharyyaFL12, author = {Arnab Bhattacharyya and Eldar Fischer and Shachar Lovett}, title = {Testing Low Complexity Affine-Invariant Properties}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-001}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/001}, eprinttype = {ECCC}, eprint = {TR12-001}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BhattacharyyaFL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BhowmickDL12, author = {Abhishek Bhowmick and Zeev Dvir and Shachar Lovett}, title = {New Lower Bounds for Matching Vector Codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-034}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/034}, eprinttype = {ECCC}, eprint = {TR12-034}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BhowmickDL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Even-ZoharL12, author = {Chaim Even{-}Zohar and Shachar Lovett}, title = {The Freiman-Ruzsa Theorem in Finite Fields}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-180}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/180}, eprinttype = {ECCC}, eprint = {TR12-180}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Even-ZoharL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GavinskyLSS12, author = {Dmitry Gavinsky and Shachar Lovett and Michael E. Saks and Srikanth Srinivasan}, title = {A Tail Bound for Read-k Families of Functions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-051}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/051}, eprinttype = {ECCC}, eprint = {TR12-051}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GavinskyLSS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Lovett12, author = {Shachar Lovett}, title = {An exposition of Sanders quasi-polynomial Freiman-Ruzsa theorem}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-029}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/029}, eprinttype = {ECCC}, eprint = {TR12-029}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Lovett12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/LovettMS11, author = {Shachar Lovett and Roy Meshulam and Alex Samorodnitsky}, title = {Inverse Conjecture for the Gowers Norm is False}, journal = {Theory Comput.}, volume = {7}, number = {1}, pages = {131--145}, year = {2011}, url = {https://doi.org/10.4086/toc.2011.v007a009}, doi = {10.4086/TOC.2011.V007A009}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/LovettMS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/Lovett11, author = {Shachar Lovett}, title = {Computing Polynomials with Few Multiplications}, journal = {Theory Comput.}, volume = {7}, number = {1}, pages = {185--188}, year = {2011}, url = {https://doi.org/10.4086/toc.2011.v007a013}, doi = {10.4086/TOC.2011.V007A013}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/Lovett11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/LovettS11, author = {Shachar Lovett and Srikanth Srinivasan}, editor = {Leslie Ann Goldberg and Klaus Jansen and R. Ravi and Jos{\'{e}} D. P. Rolim}, title = {Correlation Bounds for Poly-size {\textdollar}{\textbackslash}mbox\{{\textbackslash}rm AC\}{\^{}}0{\textdollar} Circuits with n 1 - o(1) Symmetric Gates}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, {APPROX} 2011, and 15th International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6845}, pages = {640--651}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22935-0\_54}, doi = {10.1007/978-3-642-22935-0\_54}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/LovettS11.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/coco/ChattopadhyayL11, author = {Arkadev Chattopadhyay and Shachar Lovett}, title = {Linear Systems over Finite Abelian Groups}, booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011}, pages = {300--308}, publisher = {{IEEE} Computer Society}, year = {2011}, url = {https://doi.org/10.1109/CCC.2011.25}, doi = {10.1109/CCC.2011.25}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/ChattopadhyayL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/KaufmanL11, author = {Tali Kaufman and Shachar Lovett}, editor = {Rafail Ostrovsky}, title = {New Extension of the Weil Bound for Character Sums with Applications to Coding}, booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS} 2011, Palm Springs, CA, USA, October 22-25, 2011}, pages = {788--796}, publisher = {{IEEE} Computer Society}, year = {2011}, url = {https://doi.org/10.1109/FOCS.2011.41}, doi = {10.1109/FOCS.2011.41}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/KaufmanL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HatamiL11, author = {Hamed Hatami and Shachar Lovett}, editor = {Lance Fortnow and Salil P. Vadhan}, title = {Correlation testing for affine invariant properties on F\({}_{\mbox{p}}\)\({}^{\mbox{n}}\) in the high error regime}, booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC} 2011, San Jose, CA, USA, 6-8 June 2011}, pages = {187--194}, publisher = {{ACM}}, year = {2011}, url = {https://doi.org/10.1145/1993636.1993662}, doi = {10.1145/1993636.1993662}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/HatamiL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1104-3335, author = {Hamed Hatami and Shachar Lovett}, title = {Correlation Testing for Affine Invariant Properties on {\textdollar}{\textbackslash}mathbb\{F\}{\_}p{\^{}}n{\textdollar} in the High Error Regime}, journal = {CoRR}, volume = {abs/1104.3335}, year = {2011}, url = {http://arxiv.org/abs/1104.3335}, eprinttype = {arXiv}, eprint = {1104.3335}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1104-3335.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1107-1358, author = {Edo Liberty and Shachar Lovett and Omri Weinstein}, title = {On the Furthest Hyperplane Problem and Maximal Margin Clustering}, journal = {CoRR}, volume = {abs/1107.1358}, year = {2011}, url = {http://arxiv.org/abs/1107.1358}, eprinttype = {arXiv}, eprint = {1107.1358}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1107-1358.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1110-5696, author = {Zeev Dvir and Shachar Lovett}, title = {Subspace Evasive Sets}, journal = {CoRR}, volume = {abs/1110.5696}, year = {2011}, url = {http://arxiv.org/abs/1110.5696}, eprinttype = {arXiv}, eprint = {1110.5696}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1110-5696.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1111-0492, author = {Greg Kuperberg and Shachar Lovett and Ron Peled}, title = {Probabilistic existence of rigid combinatorial structures}, journal = {CoRR}, volume = {abs/1111.0492}, year = {2011}, url = {http://arxiv.org/abs/1111.0492}, eprinttype = {arXiv}, eprint = {1111.0492}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1111-0492.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1111-5884, author = {Eli Ben{-}Sasson and Shachar Lovett and Noga Zewi}, title = {An additive combinatorics approach to the log-rank conjecture in communication complexity}, journal = {CoRR}, volume = {abs/1111.5884}, year = {2011}, url = {http://arxiv.org/abs/1111.5884}, eprinttype = {arXiv}, eprint = {1111.5884}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1111-5884.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AlonL11, author = {Noga Alon and Shachar Lovett}, title = {Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-049}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/049}, eprinttype = {ECCC}, eprint = {TR11-049}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AlonL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonLZ11, author = {Eli Ben{-}Sasson and Shachar Lovett and Noga Zewi}, title = {An additive combinatorics approach to the log-rank conjecture in communication complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-157}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/157}, eprinttype = {ECCC}, eprint = {TR11-157}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonLZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChattopadhyayL11, author = {Arkadev Chattopadhyay and Shachar Lovett}, title = {Linear systems over abelian groups}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-048}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/048}, eprinttype = {ECCC}, eprint = {TR11-048}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DvirL11, author = {Zeev Dvir and Shachar Lovett}, title = {Subspace Evasive Sets}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-139}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/139}, eprinttype = {ECCC}, eprint = {TR11-139}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DvirL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HatamiL11, author = {Hamed Hatami and Shachar Lovett}, title = {Correlation testing for affine invariant properties on F\({}_{\mbox{p}}\)\({}^{\mbox{n}}\) in the high error regime}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-029}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/029}, eprinttype = {ECCC}, eprint = {TR11-029}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HatamiL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KuperbergLP11, author = {Greg Kuperberg and Shachar Lovett and Ron Peled}, title = {Probabilistic existence of rigid combinatorial structures}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-144}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/144}, eprinttype = {ECCC}, eprint = {TR11-144}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KuperbergLP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Lovett11, author = {Shachar Lovett}, title = {Computing polynomials with few multiplications}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-094}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/094}, eprinttype = {ECCC}, eprint = {TR11-094}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Lovett11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/GopalanSL10, author = {Parikshit Gopalan and Amir Shpilka and Shachar Lovett}, title = {The Complexity of Boolean Functions in Different Characteristics}, journal = {Comput. Complex.}, volume = {19}, number = {2}, pages = {235--263}, year = {2010}, url = {https://doi.org/10.1007/s00037-010-0290-4}, doi = {10.1007/S00037-010-0290-4}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/GopalanSL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/Lovett10, author = {Shachar Lovett}, title = {Holes in generalized Reed-Muller codes}, journal = {{IEEE} Trans. Inf. Theory}, volume = {56}, number = {6}, pages = {2583--2586}, year = {2010}, url = {https://doi.org/10.1109/TIT.2010.2046206}, doi = {10.1109/TIT.2010.2046206}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tit/Lovett10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/LovettMS10, author = {Shachar Lovett and Partha Mukhopadhyay and Amir Shpilka}, title = {Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields}, booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2010, October 23-26, 2010, Las Vegas, Nevada, {USA}}, pages = {695--704}, publisher = {{IEEE} Computer Society}, year = {2010}, url = {https://doi.org/10.1109/FOCS.2010.72}, doi = {10.1109/FOCS.2010.72}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/focs/LovettMS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/LovettP10, author = {Shachar Lovett and Ely Porat}, title = {A Lower Bound for Dynamic Approximate Membership Data Structures}, booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2010, October 23-26, 2010, Las Vegas, Nevada, {USA}}, pages = {797--804}, publisher = {{IEEE} Computer Society}, year = {2010}, url = {https://doi.org/10.1109/FOCS.2010.81}, doi = {10.1109/FOCS.2010.81}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/LovettP10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/KaufmanLP10, author = {Tali Kaufman and Shachar Lovett and Ely Porat}, editor = {Andrew Chi{-}Chih Yao}, title = {Weight Distribution and List-Decoding Size of Reed-Muller Codes}, booktitle = {Innovations in Computer Science - {ICS} 2010, Tsinghua University, Beijing, China, January 5-7, 2010. Proceedings}, pages = {422--433}, publisher = {Tsinghua University Press}, year = {2010}, url = {http://conference.iiis.tsinghua.edu.cn/ICS2010/content/papers/33.html}, timestamp = {Wed, 04 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/KaufmanLP10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HatamiL10, author = {Hamed Hatami and Shachar Lovett}, title = {Higher-order Fourier analysis of F\({}_{\mbox{p}}\)\({}^{\mbox{n}}\) and the complexity of systems of linear forms}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-181}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/181}, eprinttype = {ECCC}, eprint = {TR10-181}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HatamiL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KaufmanL10, author = {Tali Kaufman and Shachar Lovett}, title = {Testing of exponentially large codes, by a new extension to Weil bound for character sums}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-065}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/065}, eprinttype = {ECCC}, eprint = {TR10-065}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KaufmanL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Lovett10, author = {Shachar Lovett}, title = {Equivalence of polynomial conjectures in additive combinatorics}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-010}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/010}, eprinttype = {ECCC}, eprint = {TR10-010}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Lovett10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Lovett10a, author = {Shachar Lovett}, title = {An elementary proof of anti-concentration of polynomials in Gaussian variables}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-182}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/182}, eprinttype = {ECCC}, eprint = {TR10-182}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Lovett10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettMS10, author = {Shachar Lovett and Partha Mukhopadhyay and Amir Shpilka}, title = {Pseudorandom generators for CC\({}_{\mbox{0}}\)[p] and the Fourier spectrum of low-degree polynomials over finite fields}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-033}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/033}, eprinttype = {ECCC}, eprint = {TR10-033}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettMS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettP10, author = {Shachar Lovett and Ely Porat}, title = {A lower bound for dynamic approximate membership data structures}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-087}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/087}, eprinttype = {ECCC}, eprint = {TR10-087}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettP10.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/toc/Lovett09, author = {Shachar Lovett}, title = {Unconditional Pseudorandom Generators for Low Degree Polynomials}, journal = {Theory Comput.}, volume = {5}, number = {1}, pages = {69--82}, year = {2009}, url = {https://doi.org/10.4086/toc.2009.v005a003}, doi = {10.4086/TOC.2009.V005A003}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/Lovett09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Ben-EliezerHL09, author = {Ido Ben{-}Eliezer and Rani Hod and Shachar Lovett}, editor = {Irit Dinur and Klaus Jansen and Joseph Naor and Jos{\'{e}} D. P. Rolim}, title = {Random Low Degree Polynomials are Hard to Approximate}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, {APPROX} 2009, and 13th International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5687}, pages = {366--377}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-03685-9\_28}, doi = {10.1007/978-3-642-03685-9\_28}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/Ben-EliezerHL09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/LovettRTV09, author = {Shachar Lovett and Omer Reingold and Luca Trevisan and Salil P. Vadhan}, editor = {Irit Dinur and Klaus Jansen and Joseph Naor and Jos{\'{e}} D. P. Rolim}, title = {Pseudorandom Bit Generators That Fool Modular Sums}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, {APPROX} 2009, and 13th International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5687}, pages = {615--630}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-03685-9\_46}, doi = {10.1007/978-3-642-03685-9\_46}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/LovettRTV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/GopalanLS09, author = {Parikshit Gopalan and Shachar Lovett and Amir Shpilka}, title = {On the Complexity of Boolean Functions in Different Characteristics}, booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational Complexity, {CCC} 2009, Paris, France, 15-18 July 2009}, pages = {173--183}, publisher = {{IEEE} Computer Society}, year = {2009}, url = {https://doi.org/10.1109/CCC.2009.14}, doi = {10.1109/CCC.2009.14}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/GopalanLS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DodisKL09, author = {Yevgeniy Dodis and Yael Tauman Kalai and Shachar Lovett}, editor = {Michael Mitzenmacher}, title = {On cryptography with auxiliary input}, booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing, {STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009}, pages = {621--630}, publisher = {{ACM}}, year = {2009}, url = {https://doi.org/10.1145/1536414.1536498}, doi = {10.1145/1536414.1536498}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DodisKL09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0904-0811, author = {Shachar Lovett}, title = {The density of weights of Generalized Reed--Muller codes}, journal = {CoRR}, volume = {abs/0904.0811}, year = {2009}, url = {http://arxiv.org/abs/0904.0811}, eprinttype = {arXiv}, eprint = {0904.0811}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0904-0811.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0911-3473, author = {Ido Ben{-}Eliezer and Shachar Lovett and Ariel Yadin}, title = {Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness}, journal = {CoRR}, volume = {abs/0911.3473}, year = {2009}, url = {http://arxiv.org/abs/0911.3473}, eprinttype = {arXiv}, eprint = {0911.3473}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0911-3473.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GopalanLS09, author = {Parikshit Gopalan and Shachar Lovett and Amir Shpilka}, title = {On the Complexity of Boolean Functions in Different Characteristics}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR09-048}}, year = {2009}, url = {https://eccc.weizmann.ac.il/report/2009/048}, eprinttype = {ECCC}, eprint = {TR09-048}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GopalanLS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Lovett09, author = {Shachar Lovett}, title = {The density of weights of Generalized Reed-Muller codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR09-030}}, year = {2009}, url = {https://eccc.weizmann.ac.il/report/2009/030}, eprinttype = {ECCC}, eprint = {TR09-030}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Lovett09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettBY09, author = {Shachar Lovett and Ido Ben{-}Eliezer and Ariel Yadin}, title = {Title: Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR09-118}}, year = {2009}, url = {https://eccc.weizmann.ac.il/report/2009/118}, eprinttype = {ECCC}, eprint = {TR09-118}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettBY09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettT09, author = {Shachar Lovett and Yoav Tzur}, title = {Explicit lower bound for fooling polynomials by the sum of small-bias generators}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR09-088}}, year = {2009}, url = {https://eccc.weizmann.ac.il/report/2009/088}, eprinttype = {ECCC}, eprint = {TR09-088}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/KaufmanL08, author = {Tali Kaufman and Shachar Lovett}, title = {Worst Case to Average Case Reductions for Polynomials}, booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2008, October 25-28, 2008, Philadelphia, PA, {USA}}, pages = {166--175}, publisher = {{IEEE} Computer Society}, year = {2008}, url = {https://doi.org/10.1109/FOCS.2008.17}, doi = {10.1109/FOCS.2008.17}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/KaufmanL08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Lovett08, author = {Shachar Lovett}, editor = {Susanne Albers and Pascal Weil}, title = {Lower bounds for adaptive linearity tests}, booktitle = {{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings}, series = {LIPIcs}, volume = {1}, pages = {515--526}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2008}, url = {https://doi.org/10.4230/LIPIcs.STACS.2008.1313}, doi = {10.4230/LIPICS.STACS.2008.1313}, timestamp = {Tue, 22 Jun 2021 15:44:08 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Lovett08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LovettMS08, author = {Shachar Lovett and Roy Meshulam and Alex Samorodnitsky}, editor = {Cynthia Dwork}, title = {Inverse conjecture for the gowers norm is false}, booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008}, pages = {547--556}, publisher = {{ACM}}, year = {2008}, url = {https://doi.org/10.1145/1374376.1374454}, doi = {10.1145/1374376.1374454}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/LovettMS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Lovett08, author = {Shachar Lovett}, editor = {Cynthia Dwork}, title = {Unconditional pseudorandom generators for low degree polynomials}, booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008}, pages = {557--562}, publisher = {{ACM}}, year = {2008}, url = {https://doi.org/10.1145/1374376.1374455}, doi = {10.1145/1374376.1374455}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Lovett08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0802-2857, author = {Shachar Lovett}, title = {Lower bounds for adaptive linearity tests}, journal = {CoRR}, volume = {abs/0802.2857}, year = {2008}, url = {http://arxiv.org/abs/0802.2857}, eprinttype = {arXiv}, eprint = {0802.2857}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0802-2857.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0811-2356, author = {Tali Kaufman and Shachar Lovett}, title = {The List-Decoding Size of Reed-Muller Codes}, journal = {CoRR}, volume = {abs/0811.2356}, year = {2008}, url = {http://arxiv.org/abs/0811.2356}, eprinttype = {arXiv}, eprint = {0811.2356}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0811-2356.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-EliezerHL08, author = {Ido Ben{-}Eliezer and Rani Hod and Shachar Lovett}, title = {Random low degree polynomials are hard to approximate}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR08-080}}, year = {2008}, url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-080/index.html}, eprinttype = {ECCC}, eprint = {TR08-080}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-EliezerHL08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettK08, author = {Shachar Lovett and Tali Kaufman}, title = {Worst case to Average case reductions for polynomials}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR08-072}}, year = {2008}, url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-072/index.html}, eprinttype = {ECCC}, eprint = {TR08-072}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettK08a, author = {Shachar Lovett and Tali Kaufman}, title = {The List-Decoding Size of Reed-Muller Codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR08-111}}, year = {2008}, url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-111/index.html}, eprinttype = {ECCC}, eprint = {TR08-111}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettK08a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-math-0701102, author = {Shachar Lovett and Sasha Sodin}, title = {Almost Euclidean sections of the N-dimensional cross-polytope using {O(N)} random bits}, journal = {CoRR}, volume = {abs/math/0701102}, year = {2007}, url = {http://arxiv.org/abs/math/0701102}, eprinttype = {arXiv}, eprint = {math/0701102}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-math-0701102.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Lovett07, author = {Shachar Lovett}, title = {Unconditional pseudorandom generators for low degree polynomials}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR07-075}}, year = {2007}, url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-075/index.html}, eprinttype = {ECCC}, eprint = {TR07-075}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Lovett07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Lovett07a, author = {Shachar Lovett}, title = {Tight lower bounds for adaptive linearity tests}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR07-090}}, year = {2007}, url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-090/index.html}, eprinttype = {ECCC}, eprint = {TR07-090}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Lovett07a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettMS07, author = {Shachar Lovett and Roy Meshulam and Alex Samorodnitsky}, title = {Inverse Conjecture for the Gowers norm is false}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR07-123}}, year = {2007}, url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-123/index.html}, eprinttype = {ECCC}, eprint = {TR07-123}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettMS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettS07, author = {Shachar Lovett and Sasha Sodin}, title = {Almost Euclidean sections of the N-dimensional cross-polytope using {O(N)} random bits}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR07-012}}, year = {2007}, url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-012/index.html}, eprinttype = {ECCC}, eprint = {TR07-012}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettS07.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.