Author of the publication

Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems.

, , , and . ICALP, volume 229 of LIPIcs, page 7:1-7:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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

A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs., and . CoRR, (2016)Inapproximability of Maximum Biclique Problems, Minimum $k$-Cut and Densest At-Least-$k$-Subgraph from the Small Set Expansion Hypothesis.. CoRR, (2017)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)Multitasking Capacity: Hardness Results and Improved Constructions., , , , , , , and . SIAM J. Discret. Math., 34 (1): 885-903 (2020)Optimal Unbiased Randomizers for Regression with Label Differential Privacy., , , , , , , and . CoRR, (2023)On Maximum Bipartite Matching with Separation., , and . CoRR, (2023)Summary Reports Optimization in the Privacy Sandbox Attribution Reporting API., , , , , , and . CoRR, (2023)Connect the Dots: Tighter Discrete Approximations of Privacy Loss Distributions., , , , and . CoRR, (2022)On Distributed Differential Privacy and Counting Distinct Elements., , , and . CoRR, (2020)