%0 Journal Article %1 journals/talg/BansalEJK19 %A Bansal, Nikhil %A Eliás, Marek %A Jez, Lukasz %A Koumoutsos, Grigorios %D 2019 %J ACM Trans. Algorithms %K dblp %N 2 %P 28:1-28:26 %T The (h, k)-Server Problem on Bounded Depth Trees. %U http://dblp.uni-trier.de/db/journals/talg/talg15.html#BansalEJK19 %V 15

@article{journals/talg/BansalEJK19, added-at = {2023-09-30T00:00:00.000+0200}, author = {Bansal, Nikhil and Eliás, Marek and Jez, Lukasz and Koumoutsos, Grigorios}, biburl = {https://www.bibsonomy.org/bibtex/251742c77cc0199801baf1cf0c8ad1727/dblp}, ee = {https://doi.org/10.1145/3301314}, interhash = {0b78bd910816c4758e7664d17f4e5e30}, intrahash = {51742c77cc0199801baf1cf0c8ad1727}, journal = {ACM Trans. Algorithms}, keywords = {dblp}, number = 2, pages = {28:1-28:26}, timestamp = {2024-04-08T15:04:57.000+0200}, title = {The (h, k)-Server Problem on Bounded Depth Trees.}, url = {http://dblp.uni-trier.de/db/journals/talg/talg15.html#BansalEJK19}, volume = 15, year = 2019 }