On the advice complexity of the \(k\)-server problem
From MaRDI portal
Publication:2396827
DOI10.1016/j.jcss.2017.01.001zbMath1370.68333MaRDI QIDQ2396827
Hans-Joachim Böckenhauer, Rastislav Královič, Richard Královič, Dennis Komm
Publication date: 26 May 2017
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2017.01.001
Related Items