The (H, k)-server problem on bounded depth trees

Nikhil Bansal, Marek Eliáš, Łukasz Jeż, Grigorios Koumoutsos

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)

Fingerprint Dive into the research topics of 'The (H, k)-server problem on bounded depth trees'. Together they form a unique fingerprint.

Mathematics