A strongly competitive randomized paging algorithm

Cited by (233)

Items 201–233 of 233

1. Settling the Randomized k-sever Conjecture on Some Special Metrics
   Wenbin Chen · 2014 · arXiv (Cornell University)
2. Engineering Efficient Paging Algorithms
   Gabriel Moruz, Andrei Negoescu, Christian Neumann, Volker Weichert · 2012 · Lecture notes in computer science
3. On Multi-threaded Metrical Task Systems
   Esteban Feuerstein, Steven S. Seiden, Alejandro Strejilevich de Loma · 2006 · Journal of Discrete Algorithms
4. Optimal Randomized Scheduling by Replacement
   Isaac Saias · 1998 · Journal of Combinatorial Optimization
5. Randomized on-line scheduling of parallel jobs
   Jiřı́ Sgall · 2002 · Israel Symposium on Theory and Computing Systems (ISTCS)
6. Analysis of simple randomized buffer management for parallel I/O
   Mahesh Kallahalla, Peter Varman · 2004 · Information Processing Letters
7. A Study of Integrated Document and Connection Caching in the WWW
   Susanne Albers, Rob van Stee · 2007 · Algorithmica
8. Variations on the Theme of Caching
   Cristian Gaşpar · 2005 · UWSpace (University of Waterloo)
9. Application-Controlled Paging for a Shared Cache (extended abstract)
   Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter · 1995
10. Paging more than one page
    Esteban Feuerstein · 1995 · Lecture notes in computer science
11. Online algorithms for combinatorial problems Ph.D. Thesis
    Judit Nagy-György · 2009
12. On-Line caching tis Cache
    Neal E. Young · 1991
13. An O(log k log^2 n)-competitive Randomized Algorithm for the k-Sever Problem
    Wenbin Chen · 2015 · arXiv (Cornell University)
14. Optimization Problems in High-Speed Networks
    Serge A. Plotkin · 2002
15. SIGACT News Online Algorithms Column 29
    Rob van Stee · 2016 · ACM SIGACT News
16. On-line algorithms and fast digital identity revocation
    Sachin Lodha, Endre Szemerédi · 2002
17. Analysis of Power-Down Systems with Five States
    Govind Pathak · 2020 · Digital Scholarship - UNLV (University of Nevada Reno)
18. O problema de minimização de trocas de ferramentas
    Andreza Cristina Beezão Moreira · 2017
19. A primal–dual online algorithm for the k-server problem on weighted HSTs
    Wenbin Chen, Fufang Li, Jianxiong Wang, Ke Qi, Maobin Tang, Xiuni Wang · 2017 · Journal of Combinatorial Optimization
20. Various Approaches to the Stochastic K-Server and Stacker-Crane Problems
    Alexander Daniel Friedman · 2017 · VTechWorks (Virginia Tech)
21. Approximation Algorithms for Covering Problems
    Christos Koufogiannakis · 2009 · eScholarship (California Digital Library)
22. Online Tree Caching
    Marcin Bieńkowski, Jan Marcinkowski, Maciej Pacut, Stefan Schmid, Spyra, Aleksandra, Tang, Bolong · 2016 · arXiv (Cornell University)
23. Online Balanced Repartitioning
    Chen Avin, Andreas Loukas, Maciej Pacut, Stefan Schmid · 2015 · arXiv (Cornell University)
24. Scheduling in Lagern
    Wilhelm Dangelmaier · 2021 · VDI-Buch
25. Randomized Parallel Prefetching and Buffer Management
    Mahesh Kallahalla, Peter Varman · 1999 · Combinatorial optimization
26. General Bibliography
    Vangélis Th. Paschos · 2014 · Wiley eBooks
27. Board of Editors
    Mahesh Kallahalla, Peter Varman · 2004 · Information Processing Letters
28. Resource Planning
    Wilhelm Dangelmaier · 2021 · VDI-Buch
29. Production Planning
    Nadia Brauner, Gerd Finke, Maurice Queyranne · 2013 · Wiley eBooks
30. Online Paging and Caching
    Neal E. Young · 2015 · Encyclopedia of Algorithms
31. Algorithms for network resource allocation under adversarial dynamics and assignment constraints
    Mehraneh Liaee · 2022
32. Tight Latency Guarantees for Weighted Caching with Delayed Hits
    Tomer Tsachor, Joseph Seffi Naor · 2026 · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
33. Models for Parallel Computation in Multi-Core, Heterogeneous, and Ultra Wide-Word Architectures
    Alejandro Salinger · 2013 · UWSpace (University of Waterloo)