scientific article; zbMATH DE number 4009819

zbMATH Open0622.68043MaRDI QIDQ3759940FDOQ3759940

Authors:

Publication date: 1986

Title of this publication is not available (Why is that?)

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

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)

Cited In (7)

• On Thurston’s core entropy algorithm
• Tight bounds for online stable sorting
• Title not available (Why is that?)
• The design of divide and conquer algorithms
• Partial Solution and Entropy
• Entropy conservation for comparison-based algorithms
• Optimal decompositions with respect to entropy and symmetries

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)