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

Brief announcement: online batch scheduling for flow objectives., and . SPAA, page 102-104. ACM, (2013)Competitively scheduling tasks with intermediate parallelizability., , , and . SPAA, page 22-29. ACM, (2014)Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints., , and . J. ACM, 65 (1): 3:1-3:33 (2018)Fast Noise Removal for k-Means Clustering., , , , and . AISTATS, volume 108 of Proceedings of Machine Learning Research, page 456-466. PMLR, (2020)Unconditional Coresets for Regularized Loss Minimization., , , , and . AISTATS, volume 108 of Proceedings of Machine Learning Research, page 482-492. PMLR, (2020)Min-Max Submodular Ranking for Multiple Agents., , , , and . AAAI, page 7061-7068. AAAI Press, (2023)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)A tutorial on amortized local competitiveness in online scheduling, , and . SIGACT News, 42 (2): 83--97 (June 2011)Fast and Parallelizable Ranking with Outliers from Pairwise Comparisons., and . ECML/PKDD (1), volume 11906 of Lecture Notes in Computer Science, page 173-188. Springer, (2019)Competitive Analysis of Constrained Queueing Systems., , and . ICALP, volume 55 of LIPIcs, page 143:1-143:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)