A Tournament Problem

DOI10.2307/2308750zbMath0092.01303OpenAlexW4252207957MaRDI QIDQ5895867

Selmer Johnson, L. R. Ford, Jr.

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

Related Items (22)

The Ford-Johnson algorithm still unbeaten for less than 47 elements ⋮ A variant of the Ford-Johnson algorithm that is more space efficient ⋮ Path Problems in Complex Networks ⋮ On the upper bound of the complexity of sorting ⋮ Time bounds for selection ⋮ Two entropies of a generalized sorting problem ⋮ Unnamed Item ⋮ Small Complexity Gaps for Comparison-Based Sorting ⋮ Posets with seven linear extensions sortable by three comparisons ⋮ Merging of 4 or 5 elements with n elements ⋮ 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 ⋮ On partial sorting in restricted rounds ⋮ On the average case of MergeInsertion ⋮ QuickXsort: a fast sorting scheme in theory and practice ⋮ Improved average complexity for comparison-based sorting ⋮ 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 ⋮ A Survey on Priority Queues ⋮ Significant improvements to the Ford-Johnson algorithm for sorting ⋮ On constant factors in comparison-based geometric algorithms and data structures

This page was built for publication: A Tournament Problem