Shachar Lovett

发表

Nontrivial t-designs over finite fields exist for all t

Arman Fazeli, Shachar Lovett, Alexander Vardy, 2013, Electron. Colloquium Comput. Complex..

Robust sensitivity

Shachar Lovett, Jiapeng Zhang, 2016, Electron. Colloquium Comput. Complex..

The Gram-Schmidt walk: a cure for the Banaszczyk blues

Shachar Lovett, Nikhil Bansal, Daniel Dadush, 2017, STOC.

The List Decoding Radius for Reed-Muller Codes Over Small Fields

Shachar Lovett, Abhishek Bhowmick, Abhishek Bhowmick, 2018, IEEE Trans. Inf. Theory.

New Extension of the Weil Bound for Character Sums with Applications to Coding

Shachar Lovett, Tali Kaufman, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

Decision list compression by mild random restrictions

Shachar Lovett, Kewen Wu, Jiapeng Zhang, 2019, Electron. Colloquium Comput. Complex..

Non-malleable codes from additive combinatorics

Shachar Lovett, Yevgeniy Dodis, Divesh Aggarwal, 2014, STOC.

Affine-malleable extractors, spectrum doubling, and application to privacy amplification

Shachar Lovett, Divesh Aggarwal, Kaave Hosseini, 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

Equality alone does not simulate randomness

Shachar Lovett, Arkadev Chattopadhyay, Marc Vinyals, 2018, Electron. Colloquium Comput. Complex..

On the Beck‐Fiala conjecture for random set systems

Shachar Lovett, Esther Ezra, Esther Ezra, 2015, Electron. Colloquium Comput. Complex..

The Power of Comparisons for Actively Learning Linear Classifiers pdf

Shachar Lovett, Daniel M. Kane, Max Hopkins, 2019, NeurIPS.

Linear codes cannot approximate the network capacity within any constant factor

Shachar Lovett, 2014, Electron. Colloquium Comput. Complex..

Pseudorandom Bit Generators That Fool Modular Sums

Shachar Lovett, Luca Trevisan, Omer Reingold, 2009, APPROX-RANDOM.

Group representations that resist random sampling

Shachar Lovett, Alexander Russell, Cristopher Moore, 2015, Random Struct. Algorithms.

The Freiman-Ruzsa theorem over finite fields

Shachar Lovett, Chaim Even-Zohar, 2014, J. Comb. Theory, Ser. A.

Special Issue: CCC 2017: Guest Editor's Foreword

Ryan O'Donnell, Shachar Lovett, R. O'Donnell, 2018, Theory of Computing.

Probabilistic Existence of Large Sets of Designs

Shachar Lovett, Alexander Vardy, Sankeerth Rao, 2018, SODA.

Nonclassical polynomials as a barrier to polynomial lower bounds pdf

Shachar Lovett, Abhishek Bhowmick, 2014, Electron. Colloquium Comput. Complex..

Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 - o(1) Symmetric Gates

Shachar Lovett, Srikanth Srinivasan, Shachar Lovett, 2011, APPROX-RANDOM.

From DNF compression to sunflower theorems via regularity

Shachar Lovett, Jiapeng Zhang, Noam Solomon, 2019, Electron. Colloquium Comput. Complex..

Constructive Discrepancy Minimization by Walking on the Edges

Shachar Lovett, Raghu Meka, 2012, FOCS.

Almost k-Wise vs. k-Wise Independent Permutations, and Uniformity for General Group Actions

Noga Alon, Shachar Lovett, N. Alon, 2012, Theory Comput..

Linear Systems over Finite Abelian Groups

Shachar Lovett, Arkadev Chattopadhyay, A. Chattopadhyay, 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

Bounded-Depth Circuits Cannot Sample Good Codes

Shachar Lovett, Emanuele Viola, Emanuele Viola, 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

Sunflowers and Quasi-sunflowers from Randomness Extractors

Xin Li, Shachar Lovett, Jiapeng Zhang, 2018, Electron. Colloquium Comput. Complex..

High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games pdf

Shachar Lovett, Tali Kaufman, Max Hopkins, 2020, Electron. Colloquium Comput. Complex..

Almost k-Wise vs. k-Wise Independent Permutations, and Uniformity for General Group Actions

Noga Alon, Shachar Lovett, 2013, Theory Comput..

Generalized comparison trees for point-location problems

Shachar Lovett, Shay Moran, Daniel M. Kane, 2018, Electron. Colloquium Comput. Complex..

New bounds for matching vector families

