( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Robust algorithms with polynomial loss for near-unanimity CSPs.

, , , , , и . SODA, стр. 340-357. SIAM, (2017)

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.

Ruslan Yuryev

Yury Postnikov

Yury Markovskiy

Yury Valdau

Yury Lebedev

 

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

How to Play Unique Games against a Semi-Random Adversary, , и . CoRR, (2011)Conditionally independent random variables, и . CoRR, (2005)How to Play Unique Games on Expanders., и . WAOA, том 6534 из Lecture Notes in Computer Science, стр. 190-200. Springer, (2010)Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering., , и . STOC, стр. 1027-1038. ACM, (2019)Approximation Algorithms for Norm Multiway Cut., , , , и . CoRR, (2023)Robust algorithms with polynomial loss for near-unanimity CSPs., , , , , и . SODA, стр. 340-357. SIAM, (2017)Two-Sided Kirszbraun Theorem., , , и . SoCG, том 189 из LIPIcs, стр. 13:1-13:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes., , и . COLT, том 178 из Proceedings of Machine Learning Research, стр. 3070-3093. PMLR, (2022)Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability., и . FOCS, стр. 255-264. IEEE Computer Society, (2010)Approximation Algorithms for Hypergraph Small-Set Expansion and Small-Set Vertex Expansion., и . Theory of Computing, 12 (1): 1-25 (2016)