Shachar Lovett

Associate Professor

CSE department in UC San Diego

加州大学圣地亚哥分校

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

I am an Associate Professor in the CSE department in UC San Diego. I am part of the Theory of Computation group and help run the theory seminar.

I have a broad interest in theoretical computer science and mathematics. In particular computational complexity, randomness and pseudo-randomness, algebraic constructions, coding theory, additive combinatorics and high-dimensional geometry. My research is funded by NSF.

Papers124 papers

Sort

By YearBy Citation

Point Location and Active Learning: Learning Halfspaces Almost Optimally

Hopkins Max,Kane Daniel M.,Lovett Shachar, Mahajan Gaurav

Bibtex

Improved bounds for the sunflower lemma.

Ryan Alweiss,Shachar Lovett, Kewen Wu, Jiapeng Zhang

Electronic Colloquium on Computational Complexity (ECCC), (2019): 110

EIBibtex

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

Daniel M. Kane,Shachar Lovett,Shay Moran

Journal of the ACM, no. 3 (2019): 1-18

EIBibtex

From DNF compression to sunflower theorems via regularity.

Shachar Lovett,Noam Solomon,Jiapeng Zhang

Electronic Colloquium on Computational Complexity (ECCC), (2019): 28

EIBibtex

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

Nikhil Bansal,Daniel Dadush,Shashwat Garg,Shachar Lovett

Theory of Computing, no. 1 (2019): 1-27

Bibtex

Sign rank vs Discrepancy.

Hamed Hatami, Kaave Hosseini,Shachar Lovett

Electronic Colloquium on Computational Complexity (ECCC), (2019): 67

EIBibtex

On the Beck‐Fiala conjecture for random set systems

Esther Ezra,Shachar Lovett

Random Structures and Algorithms, no. 4 (2019): 665-675

Bibtex

XOR Lemmas for Resilient Functions Against Polynomials.

Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini,Shachar Lovett,David Zuckerman

Electronic Colloquium on Computational Complexity (ECCC), (2019): 145

EIBibtex

Higher-order Fourier Analysis and Applications.

Hamed Hatami,Pooya Hatami,Shachar Lovett

Foundations and Trends in Theoretical Computer Science, no. 4 (2019): 247-448

EIBibtex

Decision list compression by mild random restrictions.

Shachar Lovett, Kewen Wu, Jiapeng Zhang

Electronic Colloquium on Computational Complexity (ECCC), (2019): 137

EIBibtex

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

Eshan Chattopadhyay,Pooya Hatami,Shachar Lovett,Avishay Tal

Electronic Colloquium on Computational Complexity (ECCC), (2018)

EIBibtex

DNF sparsification beyond sunflowers.

Shachar Lovett,Jiapeng Zhang

Electronic Colloquium on Computational Complexity (ECCC), (2018)

Cited by8EIBibtex

Equality Alone Does Not Simulate Randomness.

Arkadev Chattopadhyay,Shachar Lovett,Marc Vinyals

Electronic Colloquium on Computational Complexity (ECCC), (2018): 206

EIBibtex

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

Daniel M. Kane,Shachar Lovett,Shay Moran

STOC '18: Symposium on Theory of Computing Los Angeles CA USA June, 20..., pp.554-563, (2018)

Cited by20EIBibtex

Sunflowers and Quasi-sunflowers from Randomness Extractors.

Xin Li,Shachar Lovett,Jiapeng Zhang

Electronic Colloquium on Computational Complexity (ECCC), (2018)

EIBibtex

Probabilistic Existence of Large Sets of Designs.

Shachar Lovett, Sankeerth Rao,Alexander Vardy

SODA '18: Symposium on Discrete Algorithms New Orleans Louisiana January, 2018, pp.1545-1556, (2018)

Cited by4EIBibtex

Non-malleable codes from additive combinatorics

Divesh Aggarwal,Yevgeniy Dodis,Shachar Lovett

SIAM J. Comput., no. 2 (2018): 524-546

Cited by118EIBibtex

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

Nikhil Bansal,Daniel Dadush,Shashwat Garg,Shachar Lovett

