Articles with public access mandates - Shachar LovettLearn more
Not available anywhere: 1
Sparse MDS matrices over small fields: a proof of the GM-MDS conjecture
S Lovett
SIAM Journal on Computing 50 (4), 1248-1262, 2021
Mandates: US National Science Foundation
Available somewhere: 50
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
Mandates: US National Science Foundation
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
Mandates: US National Science Foundation, European Commission
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
Mandates: US National Science Foundation, Netherlands Organisation for Scientific …
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
Mandates: US National Science Foundation
Rectangles are nonnegative juntas
M Goos, S Lovett, R Meka, T Watson, D Zuckerman
SIAM Journal on Computing 45 (5), 1835-1869, 2016
Mandates: US National Science Foundation
Structure of protocols for XOR functions
H Hatami, K Hosseini, S Lovett
SIAM Journal on Computing 47 (1), 208-217, 2018
Mandates: US National Science Foundation, Natural Sciences and Engineering Research …
Pseudorandom generators from polarizing random walks
E Chattopadhyay, P Hatami, K Hosseini, S Lovett
Theory of Computing 15 (1), 1-26, 2019
Mandates: US National Science Foundation
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
Mandates: Fonds de recherche du Québec - Santé
Communication is bounded by root of rank
S Lovett
Journal of the ACM (JACM) 63 (1), 1-9, 2016
Mandates: US National Science Foundation
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
Mandates: US National Science Foundation
Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates
E Chattopadhyay, P Hatami, S Lovett, A Tal
10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2018
Mandates: US National Science Foundation
MDS matrices over small fields: A proof of the GM-MDS conjecture
S Lovett
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
Mandates: US National Science Foundation
On the Beck‐Fiala conjecture for random set systems
E Ezra, S Lovett
Random Structures & Algorithms 54 (4), 665-675, 2019
Mandates: US National Science Foundation
Lifting with sunflowers
S Lovett, R Meka, I Mertz, T Pitassi, J Zhang
Leibniz international proceedings in informatics 215, 2022
Mandates: US National Science Foundation, Natural Sciences and Engineering Research …
Noise-tolerant, reliable active classification with comparison queries
M Hopkins, D Kane, S Lovett, G Mahajan
Conference on Learning Theory, 1957-2006, 2020
Mandates: US National Science Foundation
Log-rank and lifting for AND-functions
A Knop, S Lovett, S McGuire, W Yuan
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
Mandates: US National Science Foundation
High dimensional expanders: Eigenstripping, pseudorandomness, and unique games
M Bafna, M Hopkins, T Kaufman, S Lovett
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
Mandates: US National Science Foundation
The power of comparisons for actively learning linear classifiers
M Hopkins, D Kane, S Lovett
Advances in Neural Information Processing Systems 33, 6342-6353, 2020
Mandates: US National Science Foundation
Equality alone does not simulate randomness
A Chattopadhyay, S Lovett, M Vinyals
34th Computational Complexity Conference (CCC 2019), 2019
Mandates: US National Science Foundation
Publication and funding information is determined automatically by a computer program