scientific article; zbMATH DE number 4114045

MaRDI QIDQ4729372zbMATH OpenFDO

Authors

Publication date 1986

zbMATH Keywords

optimum sorting and merging by comparisons

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Recommendations

• Optimal merging of sorted data under the mean absolute error criterion
• Strategies for stable merge sorting
• Time-space optimal parallel merging and sorting
• scientific article; zbMATH DE number 4001497
• Nearly-optimal mergesorts: fast, practical sorting methods that optimally adapt to existing runs
• Parallel algorithms for merging and sorting
• An optimal parallel algorithm for merging using multiselection
• ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES
• Optimal incremental sorting

Cited in

(5)

• Sorting by Merging or Merging by Sorting?
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Significant improvements to the Ford-Johnson algorithm for sorting
• Optimal merging of sorted data under the mean absolute error criterion
• Efficient unbalanced merge-sort

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 Q4729372)