Shachar Lovett
Shachar Lovett
Associate Professor of Computer Science, University of California San Diego
Verified email at eng.ucsd.edu - Homepage
Title
Cited by
Cited by
Year
On cryptography with auxiliary input
Y Dodis, YT Kalai, S Lovett
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
2212009
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
1342014
Constructive discrepancy minimization by walking on the edges
S Lovett, R Meka
SIAM Journal on Computing 44 (5), 1573-1582, 2015
1002015
Rectangles are nonnegative juntas
M Goos, S Lovett, R Meka, T Watson, D Zuckerman
SIAM Journal on Computing 45 (5), 1835-1869, 2016
892016
Unconditional pseudorandom generators for low degree polynomials
S Lovett
Proceedings of the fortieth annual ACM symposium on Theory of computing, 557-562, 2008
762008
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
682008
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
582008
Subspace evasive sets
Z Dvir, S Lovett
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
502012
Algebraic attacks against random local functions and their countermeasures
B Applebaum, S Lovett
SIAM Journal on Computing 47 (1), 52-79, 2018
442018
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
442013
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
442012
Communication is bounded by root of rank
S Lovett
Journal of the ACM (JACM) 63 (1), 1-9, 2016
412016
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
392014
Structure of protocols for XOR functions
H Hatami, K Hosseini, S Lovett
SIAM Journal on Computing 47 (1), 208-217, 2018
352018
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
Bounded-depth circuits cannot sample good codes
S Lovett, E Viola
2011 IEEE 26th Annual Conference on Computational Complexity, 243-251, 2011
302011
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
292017
Testing low complexity affine-invariant properties
A Bhattacharyya, E Fischer, S Lovett
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
262013
Pseudorandom bit generators that fool modular sums
S Lovett, O Reingold, L Trevisan, S Vadhan
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009
262009
Nontrivial t-designs over finite fields exist for all t
A Fazeli, S Lovett, A Vardy
Journal of Combinatorial Theory, Series A 127, 149-160, 2014
252014
The system can't perform the operation now. Try again later.
Articles 1–20