Amortized efficiency of list update and paging rules
Communications of the ACM
Amortized analyses of self-organizing sequential search heuristics
Communications of the ACM - Lecture notes in computer science Vol. 174
ACM Computing Surveys (CSUR)
A locally adaptive data compression scheme
Communications of the ACM
Text compression
Two results on the list update problem
Information Processing Letters
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
A lower bound for randomized list update algorithms
Information Processing Letters
Improved randomized on-line algorithms for the list update problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Splay trees for data compression
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast linear expected-time alogorithms for computing maxima and convex hulls
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Simulations of dynamic sequential search algorithms
Communications of the ACM
On self-organizing sequential search heuristics
Communications of the ACM
Competitive solutions for online financial problems
ACM Computing Surveys (CSUR)
Two New Families of List Update Algorithms
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
DCC '00 Proceedings of the Conference on Data Compression
An asymptotic optimality of the transposition rule for linear lists
ACM SIGMETRICS Performance Evaluation Review
Introduction to the SIGACT news online algorithms column
ACM SIGACT News
On Developing New Models, with Paging as a Case Study
ACM SIGACT News
Experimental studies of graph traversal algorithms
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Closing the gap between theory and practice: new measures for on-line algorithm analysis
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
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
Parameterized analysis of paging and list update algorithms
WAOA'09 Proceedings of the 7th 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
Paging and list update under bijective analysis
Journal of the ACM (JACM)
| Hi-index | 0.00 |