scientific article; zbMATH DE number 4009819

MaRDI QIDQ3759940zbMATH OpenFDO

Authors

Publication date 1986

zbMATH Keywords

measurementbinary classificationdivide-and-conqueralgorithm designsearchingsorting multisetsmultiple selectionprinciple of maximum entropy reduction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Measures of information, entropy (94A17) Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 3930881
• The insights of algorithmic entropy
• On Thurston’s core entropy algorithm
• On Entropic Convergence of Algorithms
• Entropy conservation for comparison-based algorithms
• On the optimal entropy analysis
• Minimal Entropy Approximations and Optimal Algorithms
• Models and algorithms of the entropy programming

Cited in

(7)

• Optimal decompositions with respect to entropy and symmetries
• scientific article; zbMATH DE number 2106832 (Why is no real title available?)
• Tight bounds for online stable sorting
• Partial Solution and Entropy
• On Thurston’s core entropy algorithm
• Entropy conservation for comparison-based algorithms
• The design of divide and conquer algorithms

This page was built for publication:

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