Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I > Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms
Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I |
Fedor V. Fomin; Rusins Freivalds; Marta Kwiatkowska; David Peleg
Springer Berlin Heidelberg
Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I
Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms
Authors

Gabriel Moruz; Andrei Negoescu

ARI Id

1664970205288_4281805

Access

Not Available Free

Pages

757-768

DOI

10.1007/978-3-642-39206-1_64

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-39206-1_64

Table of Contents of Book
Chapters/HeadingsAuthor(s)PagesInfo
Loading...
Chapters/HeadingsAuthor(s)PagesInfo
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings