A Sorting Problem

DOI10.1145/321119.321126MaRDI QIDQ3290937zbMATH OpenOpenAlexFDO

Authors 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

Cited in

(7)

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

This page was built for publication: A Sorting Problem

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