STOC '18: Symposium on Theory of Computing Los Angeles CA USA June, 20..., (2018): 587-597

Cited by14EIBibtex

Generalized comparison trees for point-location problems.

Daniel M. Kane,Shachar Lovett,Shay Moran

Electronic Colloquium on Computational Complexity (ECCC), (2018)

Cited by2EIBibtex

Algebraic Attacks against Random Local Functions and Their Countermeasures.

Benny Applebaum,Shachar Lovett

SIAM J. Comput., no. 1 (2018): 52-79

Cited by36EIBibtex

Optimality of Linear Sketching under Modular Updates.

Kaave Hosseini,Shachar Lovett,Grigory Yaroslavtsev

Electronic Colloquium on Computational Complexity (ECCC), (2018)

EIBibtex

The analytic rank of tensors and its applications.

Shachar Lovett

arXiv: Combinatorics, (2018)

Cited by4Bibtex

Pseudorandom Generators from Polarizing Random Walks.

Eshan Chattopadhyay,Pooya Hatami, Kaave Hosseini,Shachar Lovett

Electronic Colloquium on Computational Complexity (ECCC), (2018)

Cited by7EIBibtex

A proof of the GM-MDS conjecture.

Shachar Lovett

Electronic Colloquium on Computational Complexity (ECCC), (2018): 47

Cited by2EIBibtex

Hardness Amplification for Non-Commutative Arithmetic Circuits.

Marco Carmosino,Russell Impagliazzo,Shachar Lovett,Ivan Mihajlin

Electronic Colloquium on Computational Complexity (ECCC), (2018)

Cited by5EIBibtex

MDS matrices over small fields: A proof of the GM-MDS conjecture.

Shachar Lovett

FOCS, (2018): 194-199

Cited by9EIBibtex

Structure of protocols for XOR functions.

Kaave Hosseini,Shachar Lovett

SIAM J. Comput., no. 1 (2018): 208-217

Cited by12EIBibtex

Structure of protocols for XOR functions

H Hatami, K Hosseini,S Lovett

SIAM Journal on Computing, no. 1 (2018): 208-217

Cited by26Bibtex

A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds.

Kaave Hosseini,Shachar Lovett

Electronic Colloquium on Computational Complexity (ECCC), (2018): 142

EIBibtex

Torus polynomials: an algebraic approach to ACC lower bounds.

Abhishek Bhrushundi, Kaave Hosseini,Shachar Lovett, Sankeerth Rao

Electronic Colloquium on Computational Complexity (ECCC), (2018)

EIBibtex

A counterexample to a strong variant of the Polynomial Freiman-Ruzsa conjecture in Euclidean space

Shachar Lovett,Oded Regev

arXiv: Number Theory, (2017)

Cited by1Bibtex

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

Daniel Kane,Shachar Lovett, Sankeerth Rao

SIAM Journal on Computing, no. 4 (2017): 252-259

Cited by6EIBibtex

Additive Combinatorics and its Applications in Theoretical Computer Science.

Shachar Lovett

Theory of Computing, Graduate Surveys, (2017): 1-55

Cited by3EIBibtex

Active classification with comparison queries.

Daniel M. Kane,Shachar Lovett,Shay Moran,Jiapeng Zhang

Electronic Colloquium on Computational Complexity (ECCC), (2017): 355-366

Cited by20EIBibtex

Labeling the complete bipartite graph with no zero cycles.

Daniel Kane,Shachar Lovett, Sankeerth Rao

Electronic Colloquium on Computational Complexity (ECCC), (2017)

Cited by3EIBibtex

Noisy Population Recovery from Unknown Noise.

Shachar Lovett,Jiapeng Zhang

COLT, pp.1417-1431, (2017)

Cited by2EIBibtex

On the impossibility of entropy reversal, and its application to zero-knowledge proofs.

Shachar Lovett,Jiapeng Zhang

TCC, pp.31-55, (2017)

Cited by2EIBibtex

Probabilistic existence of regular combinatorial structures

Greg Kuperberg,Shachar Lovett,Ron Peled

