Algorithm Theory - SWAT 2004
From MaRDI portal
Publication:5315405
DOI10.1007/b98413zbMath1095.68753MaRDI QIDQ5315405
Publication date: 7 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98413
Related Items
On the Relative Dominance of Paging Algorithms, Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis, A theoretical comparison of LRU and LRU-K, The off-line group seat reservation problem, The relative worst-order ratio applied to paging, Comparing first-fit and next-fit for online edge coloring, Scheduling jobs on grid processors, List factoring and relative worst order analysis, Separating online scheduling algorithms with the relative worst order ratio, Comparing online algorithms for bin packing problems, A new variable-sized bin packing problem, A Survey of Algorithms and Models for List Update