Static optimality and dynamic search-optimality in lists and trees
From MaRDI portal
Publication:1400896
DOI10.1007/s00453-003-1015-8zbMath1045.68045OpenAlexW3137830407MaRDI QIDQ1400896
Shuchi Chawla, Avrim L. Blum, Adam Tauman Kalai
Publication date: 17 August 2003
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-003-1015-8
Related Items (7)
A study on splay trees ⋮ Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees ⋮ The cost of offline binary search tree algorithms and the complexity of the request sequence ⋮ Unified Algorithms for Online Learning and Competitive Analysis ⋮ Multi-Finger Binary Search Trees ⋮ In Pursuit of the Dynamic Optimality Conjecture ⋮ Efficient algorithms for online decision problems
This page was built for publication: Static optimality and dynamic search-optimality in lists and trees
