Procédures optimales pour le classement des t meilleurs articles parmi n au moyen de comparaisons binaires

DOI10.1051/M2AN/197206R300231MaRDI QIDQ4401949zbMATH OpenOpenAlexFDO

Authors Milton Sobel

Publication date 1973

Published in Revue française d'automatique informatique recherche opérationnelle. Mathématique (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/193220

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15)

Cites work

• scientific article; zbMATH DE number 3165828 (Why is no real title available?)
• scientific article; zbMATH DE number 41025 (Why is no real title available?)
• scientific article; zbMATH DE number 3209689 (Why is no real title available?)
• scientific article; zbMATH DE number 3327924 (Why is no real title available?)
• scientific article; zbMATH DE number 3189338 (Why is no real title available?)
• scientific article; zbMATH DE number 3195869 (Why is no real title available?)
• scientific article; zbMATH DE number 3062551 (Why is no real title available?)
• A Method for the Construction of Minimum-Redundancy Codes
• A Sorting Problem
• A Tournament Problem
• A comparison of the effectiveness of tournaments
• On an Optimal Search Procedure
• On the systems of tournaments
• Selection of the population with the largest mean when comparisons can be made only in pairs
• Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
• Sorting, trees, and measures of order
• TOURNAMENTS AND PAIRED COMPARISONS

Describes a project that uses

Uses Software

• APL

This page was built for publication: Procédures optimales pour le classement des $t$ meilleurs articles parmi $n$ au moyen de comparaisons binaires

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