팔로우
Shachar Lovett
Shachar Lovett
Associate Professor of Computer Science, University of California San Diego
eng.ucsd.edu의 이메일 확인됨 - 홈페이지
제목
인용
인용
연도
On cryptography with auxiliary input
Y Dodis, YT Kalai, S Lovett
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
2482009
Non-malleable codes from additive combinatorics
D Aggarwal, Y Dodis, S Lovett
SIAM Journal on Computing 47 (2), 524-546, 2018
1542018
Constructive discrepancy minimization by walking on the edges
S Lovett, R Meka
SIAM Journal on Computing 44 (5), 1573-1582, 2015
1432015
Unconditional pseudorandom generators for low degree polynomials
S Lovett
Proceedings of the fortieth annual ACM symposium on Theory of computing, 557-562, 2008
862008
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
732008
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
682008
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
662021
Rectangles are nonnegative juntas
M Goos, S Lovett, R Meka, T Watson, D Zuckerman
SIAM Journal on Computing 45 (5), 1835-1869, 2016
632016
Subspace evasive sets
Z Dvir, S Lovett
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
622012
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
612015
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
612012
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
602020
Algebraic attacks against random local functions and their countermeasures
B Applebaum, S Lovett
SIAM Journal on Computing 47 (1), 52-79, 2018
602018
Communication is bounded by root of rank
S Lovett
Journal of the ACM (JACM) 63 (1), 1-9, 2016
552016
Structure of protocols for XOR functions
H Hatami, K Hosseini, S Lovett
SIAM Journal on Computing 47 (1), 208-217, 2018
522018
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
512017
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
502013
Pseudorandom generators from polarizing random walks
E Chattopadhyay, P Hatami, K Hosseini, S Lovett
Theory of Computing 15 (1), 1-26, 2019
462019
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
442018
0-1 integer linear programming with a linear number of constraints
R Impagliazzo, S Lovett, R Paturi, S Schneider
arXiv preprint arXiv:1401.5512, 2014
432014
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20