More on Weighted Servers or FIFO is Better than LRU
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
More on randomized on-line algorithms for caching
Theoretical Computer Science
More on weighted servers or FIFO is better than LRU
Theoretical Computer Science
SIGACT news online algorithms column 2
ACM SIGACT News
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Improved space bounds for strongly competitive randomized paging algorithms
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.90 |