( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem.

, , и . SIAM J. Comput., 47 (4): 1547-1584 (2018)

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.

Elena Grigorescu

Claudia Ines Elena de Theissen

Adrien Elena

Decebal Grigorescu

Eduard Grigorescu

 

Другие публикации лиц с тем же именем

On Noise-Tolerant Learning of Sparse Parities and Related Problems., , и . ALT, том 6925 из Lecture Notes in Computer Science, стр. 413-424. Springer, (2011)Statistical algorithms and a lower bound for detecting planted cliques., , , , и . STOC, стр. 655-664. ACM, (2013)How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity., , , и . APPROX/RANDOM, том 275 из LIPIcs, стр. 59:1-59:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Locally Decodable/Correctable Codes for Insertions and Deletions., , , , и . FSTTCS, том 182 из LIPIcs, стр. 16:1-16:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On computing Ollivier-Ricci curvatures of graphs: fine-grained reductions and local algorithms., , и . CoRR, (2022)Online Directed Spanners and Steiner Forests., , и . APPROX-RANDOM, том 207 из LIPIcs, стр. 5:1-5:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Relaxed Locally Correctable Codes in Computationally Bounded Channels., , , и . ISIT, стр. 2414-2418. IEEE, (2019)Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance., , и . CoRR, (2020)Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions., , , , , и . FOCS, стр. 739-750. IEEE, (2021)NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem., , и . SIAM J. Comput., 47 (4): 1547-1584 (2018)