Near-entropy hotlink assignments

DOI10.1007/S00453-008-9259-YzbMATH Open1204.68274OpenAlexW2151960262MaRDI QIDQ5961968FDOQ5961968

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

Recommendations

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

zbMATH Keywords

entropy lower boundhotlink assignmentweb algorithms

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Introduction to algorithms
• A data structure for dynamic trees
• Self-adjusting binary search trees
• Title not available (Why is that?)
• Biased Search Trees
• Title not available (Why is that?)
• Towards adaptive Web sites: Conceptual framework and case study
• Title not available (Why is that?)
• Asymmetric communication protocols via hotlink assignments
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms and Computation
• Algorithms and Computation
• Title not available (Why is that?)
• Algorithms and Data Structures

Cited In (5)

• Title not available (Why is that?)
• Algorithms and Data Structures
• Approximate hotlink assignment
• Near-Entropy Hotlink Assignments
• Dynamic hotlinks

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)