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

"Bring Your Own Greedy"+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack., , and . AISTATS, volume 108 of Proceedings of Machine Learning Research, page 3263-3274. PMLR, (2020)Approximating Cumulative Pebbling Cost is Unique Games Hard., , and . CoRR, (2019)Differentially Private Aggregation via Imperfect Shuffling., , , , and . ITC, volume 267 of LIPIcs, page 17:1-17:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On the Security of Proofs of Sequential Work in a Post-Quantum World., , and . ITC, volume 199 of LIPIcs, page 22:1-22:27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Separations for Estimating Large Frequency Moments on Data Streams., and . ICALP, volume 198 of LIPIcs, page 112:1-112:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Adversarially Robust Submodular Maximization under Knapsack Constraints., , , and . KDD, page 148-156. ACM, (2019)The White-Box Adversarial Data Stream Model., , , , , , and . PODS, page 15-27. ACM, (2022)Truly Perfect Samplers for Data Streams and Sliding Windows., , and . PODS, page 29-40. ACM, (2022)Non-adaptive adaptive sampling on turnstile streams., , , and . STOC, page 1251-1264. ACM, (2020)Learning-Augmented $k$-means Clustering., , , , and . ICLR, OpenReview.net, (2022)