Neal Young. The K-Server Dual and Loose Competitiveness for Paging. In Lyle A. McGeoch, Daniel Dominic Sleator, editors, On-Line Algorithms, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, February 11-13, 1991. Volume 7 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 77-78, DIMACS/AMS, 1991.
@inproceedings{Young91-2,
title = {The K-Server Dual and Loose Competitiveness for Paging},
author = {Neal Young},
year = {1991},
researchr = {https://researchr.org/publication/Young91-2},
cites = {0},
citedby = {0},
pages = {77-78},
booktitle = {On-Line Algorithms, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, February 11-13, 1991},
editor = {Lyle A. McGeoch and Daniel Dominic Sleator},
volume = {7},
series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
publisher = {DIMACS/AMS},
}