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

An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization., and . COLT, volume 75 of Proceedings of Machine Learning Research, page 1307-1325. PMLR, (2018)Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs., , and . SODA, page 377-391. SIAM, (2016)Finding Four-Node Subgraphs in Triangle Time., , , and . SODA, page 1671-1680. SIAM, (2015)Scheduling with Communication Delay in Near-Linear Time., , , , and . STACS, volume 219 of LIPIcs, page 47:1-47:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search., and . NIPS, page 3094-3103. (2017)Efficient Rematerialization for Deep Networks., , , , and . NeurIPS, page 15146-15155. (2019)Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization., , and . NeurIPS, page 9617-9627. (2018)Margin-Independent Online Multiclass Learning via Convex Geometry., , , and . NeurIPS, page 29156-29167. (2021)Space-Efficient Randomized Algorithms for K-SUM.. ESA, volume 8737 of Lecture Notes in Computer Science, page 810-829. Springer, (2014)Cell-probe lower bounds from online communication complexity., , and . STOC, page 1003-1012. ACM, (2018)