Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms

Gabriel Moruz, Andrei Negoescu. Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms. In Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg, editors, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I. Volume 7965 of Lecture Notes in Computer Science, pages 757-768, Springer, 2013. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.