Geometric and Functional Analysis, no. 4 (2017): 919-972

Cited by2Bibtex

Rectangles Are Nonnegative Juntas.

Mika Göös,Shachar Lovett,Raghu Meka,Thomas Watson 0001,David Zuckerman

SIAM J. Comput., no. 5 (2016): 1835-1869

Cited by74EIBibtex

General systems of linear forms: Equidistribution and true complexity

Hamed Hatami,Pooya Hatami,Shachar Lovett

Electronic Colloquium on Computational Complexity (ECCC), (2016): 446-477

Cited by9EIBibtex

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

Daniel Dadush,Shashwat Garg,Shachar Lovett,Aleksandar Nikolov

APPROX-RANDOM, (2016): 28:1-28:12

Cited by2EIBibtex

Communication is Bounded by Root of Rank.

Shachar Lovett

Journal of the ACM, no. 1 (2016): 1-9

Cited by40EIBibtex

The Fourier structure of low degree polynomials.

Shachar Lovett

Electronic Colloquium on Computational Complexity, (2016)

Cited by1EIBibtex

Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification.

Divesh Aggarwal, Kaave Hosseini,Shachar Lovett

Electronic Colloquium on Computational Complexity (ECCC), (2016): 2913-2917

Cited by7EIBibtex

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

Daniel Dadush, Shashwat Garg,Shachar Lovett,Aleksandar Nikolov

international workshop and international workshop on approximation, randomization, and combinatorial..., (2016): 12

Bibtex

On the Beck-Fiala Conjecture for Random Set Systems

Esther Ezra,Shachar Lovett

APPROX-RANDOM, pp.29:1-29:10, (2016)

Cited by5EIBibtex

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

Abhishek Bhowmick,Shachar Lovett

Electronic Colloquium on Computational Complexity, (2015)

Cited by16EIBibtex

A Tail Bound for Read-k Families of Functions

Dmitry Gavinsky,Shachar Lovett,Michael E. Saks,Srikanth Srinivasan

Random Structures and Algorithms, no. 1 (2015)

Cited by17EIBibtex

An exposition of Sanders quasi-polynomial Freiman-Ruzsa theorem.

Shachar Lovett

Theory of Computing, Graduate Surveys, (2015): 1-14

Cited by15EIBibtex

The List Decoding Radius of Reed-Muller Codes over Small Fields

Abhishek Bhowmick,Shachar Lovett

ACM Symposium on Theory of Computing, no. 6 (2015)

Cited by16EIBibtex

Large Supports are Required for Well-Supported Nash Equilibria

Yogesh Anbalagan,Hao Huang,Shachar Lovett,Sergey Norin,Adrian Vetta,Hehui Wu

international workshop and international workshop on approximation randomization and combinatorial o..., (2015): 78-84

Cited by6EIBibtex

On the structure of the spectrum of small sets

Kaave Hosseini,Shachar Lovett

Journal of Combinatorial Theory, Series A, (2015)

Cited by1EIBibtex

Cooperative weakest link games.

Yoram Bachrach,Omer Lev,Shachar Lovett,Jeffrey S. Rosenschein,Morteza Zadimoghaddam

AAMAS, pp.589-596, (2014)

Cited by10EIBibtex

Group representations that resist random sampling.

Shachar Lovett,Cristopher Moore,Alexander Russell

Random Struct. Algorithms, no. 3 (2014)

Cited by1EIBibtex

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

Russell Impagliazzo,Shachar Lovett,Ramamohan Paturi,Stefan Schneider

Electronic Colloquium on Computational Complexity (ECCC), (2014)

Cited by31EIBibtex

An Additive Combinatorics Approach Relating Rank to Communication Complexity

Eli Ben-Sasson,Shachar Lovett,Noga Ron-Zewi

J. ACM, no. 4 (2014)

Cited by23EIBibtex

An Improved Lower Bound for Arithmetic Regularity

Kaave Hosseini,Shachar Lovett,Guy Moshkovitz,Asaf Shapira

(2014)

Cited by2Bibtex

Nontrivial t-designs over finite fields exist for all t.

