External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Gabriel Moruz

This author has not been identified. Look up 'Gabriel Moruz' in Google

Andrei Negoescu

This author has not been identified. Look up 'Andrei Negoescu' in Google
runs on