Free Access
Volume 6, Number R3, 1972
Page(s) 23 - 68
Published online 01 February 2017
  1. R. C. BOSE and R. J. NELSON, A sorting problem, J. ACM, 1962, 9, 282-296. [MR: 145695] [Zbl: 0105.32405] [Google Scholar]
  2. W. H. BURGE, Sorting, trees and measures of order. Informat Contr., 1958, 1, 181-197. [MR: 96558] [Zbl: 0085.34301] [Google Scholar]
  3. L. CARROLL, Lawn tennis tournaments. (From The Complete Works of Lewis Carroll) 1883, N. Y. Modem Library, 1947 édition. [Google Scholar]
  4. Y. CESARI, Questionnaire, codage et tris. Thèse, Faculté des Sciences de Paris, 1967. [Google Scholar]
  5. H. A. DAVID, Tournaments and paired comparisons. Biometrika, 1959, 46, 139-149. [MR: 102445] [Zbl: 0087.14901] [Google Scholar]
  6. H. A. DAVID, The Method of Paired Comparisons, 1963, Hofner Pub. Co., New York. [MR: 174105] [Zbl: 0665.62075] [Google Scholar]
  7. F. DUBAIL, Algorithmes de questionnaires réalisables, optimaux au sens de différents critères. Thèse, Univ. de Lyon, 1967. [Google Scholar]
  8. L. R. Jr FORD and S. M. JOHNSON, A tournament problem. Amer. Math. Monthly, 1959, 66, 387-389. [MR: 103159] [Zbl: 0092.01303] [Google Scholar]
  9. W. A. GLENN, A comparison of the effectiveness of tournaments. Biometrika, 1960, 47, 253-262. [MR: 121927] [Zbl: 0094.15302] [Google Scholar]
  10. A. HADIAN, Optimality properties of various procedures for ranking n different numbers using only binary comparisons. Technical Report n°. 117, Departement of Statistics, Univ. of Minnesota, 1969. [Google Scholar]
  11. T. N. HIBBARD, Some combinatorial properties of certain trees with application to searching and sorting. J. ACM, 1962, 9, 13-28. [MR: 152155] [Zbl: 0116.09410] [Google Scholar]
  12. D. A. HUFFMAN, A method for the Construction of Minimum redundancy codes. Proc. IRE, 1952, 9, 1098-1101. [Zbl: 0137.13605] [Google Scholar]
  13. K. E. IVERSON, A Programming Language. John Wiley and Sons, Inc., New York, 1962. [MR: 143354] [Zbl: 0101.34503] [Google Scholar]
  14. S. S. KISLITSYNE, On a bound for the smallest average number of pairwise comparisons necessary for a complete ordering of N objects with different weights (Russian). Vestnik Leningrad Univ. (Series on Math., Mech. and Astron.) 1962, 18, n°. 1, 162-163. [Google Scholar]
  15. S. S. KISLITSYNE, A sharpening of the bound on the smallest average number of comparisons necessary for the complete ordering of a finite set (Russian). Vestnik Leningrad Univ. (Series on Math., Mech. and Astron.), 1963, 19, n° 4, 143-145 (MR 28, n°. 41). [Google Scholar]
  16. R. J. MAURICE, Selection of the population with the largest mean when comparisons can be made only in pairs. Biometrika, 1958, 45, 581-586. [Zbl: 0085.13701] [Google Scholar]
  17. C. PICARD, Théorie des Questionnaires. Gauthier-Villars, Paris, 1965 (MR 33, n° 7186). Voir aussi : Graphes et Questionnaires, Gauthier-Villars, Paris, 1972. [MR: 199036] [Zbl: 0128.39002] [Google Scholar]
  18. M. SANDELIUS, On an Optimal Search Procedure. Amer. Math. Monthly, 1961, 68, 133-134. [MR: 127425] [Zbl: 0111.33403] [Google Scholar]
  19. J. SCHREIER, On tournament elimination systems (Polish). Mathesis Polska, 1932, 7, 154-160. [JFM: 58.1016.01] [Google Scholar]
  20. J. SLUPECKI, On the system S of tournaments. Colloq. Math., 1949-51, 2, 286-290. [EuDML: 209970] [Zbl: 0045.15204] [Google Scholar]
  21. M. SOBEL, Optimal Group-testing. Proceeedings of the Colloquium held in Debrecen on Information Theory 1967publiées par l'académie des Sciences de Hongrie, 441-448. [Zbl: 0206.20401] [Google Scholar]
  22. M. SOBEL and P. A. GROLL, Group-testing to eliminate efficiently all defectives in a binomial sample. Bell Syst. Techn. J., 1959, 38, 1179-1252. [MR: 107341] [Google Scholar]
  23. H. STEINHAUS, Mathematical Snapshots, 1950 and 1960, Oxford Univ. Press, New York (see pp. 37-40 in the 1950 edition). [MR: 36005] [Zbl: 0041.27502] [Google Scholar]
  24. H. STEINHAUS, One Hundred Problems in Elementary Mathematics, 1958. (See Problems 52 and 85 in the 1963 edition, Pergamon Press, London.) [MR: 90552] [Zbl: 0116.24102] [Google Scholar]
  25. H. STEINHAUS, Some remarks about tournaments. Calcutta Math. Soc. Golden Jubilee Comm., 1959, Vol. Part II, 323-327 (MR 27, n°. 4770). [MR: 154826] [Zbl: 0121.15402] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.

Recommended for you