Author of the publication

A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs.

, , , , , and . APPROX-RANDOM, volume 40 of LIPIcs, page 96-109. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)

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 General Framework for Handling Commitment in Online Throughput Maximization., , , , and . IPCO, volume 11480 of Lecture Notes in Computer Science, page 141-154. Springer, (2019)A general framework for handling commitment in online throughput maximization., , , , and . CoRR, (2018)An Approximation Algorithm for Fully Planar Edge-Disjoint Paths., , , , and . SIAM J. Discret. Math., 35 (2): 752-769 (2021)Prophet Inequalities for Independent Random Variables from an Unknown Distribution., , , and . CoRR, (2018)The Itinerant List Update Problem., , , , and . WAOA, volume 11312 of Lecture Notes in Computer Science, page 310-326. Springer, (2018)An O(log m)-Competitive Algorithm for Online Machine Minimization., , and . SODA, page 155-163. SIAM, (2016)Quickly Determining Who Won an Election., , and . ITCS, volume 287 of LIPIcs, page 61:1-61:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Contract Design for Pandora's Box., , and . CoRR, (2024)Online search for a hyperplane in high-dimensional Euclidean space., , , and . Inf. Process. Lett., (2022)An O(m^2 log m)-Competitive Algorithm for Online Machine Minimization., , and . CoRR, (2015)