A Sorting Problem

DOI10.1145/321119.321126zbMath0105.32405OpenAlexW2065074520MaRDI QIDQ3290937

R. C. Bose, R. J. Nelson

Publication date: 1962

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321119.321126

zbMATH Keywords

numerical analysis

Related Items (7)

Optimizing sorting algorithms by using sorting networks ⋮ A computer-assisted optimal depth lower bound for nine-input sorting networks ⋮ Sorting nine inputs requires twenty-five comparisons ⋮ Identities and periodic oscillations of divide-and-conquer recurrences splitting at half ⋮ Procédures optimales pour le classement des $t$ meilleurs articles parmi $n$ au moyen de comparaisons binaires ⋮ Single-exception sorting networks and the computational complexity of optimal sorting network verification ⋮ A phenomenon in the theory of sorting

This page was built for publication: A Sorting Problem