Sledovat
Grigorios Koumoutsos
Grigorios Koumoutsos
Postdoctoral Researcher, Université libre de Bruxelles
E-mailová adresa ověřena na: ulb.ac.be - Domovská stránka
Název
Citace
Citace
Rok
Nested convex bodies are chaseable
N Bansa, M Böhm, M Eliáš, G Koumoutsos, SW Umboh
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
412018
Competitive online search trees on trees
P Bose, J Cardinal, J Iacono, G Koumoutsos, S Langerman
ACM Transactions on Algorithms 19 (3), 1-19, 2023
272023
Competitive Algorithms for Generalized k-Server in Uniform Metrics
N Bansa, M Eliáš, G Koumoutsos, J Nederlof
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
242018
Weighted k-server bounds via combinatorial dichotomies
N Bansal, M Eliáš, G Koumoutsos
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
222017
The (h,k)-Server Problem on Bounded Depth Trees
N Bansal, M Eliéš, Ł Jeż, G Koumoutsos
ACM Transactions on Algorithms (TALG) 15 (2), 1-26, 2019
172019
Dynamic geometric independent set
S Bhore, J Cardinal, J Iacono, G Koumoutsos
arXiv preprint arXiv:2007.08643, 2020
152020
Tight bounds for double coverage against weak adversaries
N Bansal, M Eliáš, Ł Jeż, G Koumoutsos, K Pruhs
Theory of Computing Systems 62, 349-365, 2018
122018
The online min-sum set cover problem
D Fotakis, L Kavouras, G Koumoutsos, S Skoulakis, M Vardas
arXiv preprint arXiv:2003.02161, 2020
112020
Worst-case efficient dynamic geometric independent set
J Cardinal, J Iacono, G Koumoutsos
arXiv preprint arXiv:2108.08050, 2021
92021
Belga B-trees
ED Demaine, J Iacono, G Koumoutsos, S Langerman
Theory of Computing Systems 65, 541-558, 2021
32021
Sublinear explicit incremental planar voronoi diagrams
E Arseneva, J Iacono, G Koumoutsos, S Langerman, B Zolotov
Journal of Information Processing 28, 766-774, 2020
32020
Memoryless algorithms for the generalized k-server problem on uniform metrics
D Christou, D Fotakis, G Koumoutsos
International Workshop on Approximation and Online Algorithms, 143-158, 2020
22020
Online algorithms with advice for the binary search tree problem
G Koumoutsos
Master’s thesis, LIAFA, 2013
22013
External memory planar point location with fast updates
J Iacono, B Karsin, G Koumoutsos
arXiv preprint arXiv:1905.02620, 2019
12019
Algorithms for k-server problems
G Koumoutsos
12018
Sublinear Explicit Incremental Planar Voro Sublinear Explicit Incremental Planar Voronoi Diagrams noi Diagrams
E Arseneva, J Iacono, G Koumoutsos, S Langerman, B Zolotov
arXiv. org, 2020
2020
New Bounds for the (h,k)-Server Problem.
N Bansal, M Eliás, L Jez, G Koumoutsos
CoRR, 2016
2016
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–17