Shachar Lovett, Zeev Dvir, Abhishek Bhowmick, 2013, STOC '13.

The List Decoding Radius for Reed–Muller Codes Over Small Fields

Shachar Lovett, Abhishek Bhowmick, 2018, IEEE Transactions on Information Theory.

Equivalence of polynomial conjectures in additive combinatorics

Shachar Lovett, Shachar Lovett, 2010, Combinatorica.

A Lower Bound for Dynamic Approximate Membership Data Structures

Shachar Lovett, Ely Porat, 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

List decoding Reed-Muller codes over small fields

Shachar Lovett, Abhishek Bhowmick, 2014, Electron. Colloquium Comput. Complex..

The Robust Sensitivity of Boolean Functions

Shachar Lovett, Avishay Tal, Jiapeng Zhang, 2018, SODA.

The Freiman-Ruzsa Theorem in Finite Fields

Shachar Lovett, Chaim Even-Zohar, 2012, Electron. Colloquium Comput. Complex..

En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations

Shachar Lovett, Dmitry Gavinsky, Dmitry Gavinsky, 2014, ICALP.

Log-rank and lifting for AND-functions pdf

Shachar Lovett, Alexander Knop, Sam McGuire, 2020, Electron. Colloquium Comput. Complex..

The density of weights of Generalized Reed--Muller codes

Shachar Lovett, 2009, Electron. Colloquium Comput. Complex..

Large Supports are required for Well-Supported Nash Equilibria pdf

Shachar Lovett, Hao Huang, Adrian Vetta, 2015, APPROX-RANDOM.

An Additive Combinatorics Approach Relating Rank to Communication Complexity

Shachar Lovett, Eli Ben-Sasson, Noga Ron-Zewi, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

Bias vs structure of polynomials in large fields, and applications in effective algebraic geometry and coding theory

Shachar Lovett, Abhishek Bhowmick, Abhishek Bhowmick, 2015, Electron. Colloquium Comput. Complex..

Tight lower bounds for adaptive linearity tests

Shachar Lovett, 2007, Electron. Colloquium Comput. Complex..

Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits

Shachar Lovett, Sasha Sodin, S. Sodin, 2007, Electron. Colloquium Comput. Complex..

A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds

Shachar Lovett, Kaave Hosseini, Shachar Lovett, 2018, Electron. Colloquium Comput. Complex..

An Exposition of Sanders' Quasi-Polynomial Freiman-Ruzsa Theorem

Shachar Lovett, Shachar Lovett, 2015, Theory Comput..

Higher-order Fourier analysis of Fpn and the complexity of systems of linear forms

Shachar Lovett, Hamed Hatami, Hamed Hatami, 2010, Electron. Colloquium Comput. Complex..

MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture

Shachar Lovett, 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

On the Beck-Fiala Conjecture for Random Set Systems

Shachar Lovett, Esther Ezra, 2015, Electron. Colloquium Comput. Complex..

Correlation testing for affine invariant properties on Fpn in the high error regime

Shachar Lovett, Hamed Hatami, Hamed Hatami, 2011, STOC '11.

Additive Combinatorics and its Applications in Theoretical Computer Science

Shachar Lovett, Shachar Lovett, 2017, Theory Comput..

Improved Noisy Population Recovery, and Reverse Bonami-Beckner Inequality for Sparse Functions

Shachar Lovett, Jiapeng Zhang, 2014, Electron. Colloquium Comput. Complex..

Lecture 2: Uncomputability and the Haling Problem

Shachar Lovett, Dongcai Shen, 2013 .

Random low-degree polynomials are hard to approximate

Shachar Lovett, Rani Hod, Ido Ben-Eliezer, 2009, computational complexity.

Higher-order Fourier Analysis and Applications

Shachar Lovett, Pooya Hatami, Hamed Hatami, 2019, Found. Trends Theor. Comput. Sci..

Lecture 7: Space Complexity

Shachar Lovett, Dongcai Shen, 2013 .

Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem

Shachar Lovett, Roy Schwartz, Edo Liberty, 2012, COLT.

Every locally characterized affine-invariant property is testable

Shachar Lovett, Pooya Hatami, Eldar Fischer, 2013, STOC '13.

DNF sparsification beyond sunflowers

Shachar Lovett, Jiapeng Zhang, 2018, Electron. Colloquium Comput. Complex..

Cooperative weakest link games

Morteza Zadimoghaddam, Omer Lev, Shachar Lovett, 2014, AAMAS.

Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields

Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka, 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

