Unbounded lower bound for k-server against weak adversaries
From MaRDI portal
Publication:5145001
DOI10.1145/3357713.3384306MaRDI QIDQ5145001
Jaroslaw Byrka, Łukasz Jeż, Marcin Bienkowski, Christian Coester
Publication date: 19 January 2021
Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.01592
68Qxx: Theory of computing