On cryptography with auxiliary input Y Dodis, YT Kalai, S Lovett Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 268 | 2009 |
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 | 217 | 2021 |
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 | 182 | 2014 |
Constructive discrepancy minimization by walking on the edges S Lovett, R Meka SIAM Journal on Computing 44 (5), 1573-1582, 2015 | 177 | 2015 |
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 | 115 | 2020 |
Unconditional pseudorandom generators for low degree polynomials S Lovett Proceedings of the fortieth annual ACM symposium on Theory of computing, 557-562, 2008 | 94 | 2008 |
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 | 86 | 2012 |
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 | 81 | 2016 |
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 | 81 | 2008 |
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 | 76 | 2018 |
Subspace evasive sets Z Dvir, S Lovett Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 75 | 2012 |
Rectangles are nonnegative juntas M Goos, S Lovett, R Meka, T Watson, D Zuckerman SIAM Journal on Computing 45 (5), 1835-1869, 2016 | 73 | 2016 |
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 | 72 | 2017 |
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 | 71 | 2008 |
Structure of protocols for XOR functions H Hatami, K Hosseini, S Lovett SIAM Journal on Computing 47 (1), 208-217, 2018 | 65 | 2018 |
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 | 64 | 2015 |
Pseudorandom generators from polarizing random walks E Chattopadhyay, P Hatami, K Hosseini, S Lovett Theory of Computing 15 (1), 1-26, 2019 | 60 | 2019 |
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 | 54 | 2013 |
The analytic rank of tensors and its applications S Lovett arXiv preprint arXiv:1806.09179, 2018 | 51 | 2018 |
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 | 48 | 2014 |