Shachar Lovett

295 papers A* 56A 22B 2Journal 204Unranked 11

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Improved Parallel Repetition for GHZ-Supported Games via Spreadness. CoRR Yang P. Liu, Shachar Lovett, Kunal Mittal
2026	J	`jnl`	Improved Parallel Repetition for GHZ-Supported Games via Spreadness. Electron. Colloquium Comput. Complex. Yang P. Liu, Shachar Lovett, Kunal Mittal
2026	J	`jnl`	Quantum-Classical Equivalence for AND-Functions. Electron. Colloquium Comput. Complex. Sreejata Kishor Bhattacharya, Farzan Byramji, Arkadev Chattopadhyay, Yogesh Dahiya, Shachar Lovett
2025	B	`conf`	Do PAC-Learners Learn the Marginal Distribution? ALT Max Hopkins, Daniel M. Kane, Shachar Lovett, Gaurav Mahajan
2025	J	`jnl`	Exact versus Approximate Representations of Boolean Functions in the De Morgan Basis. CoRR Arkadev Chattopadhyay, Yogesh Dahiya, Shachar Lovett
2025	J	`jnl`	Exact versus Approximate Representations of Boolean Functions in the De Morgan Basis. Electron. Colloquium Comput. Complex. Arkadev Chattopadhyay, Yogesh Dahiya, Shachar Lovett
2025	A	`conf`	List Decoding Quotient Reed-Muller Codes. CCC Omri Gotlib, Tali Kaufman, Shachar Lovett
2025	J	`jnl`	List Decoding Quotient Reed-Muller Codes. CoRR Omri Gotlib, Tali Kaufman, Shachar Lovett
2025	A*	`conf`	Quasipolynomial Bounds for the Corners Theorem. FOCS Michael Jaber, Yang P. Liu, Shachar Lovett, Anthony Ostuni, Mehtaab Sawhney
2025	J	`jnl`	Quasipolynomial bounds for the corners theorem. CoRR Michael Jaber, Yang P. Liu, Shachar Lovett, Anthony Ostuni, Mehtaab Sawhney
2025	J	`jnl`	Quasipolynomial bounds for the corners theorem. Electron. Colloquium Comput. Complex. Michael Jaber, Yang P. Liu, Shachar Lovett, Anthony Ostuni, Mehtaab Sawhney
2025	J	`jnl`	Restriction Trees for Sparsity and Applications. Electron. Colloquium Comput. Complex. Arkadev Chattopadhyay, Yogesh Dahiya, Shachar Lovett
2025	J	`jnl`	The Log-Rank Conjecture: New Equivalent Formulations. CoRR Lianna Hambardzumyan, Shachar Lovett, Morgan Shirley
2025	J	`jnl`	The Log-Rank Conjecture: New Equivalent Formulations. Electron. Colloquium Comput. Complex. Lianna Hambardzumyan, Shachar Lovett, Morgan Shirley
2024	J	`jnl`	Corners in Quasirandom Groups via Sparse Mixing. Electron. Colloquium Comput. Complex. Michael Jaber, Shachar Lovett, Anthony Ostuni
2024	A*	`conf`	Explicit Separations between Randomized and Deterministic Number-on-Forehead Communication. STOC Zander Kelley, Shachar Lovett, Raghu Meka
2024	A*	`conf`	New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms. STOC Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, Raghu Meka
2024	J	`jnl`	Realizable Learning is All You Need. TheoretiCS Max Hopkins, Daniel M. Kane, Shachar Lovett, Gaurav Mahajan
2024	A*	`conf`	Refuting Approaches to the Log-Rank Conjecture for XOR Functions. ICALP Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni
2023	J	`jnl`	Bias vs Structure of Polynomials in Large Fields, and Applications in Information Theory. IEEE Trans. Inf. Theory Abhishek Bhowmick, Shachar Lovett
2023	J	`jnl`	Do PAC-Learners Learn the Marginal Distribution? CoRR Max Hopkins, Daniel M. Kane, Shachar Lovett, Gaurav Mahajan
2023	J	`jnl`	Explicit separations between randomized and deterministic Number-on-Forehead communication. CoRR Zander Kelley, Shachar Lovett, Raghu Meka
2023	J	`jnl`	Explicit separations between randomized and deterministic Number-on-Forehead communication. Electron. Colloquium Comput. Complex. Zander Kelley, Shachar Lovett, Raghu Meka
2023	A*	`conf`	Exponential Hardness of Reinforcement Learning with Linear Function Approximation. COLT Sihan Liu, Gaurav Mahajan, Daniel Kane, Shachar Lovett, Gellért Weisz, Csaba Szepesvári
2023	J	`jnl`	Exponential Hardness of Reinforcement Learning with Linear Function Approximation. CoRR Daniel Kane, Sihan Liu, Shachar Lovett, Gaurav Mahajan, Csaba Szepesvári, Gellért Weisz
2023	A	`conf`	Fractional Certificates for Bounded Functions. ITCS Shachar Lovett, Jiapeng Zhang
2023	J	`jnl`	New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms. CoRR Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, Raghu Meka
2023	J	`jnl`	New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms. Electron. Colloquium Comput. Complex. Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, Raghu Meka
2023	J	`jnl`	Refuting approaches to the log-rank conjecture for XOR functions. CoRR Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni
2023	J	`jnl`	Refuting approaches to the log-rank conjecture for XOR functions. Electron. Colloquium Comput. Complex. Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni
2023	A*	`conf`	Sampling Equilibria: Fast No-Regret Learning in Structured Games. SODA Daniel Beaglehole, Max Hopkins, Daniel Kane, Sihan Liu, Shachar Lovett
2023	A*	`conf`	Streaming Lower Bounds and Asymmetric Set-Disjointness. FOCS Shachar Lovett, Jiapeng Zhang
2023	J	`jnl`	Streaming Lower Bounds and Asymmetric Set-Disjointness. CoRR Shachar Lovett, Jiapeng Zhang
2023	J	`jnl`	Streaming Lower Bounds and Asymmetric Set-Disjointness. Electron. Colloquium Comput. Complex. Shachar Lovett, Jiapeng Zhang
2022	A	`ed.`	37th Computational Complexity Conference, CCC 2022, Philadelphia, PA, USA, July 20-23, 2022 CCC Shachar Lovett
2022	A*	`conf`	Computational-Statistical Gap in Reinforcement Learning. COLT Daniel Kane, Sihan Liu, Shachar Lovett, Gaurav Mahajan
2022	J	`jnl`	Computational-Statistical Gaps in Reinforcement Learning. CoRR Daniel Kane, Sihan Liu, Shachar Lovett, Gaurav Mahajan
2022	A	`conf`	Eigenstripping, Spectral Decay, and Edge-Expansion on Posets. APPROX/RANDOM Jason Gaitonde, Max Hopkins, Tali Kaufman, Shachar Lovett, Ruizhe Zhang
2022	J	`jnl`	Eigenstripping, Spectral Decay, and Edge-Expansion on Posets. CoRR Jason Gaitonde, Max Hopkins, Tali Kaufman, Shachar Lovett, Ruizhe Zhang
2022	J	`jnl`	Fractional certificates for bounded functions. Electron. Colloquium Comput. Complex. Shachar Lovett, Jiapeng Zhang
2022	A*	`conf`	High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games. SODA Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett
2022	A*	`conf`	Hypercontractivity on high dimensional expanders. STOC Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett
2022	A	`conf`	Lifting with Sunflowers. ITCS Shachar Lovett, Raghu Meka, Ian Mertz, Toniann Pitassi, Jiapeng Zhang
2022	A*	`conf`	Realizable Learning is All You Need. COLT Max Hopkins, Daniel M. Kane, Shachar Lovett, Gaurav Mahajan
2022	J	`jnl`	Sign-Rank vs. Discrepancy. Theory Comput. Kaave Hosseini, Hamed Hatami, Shachar Lovett
2022	J	`jnl`	Sunflowers and Robust Sunflowers from Randomness Extractors. Theory Comput. Xin Li, Shachar Lovett, Jiapeng Zhang
2021	A*	`conf`	Bilinear Classes: A Structural Framework for Provable Generalization in RL. ICML Simon S. Du, Sham M. Kakade, Jason D. Lee, Shachar Lovett, Gaurav Mahajan, Wen Sun, Ruosong Wang
2021	J	`jnl`	Bilinear Classes: A Structural Framework for Provable Generalization in RL. CoRR Simon S. Du, Sham M. Kakade, Jason D. Lee, Shachar Lovett, Gaurav Mahajan, Wen Sun, Ruosong Wang
2021	A*	`conf`	Bounded Memory Active Learning through Enriched Queries. COLT Max Hopkins, Daniel Kane, Shachar Lovett, Michal Moshkovitz
2021	J	`jnl`	Bounded Memory Active Learning through Enriched Queries. CoRR Max Hopkins, Daniel Kane, Shachar Lovett, Michal Moshkovitz
2021	J	`jnl`	Decision List Compression by Mild Random Restrictions. J. ACM Shachar Lovett, Kewen Wu, Jiapeng Zhang
2021	A	`conf`	Fractional Pseudorandom Generators from Any Fourier Level. CCC Eshan Chattopadhyay, Jason Gaitonde, Chin Ho Lee, Shachar Lovett, Abhishek Shetty
2021	J	`jnl`	Guest Column: Models of computation between decision trees and communication. SIGACT News Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan
2021	J	`jnl`	Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments. CoRR Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett
2021	J	`jnl`	Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments. Electron. Colloquium Comput. Complex. Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett
2021	A*	`conf`	Log-rank and lifting for AND-functions. STOC Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan
2021	J	`jnl`	Realizable Learning is All You Need. CoRR Max Hopkins, Daniel M. Kane, Shachar Lovett, Gaurav Mahajan
2021	—	`conf`	Singularity of Random Integer Matrices with Large Entries. APPROX-RANDOM Sankeerth Rao Karingula, Shachar Lovett
2021	J	`jnl`	Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture. SIAM J. Comput. Shachar Lovett
2020	J	`jnl`	Codes over integers, and the singularity of random matrices with large entries. CoRR Sankeerth Rao Karingula, Shachar Lovett
2020	J	`jnl`	Codes over integers, and the singularity of random matrices with large entries. Electron. Colloquium Comput. Complex. Sankeerth Rao Karingula, Shachar Lovett
2020	A*	`conf`	Decision list compression by mild random restrictions. STOC Shachar Lovett, Kewen Wu, Jiapeng Zhang
2020	J	`jnl`	Fractional Pseudorandom Generators from Any Fourier Level. CoRR Eshan Chattopadhyay, Jason Gaitonde, Chin Ho Lee, Shachar Lovett, Abhishek Shetty
2020	J	`jnl`	High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games. CoRR Max Hopkins, Tali Kaufman, Shachar Lovett
2020	J	`jnl`	High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games. Electron. Colloquium Comput. Complex. Max Hopkins, Tali Kaufman, Shachar Lovett
2020	A*	`conf`	Improved bounds for the sunflower lemma. STOC Ryan Alweiss, Shachar Lovett, Kewen Wu, Jiapeng Zhang
2020	J	`jnl`	Improved lifting theorems via robust sunflowers. Electron. Colloquium Comput. Complex. Shachar Lovett, Raghu Meka, Jiapeng Zhang
2020	J	`jnl`	Log-rank and lifting for AND-functions. CoRR Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan
2020	J	`jnl`	Log-rank and lifting for AND-functions. Electron. Colloquium Comput. Complex. Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan
2020	A*	`conf`	Noise-tolerant, Reliable Active Classification with Comparison Queries. COLT Max Hopkins, Daniel Kane, Shachar Lovett, Gaurav Mahajan
2020	J	`jnl`	Noise-tolerant, Reliable Active Classification with Comparison Queries. CoRR Max Hopkins, Daniel Kane, Shachar Lovett, Gaurav Mahajan
2020	A*	`conf`	Point Location and Active Learning: Learning Halfspaces Almost Optimally. FOCS Max Hopkins, Daniel Kane, Shachar Lovett, Gaurav Mahajan
2020	J	`jnl`	Point Location and Active Learning: Learning Halfspaces Almost Optimally. CoRR Max Hopkins, Daniel M. Kane, Shachar Lovett, Gaurav Mahajan
2020	J	`jnl`	Probabilistic existence of large sets of designs. J. Comb. Theory A Shachar Lovett, Sankeerth Rao, Alexander Vardy
2020	A	`conf`	Sign Rank vs Discrepancy. CCC Hamed Hatami, Kaave Hosseini, Shachar Lovett
2020	A*	`conf`	The Power of Comparisons for Actively Learning Linear Classifiers. NeurIPS Max Hopkins, Daniel Kane, Shachar Lovett
2020	A*	`conf`	Towards a Combinatorial Characterization of Bounded-Memory Learning. NeurIPS Alon Gonen, Shachar Lovett, Michal Moshkovitz
2020	J	`jnl`	Towards a combinatorial characterization of bounded memory learning. CoRR Alon Gonen, Shachar Lovett, Michal Moshkovitz
2020	A*	`conf`	XOR lemmas for resilient functions against polynomials. STOC Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman
2019	A*	`conf`	DNF sparsification beyond sunflowers. STOC Shachar Lovett, Jiapeng Zhang
2019	J	`jnl`	Decision list compression by mild random restrictions. CoRR Shachar Lovett, Kewen Wu, Jiapeng Zhang
2019	J	`jnl`	Decision list compression by mild random restrictions. Electron. Colloquium Comput. Complex. Shachar Lovett, Kewen Wu, Jiapeng Zhang
2019	A	`conf`	Equality Alone Does not Simulate Randomness. CCC Arkadev Chattopadhyay, Shachar Lovett, Marc Vinyals
2019	A	`conf`	From DNF Compression to Sunflower Theorems via Regularity. CCC Shachar Lovett, Noam Solomon, Jiapeng Zhang
2019	J	`jnl`	From DNF compression to sunflower theorems via regularity. CoRR Shachar Lovett, Noam Solomon, Jiapeng Zhang
2019	J	`jnl`	From DNF compression to sunflower theorems via regularity. Electron. Colloquium Comput. Complex. Shachar Lovett, Noam Solomon, Jiapeng Zhang
2019	J	`jnl`	Higher-order Fourier Analysis and Applications. Found. Trends Theor. Comput. Sci. Hamed Hatami, Pooya Hatami, Shachar Lovett
2019	J	`jnl`	Improved bounds for the sunflower lemma. CoRR Ryan Alweiss, Shachar Lovett, Kewen Wu, Jiapeng Zhang
2019	J	`jnl`	Improved bounds for the sunflower lemma. Electron. Colloquium Comput. Complex. Ryan Alweiss, Shachar Lovett, Kewen Wu, Jiapeng Zhang
2019	J	`jnl`	Near-optimal Linear Decision Trees for k-SUM and Related Problems. J. ACM Daniel M. Kane, Shachar Lovett, Shay Moran
2019	J	`jnl`	On the Beck-Fiala conjecture for random set systems. Random Struct. Algorithms Esther Ezra, Shachar Lovett
2019	A	`conf`	Optimality of Linear Sketching Under Modular Updates. CCC Kaave Hosseini, Shachar Lovett, Grigory Yaroslavtsev
2019	J	`jnl`	Pseudorandom Generators from Polarizing Random Walks. Theory Comput. Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett
2019	A	`conf`	Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates. ITCS Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, Avishay Tal
2019	J	`jnl`	Sign rank vs Discrepancy. Electron. Colloquium Comput. Complex. Hamed Hatami, Kaave Hosseini, Shachar Lovett
2019	J	`jnl`	The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues. Theory Comput. Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett
2019	J	`jnl`	The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes. SIAM J. Comput. Daniel Kane, Shachar Lovett, Sankeerth Rao
2019	J	`jnl`	The Power of Comparisons for Actively Learning Linear Classifiers. CoRR Max Hopkins, Daniel M. Kane, Shachar Lovett
2019	A	`conf`	Torus Polynomials: An Algebraic Approach to ACC Lower Bounds. ITCS Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao
2019	J	`jnl`	Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem. Theory Comput. Daniel Dadush, Shashwat Garg, Shachar Lovett, Aleksandar Nikolov
2019	J	`jnl`	XOR Lemmas for Resilient Functions Against Polynomials. Electron. Colloquium Comput. Complex. Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman
2018	J	`jnl`	A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds. Electron. Colloquium Comput. Complex. Kaave Hosseini, Shachar Lovett
2018	J	`jnl`	A proof of the GM-MDS conjecture. Electron. Colloquium Comput. Complex. Shachar Lovett
2018	J	`jnl`	Algebraic Attacks against Random Local Functions and Their Countermeasures. SIAM J. Comput. Benny Applebaum, Shachar Lovett
2018	J	`jnl`	DNF sparsification beyond sunflowers. Electron. Colloquium Comput. Complex. Shachar Lovett, Jiapeng Zhang
2018	J	`jnl`	Equality Alone Does Not Simulate Randomness. Electron. Colloquium Comput. Complex. Arkadev Chattopadhyay, Shachar Lovett, Marc Vinyals
2018	A*	`conf`	Generalized Comparison Trees for Point-Location Problems. ICALP Daniel M. Kane, Shachar Lovett, Shay Moran
2018	J	`jnl`	Generalized comparison trees for point-location problems. CoRR Daniel M. Kane, Shachar Lovett, Shay Moran
2018	J	`jnl`	Generalized comparison trees for point-location problems. Electron. Colloquium Comput. Complex. Daniel M. Kane, Shachar Lovett, Shay Moran
2018	A	`conf`	Hardness Amplification for Non-Commutative Arithmetic Circuits. CCC Marco L. Carmosino, Russell Impagliazzo, Shachar Lovett, Ivan Mihajlin
2018	J	`jnl`	Hardness Amplification for Non-Commutative Arithmetic Circuits. Electron. Colloquium Comput. Complex. Marco Carmosino, Russell Impagliazzo, Shachar Lovett, Ivan Mihajlin
2018	A*	`conf`	MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture. FOCS Shachar Lovett
2018	J	`jnl`	MDS matrices over small fields: A proof of the GM-MDS conjecture. CoRR Shachar Lovett
2018	A*	`conf`	Near-optimal linear decision trees for k-SUM and related problems. STOC Daniel M. Kane, Shachar Lovett, Shay Moran
2018	J	`jnl`	Non-Malleable Codes from Additive Combinatorics. SIAM J. Comput. Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett
2018	J	`jnl`	Optimality of Linear Sketching under Modular Updates. CoRR Kaave Hosseini, Shachar Lovett, Grigory Yaroslavtsev
2018	J	`jnl`	Optimality of Linear Sketching under Modular Updates. Electron. Colloquium Comput. Complex. Kaave Hosseini, Shachar Lovett, Grigory Yaroslavtsev
2018	A*	`conf`	Probabilistic Existence of Large Sets of Designs. SODA Shachar Lovett, Sankeerth Rao, Alexander Vardy
2018	A	`conf`	Pseudorandom Generators from Polarizing Random Walks. CCC Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett
2018	J	`jnl`	Pseudorandom Generators from Polarizing Random Walks. Electron. Colloquium Comput. Complex. Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett
2018	J	`jnl`	Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates. Electron. Colloquium Comput. Complex. Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, Avishay Tal
2018	J	`jnl`	Special Issue: CCC 2017: Guest Editor's Foreword. Theory Comput. Shachar Lovett, Ryan O'Donnell
2018	J	`jnl`	Structure of Protocols for XOR Functions. SIAM J. Comput. Hamed Hatami, Kaave Hosseini, Shachar Lovett
2018	—	`conf`	Sunflowers and Quasi-Sunflowers from Randomness Extractors. APPROX-RANDOM Xin Li, Shachar Lovett, Jiapeng Zhang
2018	J	`jnl`	Sunflowers and Quasi-sunflowers from Randomness Extractors. Electron. Colloquium Comput. Complex. Xin Li, Shachar Lovett, Jiapeng Zhang
2018	J	`jnl`	The List Decoding Radius for Reed-Muller Codes Over Small Fields. IEEE Trans. Inf. Theory Abhishek Bhowmick, Shachar Lovett
2018	A*	`conf`	The Robust Sensitivity of Boolean Functions. SODA Shachar Lovett, Avishay Tal, Jiapeng Zhang
2018	A*	`conf`	The gram-schmidt walk: a cure for the Banaszczyk blues. STOC Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett
2018	J	`jnl`	Torus polynomials: an algebraic approach to ACC lower bounds. CoRR Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao
2018	J	`jnl`	Torus polynomials: an algebraic approach to ACC lower bounds. Electron. Colloquium Comput. Complex. Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao
2017	A*	`conf`	Active Classification with Comparison Queries. FOCS Daniel M. Kane, Shachar Lovett, Shay Moran, Jiapeng Zhang
2017	J	`jnl`	Active classification with comparison queries. CoRR Daniel M. Kane, Shachar Lovett, Shay Moran, Jiapeng Zhang
2017	J	`jnl`	Active classification with comparison queries. Electron. Colloquium Comput. Complex. Daniel M. Kane, Shachar Lovett, Shay Moran, Jiapeng Zhang
2017	J	`jnl`	Additive Combinatorics and its Applications in Theoretical Computer Science. Theory Comput. Shachar Lovett
2017	J	`jnl`	Labeling the complete bipartite graph with no zero cycles. CoRR Daniel M. Kane, Shachar Lovett, Sankeerth Rao
2017	J	`jnl`	Labeling the complete bipartite graph with no zero cycles. Electron. Colloquium Comput. Complex. Daniel M. Kane, Shachar Lovett, Sankeerth Rao
2017	J	`jnl`	Near-optimal linear decision trees for k-SUM and related problems. CoRR Daniel M. Kane, Shachar Lovett, Shay Moran
2017	J	`jnl`	Near-optimal linear decision trees for k-SUM and related problems. Electron. Colloquium Comput. Complex. Daniel M. Kane, Shachar Lovett, Shay Moran
2017	A*	`conf`	Noisy Population Recovery from Unknown Noise. COLT Shachar Lovett, Jiapeng Zhang
2017	—	`conf`	On the Impossibility of Entropy Reversal, and Its Application to Zero-Knowledge Proofs. TCC (1) Shachar Lovett, Jiapeng Zhang
2017	J	`jnl`	On the impossibility of entropy reversal, and its application to zero-knowledge proofs. IACR Cryptol. ePrint Arch. Shachar Lovett, Jiapeng Zhang
2017	J	`jnl`	On the structure of the spectrum of small sets. J. Comb. Theory A Kaave Hosseini, Shachar Lovett
2017	J	`jnl`	Probabilistic Existence of Large Sets of Designs. Electron. Colloquium Comput. Complex. Shachar Lovett, Sankeerth Rao, Alexander Vardy
2017	J	`jnl`	The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues. CoRR Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett
2017	A*	`conf`	The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes. FOCS Daniel Kane, Shachar Lovett, Sankeerth Rao
2016	B	`conf`	Affine-malleable extractors, spectrum doubling, and application to privacy amplification. ISIT Divesh Aggarwal, Kaave Hosseini, Shachar Lovett
2016	A*	`conf`	Algebraic attacks against random local functions and their countermeasures. STOC Benny Applebaum, Shachar Lovett
2016	J	`jnl`	Communication is Bounded by Root of Rank. J. ACM Shachar Lovett
2016	J	`jnl`	Noisy Population Recovery from Unknown Noise. Electron. Colloquium Comput. Complex. Shachar Lovett, Jiapeng Zhang
2016	—	`conf`	On the Beck-Fiala Conjecture for Random Set Systems. APPROX-RANDOM Esther Ezra, Shachar Lovett
2016	J	`jnl`	On the impossibility of entropy reversal, and its application to zero-knowledge proofs. Electron. Colloquium Comput. Complex. Shachar Lovett, Jiapeng Zhang
2016	J	`jnl`	Rectangles Are Nonnegative Juntas. SIAM J. Comput. Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman
2016	J	`jnl`	Robust sensitivity. Electron. Colloquium Comput. Complex. Shachar Lovett, Jiapeng Zhang
2016	A*	`conf`	Structure of Protocols for XOR Functions. FOCS Hamed Hatami, Kaave Hosseini, Shachar Lovett
2016	J	`jnl`	Structure of protocols for XOR functions. Electron. Colloquium Comput. Complex. Kaave Hosseini, Shachar Lovett
2016	J	`jnl`	The Fourier structure of low degree polynomials. Electron. Colloquium Comput. Complex. Shachar Lovett
2016	—	`conf`	Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem. APPROX-RANDOM Daniel Dadush, Shashwat Garg, Shachar Lovett, Aleksandar Nikolov
2016	J	`jnl`	Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem. CoRR Daniel Dadush, Shashwat Garg, Shachar Lovett, Aleksandar Nikolov
2015	J	`jnl`	A tail bound for read- Random Struct. Algorithms Dmitry Gavinsky, Shachar Lovett, Michael E. Saks, Srikanth Srinivasan
2015	J	`jnl`	Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification. Electron. Colloquium Comput. Complex. Divesh Aggarwal, Kaave Hosseini, Shachar Lovett
2015	J	`jnl`	Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification. IACR Cryptol. ePrint Arch. Divesh Aggarwal, Kaave Hosseini, Shachar Lovett
2015	J	`jnl`	Algebraic Attacks against Random Local Functions and Their Countermeasures. Electron. Colloquium Comput. Complex. Benny Applebaum, Shachar Lovett
2015	J	`jnl`	An Exposition of Sanders' Quasi-Polynomial Freiman-Ruzsa Theorem. Theory Comput. Shachar Lovett
2015	J	`jnl`	Bias vs structure of polynomials in large fields, and applications in effective algebraic geometry and coding theory. CoRR Abhishek Bhowmick, Shachar Lovett
2015	J	`jnl`	Bias vs structure of polynomials in large fields, and applications in effective algebraic geometry and coding theory. Electron. Colloquium Comput. Complex. Abhishek Bhowmick, Shachar Lovett
2015	J	`jnl`	Constructive Discrepancy Minimization by Walking on the Edges. SIAM J. Comput. Shachar Lovett, Raghu Meka
2015	J	`jnl`	Group representations that resist random sampling. Random Struct. Algorithms Shachar Lovett, Cristopher Moore, Alexander Russell
2015	A*	`conf`	Improved Noisy Population Recovery, and Reverse Bonami-Beckner Inequality for Sparse Functions. STOC Shachar Lovett, Jiapeng Zhang
2015	—	`conf`	Large Supports are Required for Well-Supported Nash Equilibria. APPROX-RANDOM Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, Hehui Wu
2015	J	`jnl`	Large Supports are required for Well-Supported Nash Equilibria. CoRR Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, Hehui Wu
2015	A	`conf`	Nonclassical Polynomials as a Barrier to Polynomial Lower Bounds. CCC Abhishek Bhowmick, Shachar Lovett
2015	J	`jnl`	On the Beck-Fiala Conjecture for Random Set Systems. Electron. Colloquium Comput. Complex. Esther Ezra, Shachar Lovett
2015	A*	`conf`	Rectangles Are Nonnegative Juntas. STOC Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman
2015	A*	`conf`	The List Decoding Radius of Reed-Muller Codes over Small Fields. STOC Abhishek Bhowmick, Shachar Lovett
2014	J	`jnl`	0-1 Integer Linear Programming with a Linear Number of Constraints. CoRR Russell Impagliazzo, Shachar Lovett, Ramamohan Paturi, Stefan Schneider
2014	J	`jnl`	0-1 Integer Linear Programming with a Linear Number of Constraints. Electron. Colloquium Comput. Complex. Russell Impagliazzo, Shachar Lovett, Ramamohan Paturi, Stefan Schneider
2014	J	`jnl`	An Additive Combinatorics Approach Relating Rank to Communication Complexity. J. ACM Eli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi
2014	A*	`conf`	Communication is bounded by root of rank. STOC Shachar Lovett
2014	A	`conf`	Cooperative weakest link games. AAMAS Yoram Bachrach, Omer Lev, Shachar Lovett, Jeffrey S. Rosenschein, Morteza Zadimoghaddam
2014	J	`jnl`	Correlation Testing for Affine Invariant Properties on 픽 SIAM J. Comput. Hamed Hatami, Shachar Lovett
2014	—	`conf`	En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations. ICALP (1) Dmitry Gavinsky, Shachar Lovett
2014	J	`jnl`	General systems of linear forms: equidistribution and true complexity. Electron. Colloquium Comput. Complex. Hamed Hatami, Pooya Hatami, Shachar Lovett
2014	J	`jnl`	Group representations that resist random sampling. Electron. Colloquium Comput. Complex. Shachar Lovett, Cristopher Moore, Alexander Russell
2014	J	`jnl`	Improved noisy population recovery, and reverse Bonami-Beckner inequality for sparse functions. Electron. Colloquium Comput. Complex. Shachar Lovett, Jiapeng Zhang
2014	J	`jnl`	Linear codes cannot approximate the network capacity within any constant factor. Electron. Colloquium Comput. Complex. Shachar Lovett
2014	J	`jnl`	List decoding Reed-Muller codes over small fields. CoRR Abhishek Bhowmick, Shachar Lovett
2014	J	`jnl`	List decoding Reed-Muller codes over small fields. Electron. Colloquium Comput. Complex. Abhishek Bhowmick, Shachar Lovett
2014	J	`jnl`	New Bounds for Matching Vector Families. SIAM J. Comput. Abhishek Bhowmick, Zeev Dvir, Shachar Lovett
2014	A*	`conf`	Non-malleable codes from additive combinatorics. STOC Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett
2014	J	`jnl`	Nonclassical polynomials as a barrier to polynomial lower bounds. CoRR Abhishek Bhowmick, Shachar Lovett
2014	J	`jnl`	Nonclassical polynomials as a barrier to polynomial lower bounds. Electron. Colloquium Comput. Complex. Abhishek Bhowmick, Shachar Lovett
2014	J	`jnl`	Nontrivial t-designs over finite fields exist for all t. J. Comb. Theory A Arman Fazeli, Shachar Lovett, Alexander Vardy
2014	J	`jnl`	Recent Advances on the Log-Rank Conjecture in Communication Complexity. Bull. EATCS Shachar Lovett
2014	J	`jnl`	Recent advances on the log-rank conjecture in communication complexity. CoRR Shachar Lovett
2014	J	`jnl`	Recent advances on the log-rank conjecture in communication complexity. Electron. Colloquium Comput. Complex. Shachar Lovett
2014	J	`jnl`	Rectangles Are Nonnegative Juntas. Electron. Colloquium Comput. Complex. Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman
2014	J	`jnl`	The Freiman-Ruzsa theorem over finite fields. J. Comb. Theory A Chaim Even-Zohar, Shachar Lovett
2014	J	`jnl`	Variety Evasive Sets. Comput. Complex. Zeev Dvir, János Kollár, Shachar Lovett
2013	J	`jnl`	A Space Lower Bound for Dynamic Approximate Membership Data Structures. SIAM J. Comput. Shachar Lovett, Ely Porat
2013	J	`jnl`	Almost k-Wise vs. k-Wise Independent Permutations, and Uniformity for General Group Actions. Theory Comput. Noga Alon, Shachar Lovett
2013	J	`jnl`	Communication is bounded by root of rank. CoRR Shachar Lovett
2013	J	`jnl`	Communication is bounded by root of rank. Electron. Colloquium Comput. Complex. Shachar Lovett
2013	J	`jnl`	En Route to the log-rank Conjecture: New Reductions and Equivalent Formulations. Electron. Colloquium Comput. Complex. Dmitry Gavinsky, Shachar Lovett
2013	A*	`conf`	Estimating the Distance from Testable Affine-Invariant Properties. FOCS Hamed Hatami, Shachar Lovett
2013	J	`jnl`	Estimating the distance from testable affine-invariant properties. CoRR Hamed Hatami, Shachar Lovett
2013	J	`jnl`	Estimating the distance from testable affine-invariant properties. Electron. Colloquium Comput. Complex. Hamed Hatami, Shachar Lovett
2013	A*	`conf`	Every locally characterized affine-invariant property is testable. STOC Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett
2013	A*	`conf`	New bounds for matching vector families. STOC Abhishek Bhowmick, Zeev Dvir, Shachar Lovett
2013	J	`jnl`	Non-malleable Codes from Additive Combinatorics. Electron. Colloquium Comput. Complex. Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett
2013	J	`jnl`	Non-malleable Codes from Additive Combinatorics. IACR Cryptol. ePrint Arch. Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett
2013	J	`jnl`	Nontrivial t-designs over finite fields exist for all t. Electron. Colloquium Comput. Complex. Arman Fazeli, Shachar Lovett, Alexander Vardy
2013	J	`jnl`	Probabilistic existence of regular combinatorial structures CoRR Greg Kuperberg, Shachar Lovett, Ron Peled
2013	J	`jnl`	Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields. Comput. Complex. Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka
2013	A*	`conf`	Testing Low Complexity Affine-Invariant Properties. SODA Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett
2012	J	`jnl`	A Tail Bound for Read-k Families of Functions CoRR Dmitry Gavinsky, Shachar Lovett, Michael E. Saks, Srikanth Srinivasan
2012	J	`jnl`	A Tail Bound for Read-k Families of Functions. Electron. Colloquium Comput. Complex. Dmitry Gavinsky, Shachar Lovett, Michael E. Saks, Srikanth Srinivasan
2012	—	`conf`	Almost K-Wise vs. K-Wise Independent Permutations, and Uniformity for General Group Actions. APPROX-RANDOM Noga Alon, Shachar Lovett
2012	A*	`conf`	An Additive Combinatorics Approach Relating Rank to Communication Complexity. FOCS Eli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi
2012	J	`jnl`	An exposition of Sanders quasi-polynomial Freiman-Ruzsa theorem. Electron. Colloquium Comput. Complex. Shachar Lovett
2012	J	`jnl`	Bounded-Depth Circuits Cannot Sample Good Codes. Comput. Complex. Shachar Lovett, Emanuele Viola
2012	J	`jnl`	Constructive Discrepancy Minimization by Walking on The Edges CoRR Shachar Lovett, Raghu Meka
2012	A*	`conf`	Constructive Discrepancy Minimization by Walking on the Edges. FOCS Shachar Lovett, Raghu Meka
2012	J	`jnl`	Equivalence of polynomial conjectures in additive combinatorics. Comb. Shachar Lovett
2012	J	`jnl`	Every locally characterized affine-invariant property is testable CoRR Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett
2012	J	`jnl`	Every locally characterized affine-invariant property is testable. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett
2012	A*	`conf`	Large Deviation Bounds for Decision Trees and Sampling Lower Bounds for AC0-Circuits. FOCS Chris Beck, Russell Impagliazzo, Shachar Lovett
2012	J	`jnl`	Large Deviation Bounds for Decision Trees and Sampling Lower Bounds for AC0-circuits. Electron. Colloquium Comput. Complex. Chris Beck, Russell Impagliazzo, Shachar Lovett
2012	J	`jnl`	New Lower Bounds for Matching Vector Codes CoRR Abhishek Bhowmick, Zeev Dvir, Shachar Lovett
2012	J	`jnl`	New Lower Bounds for Matching Vector Codes. Electron. Colloquium Comput. Complex. Abhishek Bhowmick, Zeev Dvir, Shachar Lovett
2012	A*	`conf`	Probabilistic existence of rigid combinatorial structures. STOC Greg Kuperberg, Shachar Lovett, Ron Peled
2012	A	`conf`	Pseudorandom Generators for Read-Once ACC^0. CCC Dmitry Gavinsky, Shachar Lovett, Srikanth Srinivasan
2012	J	`jnl`	Random low-degree polynomials are hard to approximate. Comput. Complex. Ido Ben-Eliezer, Rani Hod, Shachar Lovett
2012	A*	`conf`	Subspace evasive sets. STOC Zeev Dvir, Shachar Lovett
2012	J	`jnl`	Testing Low Complexity Affine-Invariant Properties CoRR Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett
2012	J	`jnl`	Testing Low Complexity Affine-Invariant Properties. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett
2012	J	`jnl`	The Freiman-Ruzsa Theorem in Finite Fields. Electron. Colloquium Comput. Complex. Chaim Even-Zohar, Shachar Lovett
2012	A*	`conf`	Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem. COLT Zohar Shay Karnin, Edo Liberty, Shachar Lovett, Roy Schwartz, Omri Weinstein
2012	J	`jnl`	Variety Evasive Sets CoRR Zeev Dvir, János Kollár, Shachar Lovett
2012	J	`jnl`	Weight Distribution and List-Decoding Size of Reed-Muller Codes. IEEE Trans. Inf. Theory Tali Kaufman, Shachar Lovett, Ely Porat
2011	J	`jnl`	Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions. Electron. Colloquium Comput. Complex. Noga Alon, Shachar Lovett
2011	J	`jnl`	An additive combinatorics approach to the log-rank conjecture in communication complexity CoRR Eli Ben-Sasson, Shachar Lovett, Noga Zewi
2011	J	`jnl`	An additive combinatorics approach to the log-rank conjecture in communication complexity. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Shachar Lovett, Noga Zewi
2011	A	`conf`	Bounded-Depth Circuits Cannot Sample Good Codes. CCC Shachar Lovett, Emanuele Viola
2011	J	`jnl`	Computing Polynomials with Few Multiplications. Theory Comput. Shachar Lovett
2011	J	`jnl`	Computing polynomials with few multiplications. Electron. Colloquium Comput. Complex. Shachar Lovett
2011	—	`conf`	Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 - o(1) Symmetric Gates. APPROX-RANDOM Shachar Lovett, Srikanth Srinivasan
2011	J	`jnl`	Correlation Testing for Affine Invariant Properties on $\mathbb{F}_p^n$ in the High Error Regime CoRR Hamed Hatami, Shachar Lovett
2011	A*	`conf`	Correlation testing for affine invariant properties on F STOC Hamed Hatami, Shachar Lovett
2011	J	`jnl`	Correlation testing for affine invariant properties on F Electron. Colloquium Comput. Complex. Hamed Hatami, Shachar Lovett
2011	J	`jnl`	Inverse Conjecture for the Gowers Norm is False. Theory Comput. Shachar Lovett, Roy Meshulam, Alex Samorodnitsky
2011	A	`conf`	Linear Systems over Finite Abelian Groups. CCC Arkadev Chattopadhyay, Shachar Lovett
2011	J	`jnl`	Linear systems over abelian groups. Electron. Colloquium Comput. Complex. Arkadev Chattopadhyay, Shachar Lovett
2011	A*	`conf`	New Extension of the Weil Bound for Character Sums with Applications to Coding. FOCS Tali Kaufman, Shachar Lovett
2011	J	`jnl`	On the Furthest Hyperplane Problem and Maximal Margin Clustering CoRR Edo Liberty, Shachar Lovett, Omri Weinstein
2011	J	`jnl`	Probabilistic existence of rigid combinatorial structures CoRR Greg Kuperberg, Shachar Lovett, Ron Peled
2011	J	`jnl`	Probabilistic existence of rigid combinatorial structures. Electron. Colloquium Comput. Complex. Greg Kuperberg, Shachar Lovett, Ron Peled
2011	J	`jnl`	Subspace Evasive Sets CoRR Zeev Dvir, Shachar Lovett
2011	J	`jnl`	Subspace Evasive Sets. Electron. Colloquium Comput. Complex. Zeev Dvir, Shachar Lovett
2010	A*	`conf`	A Lower Bound for Dynamic Approximate Membership Data Structures. FOCS Shachar Lovett, Ely Porat
2010	J	`jnl`	A lower bound for dynamic approximate membership data structures. Electron. Colloquium Comput. Complex. Shachar Lovett, Ely Porat
2010	J	`jnl`	An elementary proof of anti-concentration of polynomials in Gaussian variables. Electron. Colloquium Comput. Complex. Shachar Lovett
2010	J	`jnl`	Bounded-depth circuits cannot sample good codes. Electron. Colloquium Comput. Complex. Shachar Lovett, Emanuele Viola
2010	J	`jnl`	Equivalence of polynomial conjectures in additive combinatorics. Electron. Colloquium Comput. Complex. Shachar Lovett
2010	J	`jnl`	Higher-order Fourier analysis of F Electron. Colloquium Comput. Complex. Hamed Hatami, Shachar Lovett
2010	J	`jnl`	Holes in generalized Reed-Muller codes. IEEE Trans. Inf. Theory Shachar Lovett
2010	A*	`conf`	Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields. FOCS Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka
2010	J	`jnl`	Pseudorandom generators for CC Electron. Colloquium Comput. Complex. Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka
2010	J	`jnl`	Testing of exponentially large codes, by a new extension to Weil bound for character sums. Electron. Colloquium Comput. Complex. Tali Kaufman, Shachar Lovett
2010	J	`jnl`	The Complexity of Boolean Functions in Different Characteristics. Comput. Complex. Parikshit Gopalan, Amir Shpilka, Shachar Lovett
2010	A	`conf`	Weight Distribution and List-Decoding Size of Reed-Muller Codes. ICS Tali Kaufman, Shachar Lovett, Ely Porat
2009	J	`jnl`	Explicit lower bound for fooling polynomials by the sum of small-bias generators. Electron. Colloquium Comput. Complex. Shachar Lovett, Yoav Tzur
2009	A*	`conf`	On cryptography with auxiliary input. STOC Yevgeniy Dodis, Yael Tauman Kalai, Shachar Lovett
2009	A	`conf`	On the Complexity of Boolean Functions in Different Characteristics. CCC Parikshit Gopalan, Shachar Lovett, Amir Shpilka
2009	J	`jnl`	On the Complexity of Boolean Functions in Different Characteristics. Electron. Colloquium Comput. Complex. Parikshit Gopalan, Shachar Lovett, Amir Shpilka
2009	J	`jnl`	Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness CoRR Ido Ben-Eliezer, Shachar Lovett, Ariel Yadin
2009	—	`conf`	Pseudorandom Bit Generators That Fool Modular Sums. APPROX-RANDOM Shachar Lovett, Omer Reingold, Luca Trevisan, Salil P. Vadhan
2009	—	`conf`	Random Low Degree Polynomials are Hard to Approximate. APPROX-RANDOM Ido Ben-Eliezer, Rani Hod, Shachar Lovett
2009	J	`jnl`	The density of weights of Generalized Reed--Muller codes CoRR Shachar Lovett
2009	J	`jnl`	The density of weights of Generalized Reed-Muller codes. Electron. Colloquium Comput. Complex. Shachar Lovett
2009	J	`jnl`	Title: Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness. Electron. Colloquium Comput. Complex. Shachar Lovett, Ido Ben-Eliezer, Ariel Yadin
2009	J	`jnl`	Unconditional Pseudorandom Generators for Low Degree Polynomials. Theory Comput. Shachar Lovett
2008	A*	`conf`	Inverse conjecture for the gowers norm is false. STOC Shachar Lovett, Roy Meshulam, Alex Samorodnitsky
2008	J	`jnl`	Lower bounds for adaptive linearity tests CoRR Shachar Lovett
2008	A	`conf`	Lower bounds for adaptive linearity tests. STACS Shachar Lovett
2008	J	`jnl`	Random low degree polynomials are hard to approximate. Electron. Colloquium Comput. Complex. Ido Ben-Eliezer, Rani Hod, Shachar Lovett
2008	J	`jnl`	The List-Decoding Size of Reed-Muller Codes CoRR Tali Kaufman, Shachar Lovett
2008	J	`jnl`	The List-Decoding Size of Reed-Muller Codes. Electron. Colloquium Comput. Complex. Shachar Lovett, Tali Kaufman
2008	A*	`conf`	Unconditional pseudorandom generators for low degree polynomials. STOC Shachar Lovett
2008	A*	`conf`	Worst Case to Average Case Reductions for Polynomials. FOCS Tali Kaufman, Shachar Lovett
2008	J	`jnl`	Worst case to Average case reductions for polynomials. Electron. Colloquium Comput. Complex. Shachar Lovett, Tali Kaufman
2007	J	`jnl`	Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits CoRR Shachar Lovett, Sasha Sodin
2007	J	`jnl`	Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits. Electron. Colloquium Comput. Complex. Shachar Lovett, Sasha Sodin
2007	J	`jnl`	Inverse Conjecture for the Gowers norm is false. Electron. Colloquium Comput. Complex. Shachar Lovett, Roy Meshulam, Alex Samorodnitsky
2007	J	`jnl`	Tight lower bounds for adaptive linearity tests. Electron. Colloquium Comput. Complex. Shachar Lovett
2007	J	`jnl`	Unconditional pseudorandom generators for low degree polynomials. Electron. Colloquium Comput. Complex. Shachar Lovett