Competitive algorithms for multilevel caching and relaxed list update
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A new lower bound for the list update problem in the partial cost model
Theoretical Computer Science
Delayed information and action in on-line algorithms
Information and Computation
Static optimality and dynamic search-optimality in lists and trees
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On list update and work function algorithms
Theoretical Computer Science
Optimal Projective Algorithms for the List Update Problem
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
A Randomized Algorithm for Two Servers on the Line (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
On List Update and Work Function Algorithms
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Offline List Update is NP-Hard
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Splay trees, Davenport-Schinzel sequences, and the deque conjecture
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
List update with locality of reference
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
List factoring and relative worst order analysis
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
A new perspective on list update: probabilistic locality and working set
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Access graphs results for LRU versus FIFO under relative worst order analysis
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Online and offline access to short lists
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Optimal lower bounds for projective list update algorithms
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.89 |