« Back to Record
Citation APA

Bansal, N., Eliáš, M., Jez, L., & Koumoutsos, G. (2019). The (H, k)-server problem on bounded depth trees. ACM transactions on algorithms, 15(2), a28. doi:10.1145/3301314


Permalink

http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/287233

Bansal, N., Eliáš, M., Jez, L., & Koumoutsos, G. (2019). The (H, k)-server problem on bounded depth trees. ACM transactions on algorithms, 15(2), a28. doi:10.1145/3301314