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

Private Aggregation from Fewer Anonymous Messages., , , and . CoRR, (2019)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)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)Multitasking Capacity: Hardness Results and Improved Constructions., , , , , , , and . SIAM J. Discret. Math., 34 (1): 885-903 (2020)On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results., and . Electron. Colloquium Comput. Complex., (2024)On Distributed Differential Privacy and Counting Distinct Elements., , , and . ITCS, volume 185 of LIPIcs, page 56:1-56:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs., and . ITCS, volume 287 of LIPIcs, page 71:1-71:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Improved Approximation Algorithms for Projection Games - (Extended Abstract)., and . ESA, volume 8125 of Lecture Notes in Computer Science, page 683-694. Springer, (2013)Near-tight closure b ounds for the Littlestone and threshold dimensions., , , and . ALT, volume 132 of Proceedings of Machine Learning Research, page 686-696. PMLR, (2021)