Author of the publication

Two-Sided Kirszbraun Theorem.

, , , and . SoCG, volume 189 of LIPIcs, page 13:1-13:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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

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