Author of the publication

On Noise-Tolerant Learning of Sparse Parities and Related Problems.

, , and . ALT, volume 6925 of Lecture Notes in Computer Science, page 413-424. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Statistical Algorithms and a Lower Bound for Detecting Planted Cliques., , , , and . J. ACM, 64 (2): 8:1-8:37 (2017)Structural Results on Matching Estimation with Applications to Streaming., , , , , , and . Algorithmica, 81 (1): 367-392 (2019)Relaxed Locally Correctable Codes in Computationally Bounded Channels., , , and . IEEE Trans. Inf. Theory, 67 (7): 4338-4360 (2021)How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity., , , and . CoRR, (2022)Nearly Optimal Sparse Group Testing., , , and . IEEE Trans. Inf. Theory, 65 (5): 2760-2773 (2019)Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance., , and . CoRR, (2020)Flipping Out with Many Flips: Hardness of Testing k-Monotonicity., , and . SIAM J. Discret. Math., 33 (4): 2111-2125 (2019)NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem., , and . SIAM J. Comput., 47 (4): 1547-1584 (2018)Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions., , , , , and . FOCS, page 739-750. IEEE, (2021)Hardness of Maximum Likelihood Learning of DPPs., , , and . COLT, volume 178 of Proceedings of Machine Learning Research, page 3800-3819. PMLR, (2022)