Shachar Lovett
Shachar Lovett
Associate Professor of Computer Science, University of California San Diego
Dirección de correo verificada de eng.ucsd.edu - Página principal
Título
Citado por
Citado por
Año
On cryptography with auxiliary input
Y Dodis, YT Kalai, S Lovett
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
2352009
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
1412014
Constructive discrepancy minimization by walking on the edges
S Lovett, R Meka
SIAM Journal on Computing 44 (5), 1573-1582, 2015
1122015
Rectangles are nonnegative juntas
M Goos, S Lovett, R Meka, T Watson, D Zuckerman
SIAM Journal on Computing 45 (5), 1835-1869, 2016
1012016
Unconditional pseudorandom generators for low degree polynomials
S Lovett
Proceedings of the fortieth annual ACM symposium on Theory of computing, 557-562, 2008
812008
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
692008
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
602008
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
522012
Subspace evasive sets
Z Dvir, S Lovett
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
512012
Algebraic attacks against random local functions and their countermeasures
B Applebaum, S Lovett
SIAM Journal on Computing 47 (1), 52-79, 2018
492018
Communication is bounded by root of rank
S Lovett
Journal of the ACM (JACM) 63 (1), 1-9, 2016
482016
Structure of protocols for XOR functions
H Hatami, K Hosseini, S Lovett
SIAM Journal on Computing 47 (1), 208-217, 2018
452018
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
452013
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
432017
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
402014
A tail bound for read‐k families of functions
D Gavinsky, S Lovett, M Saks, S Srinivasan
Random Structures & Algorithms 47 (1), 99-108, 2015
322015
Bounded-depth circuits cannot sample good codes
S Lovett, E Viola
2011 IEEE 26th Annual Conference on Computational Complexity, 243-251, 2011
322011
Pseudorandom generators from polarizing random walks
E Chattopadhyay, P Hatami, K Hosseini, S Lovett
Theory of Computing 15 (1), 1-26, 2019
312019
Near-optimal linear decision trees for k-SUM and related problems
DM Kane, S Lovett, S Moran
Journal of the ACM (JACM) 66 (3), 1-18, 2019
312019
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
312018
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20