Online and Offline Access to Short Lists

DOI10.1007/978-3-540-74456-6_61MaRDI QIDQ3525612zbMATH OpenOpenAlexFDO

Authors Torben Hagerup

Publication date 17 September 2008

Published in Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74456-6_61

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• Short lists with short programs in short time
• Short lists for shortest descriptions in short time
• scientific article; zbMATH DE number 1670645
• Portable list ranking
• Searching and storing similar lists
• Off-line algorithms for the list update problem
• Publication:4886029

Cited in

(9)

• Off-line algorithms for the list update problem
• The itinerant list update problem
• Paid exchanges are worth the price
• scientific article; zbMATH DE number 1670645 (Why is no real title available?)
• A Survey of Algorithms and Models for List Update
• Paid exchanges are worth the price
• Optimal strategies for the list update problem under the MRM alternative cost model
• Competitive Algorithms for Relaxed List Update and Multilevel Caching
• On the competitive theory and practice of online list accessing algorithms

This page was built for publication: Online and Offline Access to Short Lists

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