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

DOI10.1051/M2AN/197206R300231zbMATH Open0277.05007OpenAlexW2587117788MaRDI QIDQ4401949FDOQ4401949

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

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

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)