I agree that this site is using cookies. You can find further informations here.
X
Servedio, Rocco
239  results:
Search for persons X
?
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
Link: https://dl.acm.org/doi/1..
 
?
2

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

Saha, Barna ; Servedio, Rocco A. , 2023
Link: https://dl.acm.org/doi/1..
 
?
3

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/..
 
?
4

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/..
 
?
5

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/..
 
?
6

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/..
 
?
7

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..
 
?
8

Fooling Polytopes:

O'Donnell, Ryan ; Servedio, Rocco A. ; Tan, Li-Yang
Journal of the ACM.  69 (2022)  2 - p. 1-37 , 2022
Link: https://doi.org/10.1145/..
 
?
9

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

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Chen, Xi ; De, Anindya ; Lee, Chin Ho.. - p. 54-73 , 2021
Link: https://dl.acm.org/doi/1..
 
?
10

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

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Chen, Xi ; De, Anindya ; Lee, Chin Ho.. - p. 54-73 , 2021
Link: https://doi.org/10.1137/..
 
?
11

A lower bound on cycle-finding in sparse digraphs:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Chen, Xi ; Randolph, Tim ; Servedio, Rocco A.. - p. 2936-2952 , 2020
Link: https://dl.acm.org/doi/1..
 
?
12

Fooling Gaussian PTFs via local hyperconcentration:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
O'Donnell, Ryan ; Servedio, Rocco A. ; Tan, Li-Yang - p. 1170-1183 , 2020
Link: https://dl.acm.org/doi/1..
 
?
13

Learning from satisfying assignments under continuous distr..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Canonne, Clément L. ; De, Anindya ; Servedio, Rocco A. - p. 82-101 , 2020
Link: https://dl.acm.org/doi/1..
 
?
14

Testing noisy linear functions for sparsity:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
Chen, Xue ; De, Anindya ; Servedio, Rocco A. - p. 610-623 , 2020
Link: https://dl.acm.org/doi/1..
 
?
15

Fooling polytopes:

, In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing,
O'Donnell, Ryan ; Servedio, Rocco A. ; Tan, Li-Yang - p. 614-625 , 2019
Link: https://dl.acm.org/doi/1..
 
1-15