A Tournament Problem

DOI10.2307/2308750MaRDI QIDQ5895867zbMATH OpenOpenAlexFDO

Authors L. R. jun. Ford, S. M. Johnson

Publication date 1959

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2308750

zbMATH Keywords

combinatorics

Cited in

(22)

• Significant improvements to the Ford-Johnson algorithm for sorting
• Merging of 4 or 5 elements with n elements
• Time bounds for selection
• Two entropies of a generalized sorting problem
• Posets with seven linear extensions sortable by three comparisons
• On partial sorting in restricted rounds
• QuickXsort: a fast sorting scheme in theory and practice
• On constant factors in comparison-based geometric algorithms and data structures
• Maximal k-decomposible sets of permutations of degree n
• An experiment in optimal sorting
• An efficient algorithm for determining the convex hull of a finite planar set
• On the upper bound of the complexity of sorting
• A survey on priority queues
• Path Problems in Complex Networks
• Finding an unknown acyclic orientation of a given graph
• Procédures optimales pour le classement des $t$ meilleurs articles parmi $n$ au moyen de comparaisons binaires
• scientific article; zbMATH DE number 7359768 (Why is no real title available?)
• On the average case of MergeInsertion
• Small Complexity Gaps for Comparison-Based Sorting
• String problems in the congested clique model
• The Ford-Johnson algorithm still unbeaten for less than 47 elements
• A variant of the Ford-Johnson algorithm that is more space efficient

This page was built for publication: A Tournament Problem

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