Arman Fazeli,Shachar Lovett,Alexander Vardy

J. Comb. Theory, Ser. A, (2014): 149-160

Cited by20EIBibtex

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

Dmitry Gavinsky,Shachar Lovett

ICALP, (2014): 514-524

Cited by18EIBibtex

The Freiman-Ruzsa theorem over finite fields.

Chaim Even-Zohar,Shachar Lovett

J. Comb. Theory, Ser. A, (2014): 333-341

Cited by6EIBibtex

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

Hamed Hatami,Shachar Lovett

Clinical Orthopaedics and Related Research, (2014)

Cited by5EIBibtex

Variety Evasive Sets

Zeev Dvir,János Kollár,Shachar Lovett

Computational Complexity, no. 4 (2014): 509-529

Cited by5EIBibtex

Linear codes cannot approximate the network capacity within any constant factor.

Shachar Lovett

Electronic Colloquium on Computational Complexity (ECCC), (2014)

Cited by5EIBibtex

Recent Advances on the Log-Rank Conjecture in Communication Complexity.

Shachar Lovett

Bulletin of The European Association for Theoretical Computer Science, no. 112 (2014)

Cited by11EIBibtex

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

Shachar Lovett,Partha Mukhopadhyay,Amir Shpilka

Foundations of Computer Science, no. 4 (2013): 695-704

Cited by8EIWOSBibtex

New bounds for matching vector families

Abhishek Bhowmick 0001,Zeev Dvir,Shachar Lovett

SIAM J. Comput., no. 5 (2013): 823-832

Cited by22EIBibtex

A Space Lower Bound for Dynamic Approximate Membership Data Structures.

Shachar Lovett,Ely Porat

SIAM J. Comput., no. 6 (2013): 2182-2196

Cited by12EIBibtex

Additive Combinatorics and its Applications in Theoretical Computer Science (draft)

Shachar Lovett

(2013)

Cited by3Bibtex

Estimating the Distance from Testable Affine-Invariant Properties

Hamed Hatami,Shachar Lovett

Electronic Colloquium on Computational Complexity (ECCC), (2013): 237-242

Cited by16EIWOSBibtex

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

Tali Kaufman,Shachar Lovett,Ely Porat

I4CS, no. 5 (2012): 2689-2696

Cited by42EIBibtex

New Lower Bounds for Matching Vector Codes

Abhishek Bhowmick,Zeev Dvir,Shachar Lovett

Electronic Colloquium on Computational Complexity (ECCC), (2012)

Cited by18EIBibtex

Constructive Discrepancy Minimization by Walking on the Edges

Shachar Lovett,Raghu Meka

foundations of computer science, no. 5 (2012): 61-67

Cited by90EIWOSBibtex

Probabilistic existence of rigid combinatorial structures

Greg Kuperberg,Shachar Lovett,Ron Peled

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing, pp.1091-1106, (2012)

Cited by16EIBibtex

Bounded-Depth Circuits Cannot Sample Good Codes

Shachar Lovett,Emanuele Viola

Computational Complexity - Selected papers from the 26th Annual IEEE Conference on Computational Com..., no. 2 (2012): 243-251

Cited by23EIWOSBibtex

Pseudorandom Generators for Read-Once ACC^0

Dmitry Gavinsky,Shachar Lovett,Srikanth Srinivasan

IEEE Conference on Computational Complexity, pp.287-297, (2012)

Cited by2EIBibtex

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

Chris Beck,Russell Impagliazzo,Shachar Lovett

Foundations of Computer Science, (2012): 101-110

Cited by10EIWOSBibtex

The Freiman-Ruzsa Theorem in Finite Fields.

Chaim Even-Zohar,Shachar Lovett

Electronic Colloquium on Computational Complexity (ECCC), (2012)

Cited by4EIBibtex

Every locally characterized affine-invariant property is testable

Arnab Bhattacharyya,Eldar Fischer,Hamed Hatami,Pooya Hatami,Shachar Lovett

Electronic Colloquium on Computational Complexity (ECCC), (2012)

Cited by44EIBibtex

Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem.

