Publications

Competitive Algorithms for Generalized k-Server in Uniform Metrics
N. Bansal, M. Elias, G. Koumoutsos, J. Nederlof.
To appear in SODA 2018.

Nested Convex Bodies are Chaseable
N. Bansal, M. Bohm, M. Elias, G. Koumoutsos, S. Umboh.
To appear in SODA 2018.

Weighted k-Server Bounds via Combinatorial Dichotomies
N. Bansal, M. Elias, G. Koumoutsos.
FOCS 2017.

The (h,k)-Server Problem on Bounded Depth Trees
N. Bansal, M. Elias, L. Jez, G. Koumoutsos.
SODA 2017.

Tight Bounds for Double Coverage against Weak Adversaries.
N. Bansal, M. Elias, L. Jez, G. Koumoutsos, K. Pruhs.
WAOA 2015.

Theses

Online Algorithms with Advice for the Binary Search Tree Problem.
Master's Thesis -- Master Parisien de Recherche en Informatique (MPRI), 2013.
Supervisor: Adi Rosen

[ Google Scholar | DBLP ]