Static optimality and dynamic search-optimality in lists and trees

DOI10.1007/S00453-003-1015-8MaRDI QIDQ1400896zbMATH OpenOpenAlexFDO

Authors Shuchi Chawla, Avrim 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

zbMATH Keywords

Adaptive data structuresBinary search treesCompetitive AnalysisExperts Analysis

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 2119638
• Dynamic Optimality—Almost
• scientific article; zbMATH DE number 5237331
• A new path from Splay to dynamic optimality
• In pursuit of the dynamic optimality conjecture

Cited in

(14)

• Analyzing self-adjusting linear list algorithms with deletions and unsuccessful searches
• On the performance of learned data structures
• 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
• Efficient algorithms for online decision problems
• Unified algorithms for online learning and competitive analysis
• In pursuit of the dynamic optimality conjecture
• scientific article; zbMATH DE number 2119638 (Why is no real title available?)
• Multi-Finger Binary Search Trees
• On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations
• scientific article; zbMATH DE number 5237331 (Why is no real title available?)
• Dynamic Optimality—Almost
• The online min-sum set cover problem

This page was built for publication: Static optimality and dynamic search-optimality in lists and trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400896)