Zohar Shay Karnin,Edo Liberty,Shachar Lovett,Roy Schwartz, Omri Weinstein

COLT, pp.2.1-2.17, (2012)

Cited by14EIBibtex

Subspace evasive sets

Zeev Dvir,Shachar Lovett

STOC, (2012): 351-358

Cited by47EIBibtex

Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions

Noga Alon,Shachar Lovett

APPROX-RANDOM, (2011): 350-361

Cited by11EIBibtex

Correlation bounds for poly-size AC 0 circuits with n 1-o(1) symmetric gates

Shachar Lovett,Srikanth Srinivasan

(2011)

Cited by1Bibtex

On the Furthest Hyperplane Problem and Maximal Margin Clustering

Zohar S Karnin,Edo Liberty,Shachar Lovett, Roy Schwartz,Omri Weinstein

(2011)

Cited by1Bibtex

Correlation testing for affine invariant properties on F p n in the high error regime

Hamed Hatami,Shachar Lovett

symposium on the theory of computing, (2011)

Cited by12Bibtex

Higher-Order Fourier Analysis Of ${\mathbb{F}_{p}^n}$ And The Complexity Of Systems Of Linear Forms

Hamed Hatami,Shachar Lovett

Geometric and Functional Analysis, no. 6 (2011): 1331-1357

Cited by14Bibtex

Computing Polynomials with Few Multiplications.

Shachar Lovett

Theory of Computing, no. 1 (2011): 185-188

Cited by5EIBibtex

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

Hamed Hatami,Shachar Lovett

STOC, (2011): 187-194

Cited by14EIBibtex

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

Eli Ben-Sasson,Shachar Lovett,Noga Zewi

Electronic Colloquium on Computational Complexity (ECCC), (2011)

Cited by5EIBibtex

Correlation bounds for poly-size AC0 circuits with n1-o(1) symmetric gates

Shachar Lovett,Srikanth Srinivasan

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference..., pp.640-651, (2011)

Cited by10EIBibtex

Linear Systems over Finite Abelian Groups

Arkadev Chattopadhyay,Shachar Lovett

IEEE Conference on Computational Complexity, pp.300-308, (2011)

Cited by5EIWOSBibtex

Random low-degree polynomials are hard to approximate

Ido Ben-Eliezer,Rani Hod,Shachar Lovett

Computational Complexity, no. 1 (2011): 63-81

Cited by11EIBibtex

Linear systems over abelian groups

Arkadev Chattopadhyay,Shachar Lovett

Electronic Colloquium on Computational Complexity (ECCC), (2011)

EIBibtex

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

Shachar Lovett,Srikanth Srinivasan

APPROX-RANDOM, pp.640-651, (2011)

Cited by11EIBibtex

Correlation testing for affine invariant properties on F

Hamed Hatami,Shachar Lovett

Electronic Colloquium on Computational Complexity, (2011)

Bibtex

Inverse Conjecture for the Gowers norm is false

Shachar Lovett,Roy Meshulam,Alex Samorodnitsky

Electronic Colloquium on Computational Complexity, no. 1 (2011): 131-145

Cited by60EIBibtex

On the Furthest Hyperplane Problem and Maximal Margin Clustering

Edo Liberty,Shachar Lovett,Omri Weinstein

CoRR, (2011)

EIBibtex

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

Shachar Lovett,Partha Mukhopadhyay,Amir Shpilka

Electronic Colloquium on Computational Complexity, no. 4 (2010): 33-725

Bibtex

A Lower Bound for Dynamic Approximate Membership Data Structures

Shachar Lovett,Ely Porat

Foundations of Computer Science, (2010): 797-804

Cited by15EIWOSBibtex

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

Hamed Hatami,Shachar Lovett

Electronic Colloquium on Computational Complexity (ECCC), (2010)

Cited by14EIBibtex

Equivalence of polynomial conjectures in additive combinatorics

Shachar Lovett

Electronic Colloquium on Computational Complexity, no. 5 (2010): 607-618

Cited by15EIBibtex

View All

Base Info Papers Patents Projects