I agree that this site is using cookies. You can find further informations here.
X
Lovett, Shachar
237  results:
Search for persons X
?
1

Explicit Separations between Randomized and Deterministic N..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Kelley, Zander ; Lovett, Shachar ; Meka, Raghu - p. 1299-1310 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

New Graph Decompositions and Combinatorial Boolean Matrix M..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Abboud, Amir ; Fischer, Nick ; Kelley, Zander.. - p. 935-943 , 2024
Link: https://dl.acm.org/doi/1..
 
?
3

Realizable Learning is All You Need:

Hopkins, Max ; Kane, Daniel M. ; Lovett, Shachar.
TheoretiCS.  3 (2024)  - p. , 2024
Link: https://doi.org/10.46298..
 
?
4

Bias vs Structure of Polynomials in Large Fields, and Appli..:

Bhowmick, Abhishek ; Lovett, Shachar
IEEE Transactions on Information Theory.  69 (2023)  2 - p. 963-977 , 2023
Link: https://doi.org/10.1109/..
 
?
5

Streaming Lower Bounds and Asymmetric Set-Disjointness:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
Lovett, Shachar ; Zhang, Jiapeng - p. 871-882 , 2023
Link: https://doi.org/10.1109/..
 
?
6

Hypercontractivity on high dimensional expanders:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Bafna, Mitali ; Hopkins, Max ; Kaufman, Tali. - p. 185-194 , 2022
Link: https://dl.acm.org/doi/1..
 
?
7

Proceedings of the 37th Computational Complexity Conference:

Lovett, Shachar , 2022
Link: https://dl.acm.org/doi/1..
 
?
8

Log-rank and lifting for AND-functions:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Knop, Alexander ; Lovett, Shachar ; McGuire, Sam. - p. 197-208 , 2021
Link: https://dl.acm.org/doi/1..
 
?
9

Sparse MDS Matrices over Small Fields: A Proof of the GM-MD..:

Lovett, Shachar
SIAM Journal on Computing.  50 (2021)  4 - p. 1248-1262 , 2021
Link: https://doi.org/10.1137/..
 
?
10

Decision List Compression by Mild Random Restrictions:

Lovett, Shachar ; Wu, Kewen ; Zhang, Jiapeng
Journal of the ACM (JACM).  68 (2021)  6 - p. 1-17 , 2021
Link: https://dl.acm.org/doi/1..
 
?
11

Fractional pseudorandom generators from any fourier level:

, In: Proceedings of the 36th Computational Complexity Conference,
Chattopadhyay, Eshan ; Gaitonde, Jason ; Lee, Chin Ho.. - p. 1 ff. , 2021
Link: https://dl.acm.org/doi/1..
 
?
12

Decision List Compression by Mild Random Restrictions:

Lovett, Shachar ; Wu, Kewen ; Zhang, Jiapeng
Journal of the ACM.  68 (2021)  6 - p. 1-17 , 2021
Link: https://doi.org/10.1145/..
 
?
13

XOR lemmas for resilient functions against polynomials:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
Chattopadhyay, Eshan ; Hatami, Pooya ; Hosseini, Kaave.. - p. 234-246 , 2020
Link: https://dl.acm.org/doi/1..
 
?
14

Probabilistic existence of large sets of designs:

Lovett, Shachar ; Karingula, Sankeerth Rao ; Vardy, Alexander
Journal of Combinatorial Theory, Series A.  176 (2020)  - p. 105286 , 2020
Link: https://doi.org/10.1016/..
 
?
15

Sign rank vs discrepancy:

, In: Proceedings of the 35th Computational Complexity Conference,
Hatami, Hamed ; Hosseini, Kaave ; Lovett, Shachar - p. 1-14 , 2020
Link: https://dl.acm.org/doi/1..
 
1-15