E-LIB Suche - Ergebnisse für: Servedio, Rocco

1

Detecting Low-Degree Truncation:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,

De, Anindya ; Li, Huan ; Nadimpalli, Shivam. - p. 1027-1038 , 2024

2

Testing Intersecting and Union-Closed Families:

Chen, Xi ; De, Anindya ; Li, Yuhao..
Is Part Of LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). , 2024

Link: https://doi.org/10.4230/..

3

Testing Sumsets is Hard:

Chen, Xi ; Nadimpalli, Shivam ; Randolph, Tim..
http://arxiv.org/abs/2401.07242. , 2024

Link: http://arxiv.org/abs/240..

4

Explicit orthogonal and unitary designs:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),

O'Donnell, Ryan ; Servedio, Rocco A. ; Paredes, Pedro - p. 1240-1260 , 2023

Link: https://doi.org/10.1109/..

5

Proceedings of the 55th Annual ACM Symposium on Theory of C..:

Saha, Barna ; Servedio, Rocco A. , 2023

Link: https://dl.acm.org/doi/1..

6

Mildly Exponential Lower Bounds on Tolerant Testers for Mon..:

Chen, Xi ; De, Anindya ; Li, Yuhao..
http://arxiv.org/abs/2309.12513. , 2023

Link: http://arxiv.org/abs/230..

7

Subset Sum in Time $2^{n/2} / poly(n)$:

Chen, Xi ; Jin, Yaonan ; Randolph, Tim.
http://arxiv.org/abs/2301.07134. , 2023

Link: http://arxiv.org/abs/230..

8

Testing Convex Truncation:

De, Anindya ; Nadimpalli, Shivam ; Servedio, Rocco A
http://arxiv.org/abs/2305.03146. , 2023

Link: http://arxiv.org/abs/230..

9

Explicit orthogonal and unitary designs:

O'Donnell, Ryan ; Servedio, Rocco A ; Paredes, Pedro
http://arxiv.org/abs/2310.13597. , 2023

Link: http://arxiv.org/abs/231..

10

Gaussian Approximation of Convex Sets by Intersections of H..:

De, Anindya ; Nadimpalli, Shivam ; Servedio, Rocco A
http://arxiv.org/abs/2311.08575. , 2023

Link: http://arxiv.org/abs/231..

11

Testing Intersecting and Union-Closed Families:

Chen, Xi ; De, Anindya ; Li, Yuhao..
http://arxiv.org/abs/2311.11119. , 2023

Link: http://arxiv.org/abs/231..

12

Quantitative correlation inequalities via extremal power se..:

De, Anindya ; Nadimpalli, Shivam ; Servedio, Rocco A.
Probability Theory and Related Fields. 183 (2022) 1-2 - p. 649-675 , 2022

Link: https://doi.org/10.1007/..

13

Polynomial-time trace reconstruction in the smoothed comple..:

Chen, Xi ; De, Anindya ; Lee, Chin Ho..
ACM Transactions on Algorithms. , 2022

Link: https://doi.org/10.1145/..

14

A Lower Bound on Cycle-Finding in Sparse Digraphs:

Chen, Xi ; Randolph, Tim ; Servedio, Rocco A..
ACM Transactions on Algorithms. 18 (2022) 4 - p. 1-23 , 2022

Link: https://doi.org/10.1145/..

15

Fooling Polytopes:

O'Donnell, Ryan ; Servedio, Rocco A. ; Tan, Li-Yang
ACM Journal of the ACM (JACM). 69 (2022) 2 - p. 1-37 , 2022

Link: https://dl.acm.org/doi/1..