Near-optimal linear decision trees for k-SUM and related problems

Shachar Lovett, Shay Moran, Daniel M. Kane, 2017, Electron. Colloquium Comput. Complex..

Random Low Degree Polynomials are Hard to Approximate

Shachar Lovett, Rani Hod, Ido Ben-Eliezer, 2009, APPROX-RANDOM.

0-1 Integer Linear Programming with a Linear Number of Constraints

Shachar Lovett, Russell Impagliazzo, Ramamohan Paturi, 2014, Electron. Colloquium Comput. Complex..

Large Deviation Bounds for Decision Trees and Sampling Lower Bounds for AC0-Circuits

Shachar Lovett, Russell Impagliazzo, Chris Beck, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

Bounded-Depth Circuits Cannot Sample Good Codes

Shachar Lovett, Emanuele Viola, 2011, Computational Complexity Conference.

Testing Low Complexity Affine-Invariant Properties pdf

Shachar Lovett, Eldar Fischer, Arnab Bhattacharyya, 2013, SODA.

Codes over integers, and the singularity of random matrices with large entries

Shachar Lovett, Sankeerth Rao Karingula, Shachar Lovett, 2020, Electron. Colloquium Comput. Complex..

New Lower Bounds for Matching Vector Codes pdf

Shachar Lovett, Zeev Dvir, Abhishek Bhowmick, 2012, Electron. Colloquium Comput. Complex..

Correlation Testing for Affine Invariant Properties on 픽pn in the High Error Regime

Shachar Lovett, Hamed Hatami, 2014, SIAM J. Comput..

Improved bounds for the sunflower lemma

Shachar Lovett, Kewen Wu, Jiapeng Zhang, 2019, Electron. Colloquium Comput. Complex..

Structure of Protocols for XOR Functions

Shachar Lovett, Hamed Hatami, Kaave Hosseini, 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

Constructive Discrepancy Minimization by Walking on the Edges

Shachar Lovett, Raghu Meka, Raghu Meka, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

A Space Lower Bound for Dynamic Approximate Membership Data Structures

Shachar Lovett, Ely Porat, 2013, SIAM J. Comput..

Inverse conjecture for the gowers norm is false

Shachar Lovett, Alex Samorodnitsky, Roy Meshulam, 2007, Theory Comput..

Sign rank vs discrepancy

Shachar Lovett, Hamed Hatami, Kaave Hosseini, 2019, Electron. Colloquium Comput. Complex..

Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates

Shachar Lovett, Avishay Tal, Pooya Hatami, 2018, Electron. Colloquium Comput. Complex..

The List-Decoding Size of Reed-Muller Codes

Shachar Lovett, Tali Kaufman, 2008, Electron. Colloquium Comput. Complex..

Communication is bounded by root of rank

Shachar Lovett, Shachar Lovett, 2013, STOC.

The Complexity of Boolean Functions in Different Characteristics

Shachar Lovett, Parikshit Gopalan, Amir Shpilka, 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

An Additive Combinatorics Approach Relating Rank to Communication Complexity

Shachar Lovett, Eli Ben-Sasson, Noga Ron-Zewi, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

Worst Case to Average Case Reductions for Polynomials

Shachar Lovett, Tali Kaufman, T. Kaufman, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

Pseudorandom Generators for Read-Once ACC^0

Shachar Lovett, Dmitry Gavinsky, Srikanth Srinivasan, 2012, 2012 IEEE 27th Conference on Computational Complexity.

On cryptography with auxiliary input

Yael Tauman Kalai, Shachar Lovett, Yevgeniy Dodis, 2009, STOC '09.

Noise-tolerant, Reliable Active Classification with Comparison Queries

Shachar Lovett, Gaurav Mahajan, Max Hopkins, 2020, COLT.

The Fourier structure of low degree polynomials

Shachar Lovett, Shachar Lovett, 2016, Electron. Colloquium Comput. Complex..

Probabilistic existence of regular combinatorial structures

Shachar Lovett, Greg Kuperberg, Ron Peled, 2011, ArXiv.

Probabilistic existence of large sets of designs

Shachar Lovett, Alexander Vardy, Sankeerth Rao, 2018, J. Comb. Theory, Ser. A.

Recent Advances on the Log-Rank Conjecture in Communication Complexity

Shachar Lovett, Shachar Lovett, 2014, Bull. EATCS.

Unconditional Pseudorandom Generators for Low Degree Polynomials

Shachar Lovett, 2009, Theory Comput..

A proof of the GM-MDS conjecture

