( en | de | ru )

 

Disambiguation of "Koumoutsos, Grigorios"

Author of the publication

copydeleteadd this publication to your clipboard
Nested Convex Bodies are Chaseable.

, , , , and . CoRR, (2017)

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.

Grigorios Daskos

Grigorios Lazarakos

Grigorios Antoniadis

Grigorios Kolios

Grigorios Loukides

 

Other publications of authors with the same name

The (h, k)-Server Problem on Bounded Depth Trees., , , and . SODA, page 1022-1037. SIAM, (2017)Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics., , and . WAOA, volume 12806 of Lecture Notes in Computer Science, page 143-158. Springer, (2020)Belga B-Trees., , , and . CSR, volume 11532 of Lecture Notes in Computer Science, page 93-105. Springer, (2019)Worst-Case Efficient Dynamic Geometric Independent Set., , and . ESA, volume 204 of LIPIcs, page 25:1-25:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Competitive Algorithms for Generalized k-Server in Uniform Metrics., , , and . SODA, page 992-1001. SIAM, (2018)Tight Bounds for Double Coverage Against Weak Adversaries., , , , and . Theory Comput. Syst., 62 (2): 349-365 (2018)Tight Bounds for Double Coverage Against Weak Adversaries., , , , and . WAOA, volume 9499 of Lecture Notes in Computer Science, page 47-58. Springer, (2015)The Online Min-Sum Set Cover Problem., , , , and . ICALP, volume 168 of LIPIcs, page 51:1-51:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Competitive Online Search Trees on Trees., , , , and . SODA, page 1878-1891. SIAM, (2020)Weighted k-Server Bounds via Combinatorial Dichotomies., , and . FOCS, page 493-504. IEEE Computer Society, (2017)