Near-entropy hotlink assignments

DOI10.1007/S00453-008-9259-YMaRDI QIDQ5961968zbMATH OpenOpenAlexFDO

Authors Karim Douïeb, Stefan Langerman

Publication date 16 September 2010

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-008-9259-y

zbMATH Keywords

entropy lower boundhotlink assignmentweb algorithms

Mathematics Subject Classification ID

Internet topics (68M11) Nonnumerical algorithms (68W05) Online algorithms; streaming algorithms (68W27)

Recommendations

• Near-Entropy Hotlink Assignments
• Approximate hotlink assignment
• scientific article; zbMATH DE number 2081037
• Algorithms and Data Structures
• Dynamic hotlinks

Cites work

• A data structure for dynamic trees
• Algorithms and Computation
• Algorithms and Computation
• Algorithms and Data Structures
• Asymmetric communication protocols via hotlink assignments
• Biased Search Trees
• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 140487 (Why is no real title available?)
• scientific article; zbMATH DE number 1962821 (Why is no real title available?)
• scientific article; zbMATH DE number 2044936 (Why is no real title available?)
• scientific article; zbMATH DE number 2080232 (Why is no real title available?)
• scientific article; zbMATH DE number 2081037 (Why is no real title available?)
• scientific article; zbMATH DE number 2226804 (Why is no real title available?)
• Introduction to algorithms
• Self-adjusting binary search trees
• Towards adaptive Web sites: Conceptual framework and case study

Cited in

(5)

• Approximate hotlink assignment
• Dynamic hotlinks
• scientific article; zbMATH DE number 2081037 (Why is no real title available?)
• Algorithms and Data Structures
• Near-Entropy Hotlink Assignments

This page was built for publication: Near-entropy hotlink assignments

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