Author of the publication

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

Improved Approximation Algorithms for Projection Games - (Extended Abstract)., and . ESA, volume 8125 of Lecture Notes in Computer Science, page 683-694. Springer, (2013)Inapproximability of Maximum Biclique Problems, Minimum $k$-Cut and Densest At-Least-$k$-Subgraph from the Small Set Expansion Hypothesis.. CoRR, (2017)A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs., and . CoRR, (2016)When Do Envy-Free Allocations Exist?, and . AAAI, page 2109-2116. AAAI Press, (2019)Private Aggregation from Fewer Anonymous Messages., , , and . CoRR, (2019)Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut., and . APPROX-RANDOM, volume 116 of LIPIcs, page 20:1-20:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Tight Running Time Lower Bounds for Strong Inapproximability of Maximum k-Coverage, Unique Set Cover and Related Problems (via t-Wise Agreement Testing Theorem).. CoRR, (2019)From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More., , , , , , and . FOCS, page 743-754. IEEE Computer Society, (2017)Multitasking Capacity: Hardness Results and Improved Constructions., , , , , , , and . SIAM J. Discret. Math., 34 (1): 885-903 (2020)On Distributed Differential Privacy and Counting Distinct Elements., , , and . CoRR, (2020)