Folgen
Shachar Lovett
Shachar Lovett
Associate Professor of Computer Science, University of California San Diego
Bestätigte E-Mail-Adresse bei eng.ucsd.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
On cryptography with auxiliary input
Y Dodis, YT Kalai, S Lovett
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
2722009
Bilinear classes: A structural framework for provable generalization in rl
S Du, S Kakade, J Lee, S Lovett, G Mahajan, W Sun, R Wang
International Conference on Machine Learning, 2826-2836, 2021
2292021
Constructive discrepancy minimization by walking on the edges
S Lovett, R Meka
SIAM Journal on Computing 44 (5), 1573-1582, 2015
1872015
Non-malleable codes from additive combinatorics
D Aggarwal, Y Dodis, S Lovett
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
1842014
Improved bounds for the sunflower lemma
R Alweiss, S Lovett, K Wu, J Zhang
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
1182020
Unconditional pseudorandom generators for low degree polynomials
S Lovett
Proceedings of the fortieth annual ACM symposium on Theory of computing, 557-562, 2008
952008
Weight distribution and list-decoding size of reed–muller codes
T Kaufman, S Lovett, E Porat
IEEE transactions on information theory 58 (5), 2689-2696, 2012
872012
Algebraic attacks against random local functions and their countermeasures
B Applebaum, S Lovett
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
852016
Worst case to average case reductions for polynomials
T Kaufman, S Lovett
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 166-175, 2008
822008
Subspace evasive sets
Z Dvir, S Lovett
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
792012
The gram-schmidt walk: a cure for the banaszczyk blues
N Bansal, D Dadush, S Garg, S Lovett
Proceedings of the 50th annual acm sigact symposium on theory of computing …, 2018
782018
Active classification with comparison queries
DM Kane, S Lovett, S Moran, J Zhang
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
762017
Rectangles are nonnegative juntas
M Goos, S Lovett, R Meka, T Watson, D Zuckerman
SIAM Journal on Computing 45 (5), 1835-1869, 2016
742016
Inverse conjecture for the Gowers norm is false
S Lovett, R Meshulam, A Samorodnitsky
Proceedings of the fortieth annual ACM symposium on Theory of computing, 547-556, 2008
722008
Structure of protocols for XOR functions
H Hatami, K Hosseini, S Lovett
SIAM Journal on Computing 47 (1), 208-217, 2018
682018
Rectangles are nonnegative juntas
M Göös, S Lovett, R Meka, T Watson, D Zuckerman
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015
642015
Pseudorandom generators from polarizing random walks
E Chattopadhyay, P Hatami, K Hosseini, S Lovett
Theory of Computing 15 (1), 1-26, 2019
612019
Every locally characterized affine-invariant property is testable
A Bhattacharyya, E Fischer, H Hatami, P Hatami, S Lovett
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
552013
The analytic rank of tensors and its applications
S Lovett
arXiv preprint arXiv:1806.09179, 2018
512018
Communication is bounded by root of rank
S Lovett
Journal of the ACM (JACM) 63 (1), 1-9, 2016
502016
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20