Shachar Lovett, 2018, Electron. Colloquium Comput. Complex..

Holes in Generalized Reed–Muller Codes

Shachar Lovett, 2010, IEEE Transactions on Information Theory.

Optimality of linear sketching under modular updates

Shachar Lovett, Grigory Yaroslavtsev, Kaave Hosseini, 2018, Electron. Colloquium Comput. Complex..

General systems of linear forms: equidistribution and true complexity

Shachar Lovett, Pooya Hatami, Hamed Hatami, 2014, Electron. Colloquium Comput. Complex..

Rectangles Are Nonnegative Juntas

Shachar Lovett, David Zuckerman, Thomas Watson, 2015, SIAM J. Comput..

On the structure of the spectrum of small sets

Shachar Lovett, Kaave Hosseini, Shachar Lovett, 2015, J. Comb. Theory, Ser. A.

Active Classification with Comparison Queries

Shachar Lovett, Shay Moran, Daniel M. Kane, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem pdf

Shachar Lovett, Aleksandar Nikolov, Daniel Dadush, 2016, APPROX-RANDOM.

Inverse Conjecture for the Gowers Norm is False

Shachar Lovett, Alex Samorodnitsky, Roy Meshulam, 2011, Theory Comput..

Preface

Shachar Lovett, Roy Schwartz, Edo Liberty, 2012, COLT.

Pseudorandom Generators from Polarizing Random Walks

Shachar Lovett, Pooya Hatami, Eshan Chattopadhyay, 2018, Electron. Colloquium Comput. Complex..

A tail bound for read-k families of functions pdf

Shachar Lovett, Michael E. Saks, Dmitry Gavinsky, 2015, Random Struct. Algorithms.

Estimating the Distance from Testable Affine-Invariant Properties

Shachar Lovett, Hamed Hatami, 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

Linear systems over abelian groups

Shachar Lovett, Arkadev Chattopadhyay, 2011, Electron. Colloquium Comput. Complex..

Fractional pseudorandom generators from any fourier level pdf

Shachar Lovett, Eshan Chattopadhyay, Chin Ho Lee, 2020, CCC.

The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes

Shachar Lovett, Daniel M. Kane, Sankeerth Rao, 2019, SIAM J. Comput..

Correlation Testing for Affine Invariant Properties on $\mathbb{F}_p^n$ in the High Error Regime pdf

Shachar Lovett, Hamed Hatami, Hamed Hatami, 2011, ArXiv.

Subspace Evasive Sets

Shachar Lovett, Zeev Dvir, Shachar Lovett, 2011, Electron. Colloquium Comput. Complex..

XOR lemmas for resilient functions against polynomials

Shachar Lovett, Pooya Hatami, David Zuckerman, 2019, Electron. Colloquium Comput. Complex..

Noisy Population Recovery from Unknown Noise

Shachar Lovett, Jiapeng Zhang, 2017, COLT.

Title: Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness

Shachar Lovett, Ariel Yadin, Ido Ben-Eliezer, 2009, Electron. Colloquium Comput. Complex..

Unconditional pseudorandom generators for low degree polynomials

Shachar Lovett, Shachar Lovett, 2008, Theory Comput..

Lecture 14: Randomized Computation (cont.)

Shachar Lovett, Dongcai Shen, 2013 .

Variety Evasive Sets

Shachar Lovett, Zeev Dvir, János Kollár, 2013, computational complexity.

Explicit lower bound for fooling polynomials by the sum of small-bias generators

Shachar Lovett, Yoav Tzur, 2009, Electron. Colloquium Comput. Complex..

Weight Distribution and List-Decoding Size of Reed–Muller Codes

Shachar Lovett, Ely Porat, Tali Kaufman, 2012, IEEE Transactions on Information Theory.

Hardness Amplification for Non-Commutative Arithmetic Circuits

Shachar Lovett, Russell Impagliazzo, Marco Carmosino, 2018, Computational Complexity Conference.

Improved lifting theorems via robust sunflowers

Shachar Lovett, Raghu Meka, Jiapeng Zhang, 2020, Electron. Colloquium Comput. Complex..

Testing of exponentially large codes, by a new extension to Weil bound for character sums

Shachar Lovett, Tali Kaufman, T. Kaufman, 2010, Electron. Colloquium Comput. Complex..

Towards a combinatorial characterization of bounded memory learning pdf

Shachar Lovett, Alon Gonen, Michal Moshkovitz, 2020, NeurIPS.

Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness pdf

