A new lower bound for the list update problem in the partial cost model
Theoretical Computer Science
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
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
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On using conditional rotations and randomized heuristics for self-organizing ternary search tries
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying
Information Processing Letters
ACM Transactions on Software Engineering and Methodology (TOSEM)
Query Responsive Index Structures
GIScience '08 Proceedings of the 5th international conference on Geographic Information Science
The Journal of Machine Learning Research
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
SIAM Journal on Computing
Efficient adaptive data compression using fano binary search trees
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Optimal strategies for the list update problem under the MRM alternative cost model
Information Processing Letters
How to splay for loglogn-competitiveness
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Access graphs results for LRU versus FIFO under relative worst order analysis
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Optimal lower bounds for projective list update algorithms
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |