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

DOI10.1051/m2an/197206R300231zbMath0277.05007OpenAlexW2587117788MaRDI QIDQ4401949

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

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

Uses Software

• APL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Selection of the population with the largest mean when comparisons can be made only in pairs
• Sorting, trees, and measures of order
• TOURNAMENTS AND PAIRED COMPARISONS
• A comparison of the effectiveness of tournaments
• A Sorting Problem
• On an Optimal Search Procedure
• A Method for the Construction of Minimum-Redundancy Codes
• Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
• On the systems of tournaments
• A Tournament Problem

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