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

A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints., , , and . APPROX-RANDOM, volume 60 of LIPIcs, page 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Differentially Private Set Union., , , , , and . ICML, volume 119 of Proceedings of Machine Learning Research, page 3627-3636. PMLR, (2020)SelfishMigrate: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors., , , and . FOCS, page 531-540. IEEE Computer Society, (2014)Algorithms for Cost-Aware Scheduling., and . WAOA, volume 7846 of Lecture Notes in Computer Science, page 201-214. Springer, (2012)Non-clairvoyantly Scheduling to Minimize Convex Functions., , , and . Algorithmica, 81 (9): 3746-3764 (2019)A Unified Rounding Algorithm For Unrelated Machines Scheduling Problems., and . SPAA, page 283-290. ACM, (2018)On the Hardness of Scheduling With Non-Uniform Communication Delays., , , , , and . SODA, page 316-328. SIAM, (2022)An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs., and . SODA, page 2509-2521. SIAM, (2020)Fast and Memory Efficient Differentially Private-SGD via JL Projections., , , , , and . NeurIPS, page 19680-19691. (2021)Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints., , and . J. ACM, 65 (1): 3:1-3:33 (2018)