Shachar Lovett, Ido Ben-Eliezer, Ariel Yadin, 2009, ArXiv.

Torus polynomials: an algebraic approach to ACC lower bounds

Shachar Lovett, Abhishek Bhrushundi, Kaave Hosseini, 2018, Electron. Colloquium Comput. Complex..

Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields

Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka, 2010, FOCS.

An elementary proof of anti-concentration of polynomials in Gaussian variables

Shachar Lovett, 2010, Electron. Colloquium Comput. Complex..

The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes

Shachar Lovett, Sankeerth Rao, Daniel Kane, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

Rectangles Are Nonnegative Juntas

Shachar Lovett, David Zuckerman, Thomas Watson, 2016, SIAM J. Comput..

The Complexity of Boolean Functions in Different Characteristics

Shachar Lovett, Parikshit Gopalan, Amir Shpilka, 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

Probabilistic existence of rigid combinatorial structures

Shachar Lovett, Greg Kuperberg, Ron Peled, 2012, STOC '12.

Point Location and Active Learning: Learning Halfspaces Almost Optimally

Shachar Lovett, Daniel M. Kane, Gaurav Mahajan, 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

On the Furthest Hyperplane Problem and Maximal Margin Clustering pdf

Shachar Lovett, Edo Liberty, Omri Weinstein, 2011, ArXiv.

Lower bounds for adaptive linearity tests pdf

Shachar Lovett, 2008, STACS.

Computing Polynomials with Few Multiplications

Shachar Lovett, 2011, Theory Comput..

Labeling the complete bipartite graph with no zero cycles pdf

Shachar Lovett, Daniel M. Kane, Sankeerth Rao, 2017, Electron. Colloquium Comput. Complex..

An additive combinatorics approach to the log-rank conjecture in communication complexity pdf

Shachar Lovett, Eli Ben-Sasson, Noga Ron-Zewi, 2011, Electron. Colloquium Comput. Complex..

On the Impossibility of Entropy Reversal, and Its Application to Zero-Knowledge Proofs

Shachar Lovett, Jiapeng Zhang, 2016, TCC.

Algebraic attacks against random local functions and their countermeasures

Shachar Lovett, Benny Applebaum, Shachar Lovett, 2016, SIAM J. Comput..

Algebraic Attacks against Random Local Functions and Their Countermeasures

Shachar Lovett, Benny Applebaum, 2015, SIAM J. Comput..

New Bounds for Matching Vector Families

Shachar Lovett, Zeev Dvir, Abhishek Bhowmick, 2014, SIAM J. Comput..

Near-optimal Linear Decision Trees for k-SUM and Related Problems

Shachar Lovett, Shay Moran, Daniel M. Kane, 2019, J. ACM.

Lifting with Sunflowers

Shachar Lovett, Raghu Meka, Jiapeng Zhang, 2022, ITCS.

Decision List Compression by Mild Random Restrictions

Shachar Lovett, Jiapeng Zhang, Kewen Wu, 2021, J. ACM.

High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games

Shachar Lovett, Tali Kaufman, Mitali Bafna, 2020, SODA.

Hypercontractivity on high dimensional expanders

Shachar Lovett, Tali Kaufman, Mitali Bafna, 2021, Electron. Colloquium Comput. Complex..

Realizable Learning is All You Need pdf

Shachar Lovett, Max Hopkins, Daniel Kane, 2021, ArXiv.

Singularity of Random Integer Matrices with Large Entries

Shachar Lovett, Sankeerth Rao Karingula, Shachar Lovett, 2020, APPROX-RANDOM.

Bounded Memory Active Learning through Enriched Queries

Shachar Lovett, Max Hopkins, Michal Moshkovitz, 2021, COLT.

Bilinear Classes: A Structural Framework for Provable Generalization in RL

Shachar Lovett, Sham M. Kakade, Simon S. Du, 2021, ICML.

The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues

Shachar Lovett, Nikhil Bansal, Daniel Dadush, 2019, Theory Comput..

Pseudorandom generators for CC 0 [p] and the Fourier spectrum of low-degree polynomials over finite fields.

Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka, 2010 .

Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem

Shachar Lovett, Daniel Dadush, Shashwat Garg, 2019, Theory Comput..

The analytic rank of tensors is subadditive, and its applications

Shachar Lovett, 2018 .

Higher-order Fourier analysis of $\mathbb{F}_p^n$ and the complexity of systems of linear forms

Shachar Lovett, Hamed Hatami, Hamed Hatami, 2010, 1011.4600.