On partial sorting in restricted rounds

[1] M. Aigner, Selecting the top three elements, Discrete Appl. Math., 4 (1982) 242– 262. )1810.1016/0166-218X(82)90048-8Search in Google Scholar

[2] M. Aigner, The double selection problem, Discrete Math., 73 (1989) 3–12. )1810.1016/0012-365X(88)90128-8Search in Google Scholar

[3] M. Aigner, Finding the maximum and minimum, Discrete Appl. Math., 97 (1997) 1–12. )1810.1016/S0166-218X(96)00012-1Search in Google Scholar

[4] M. Ajtai, J. Komlos, E. Szemeredi, Sorting in O(log n) steps, Combinatorica, 3, 1 (1983) 1–19. )1910.1007/BF02579338Search in Google Scholar

[5] N. Alon, Y. Azar, U. Vishkin, Tight complexity bounds for parallel comparison sorting, IEEE Symp. Found. Comp. Sci., 27 (1986) 502–510. )1910.1109/SFCS.1986.57Search in Google Scholar

[6] M. Anholcer, V. Babiy, S. Bozóki, W. W. Koczkodaj, A simpliéd implementatio of the least squares solution for pairwise comparisons matrices. CEJOR Cent. Eur. J. Oper. Res. 19, 4 (2011) 439–444. )1810.1007/s10100-010-0134-ySearch in Google Scholar

[7] M. Ayala-Rincón, B. T. de Abreu, J. de Sequira, A variant of the Ford-Johnson algorithm that is more space efficient. Inf. Proc. Letters, 102, 5 (2007) 201–207.)1810.1016/j.ipl.2006.11.017Search in Google Scholar

[8] H. Aziz, M. Brill, F. Fischer, P. Harrenstein, J. Lang, H. G. Seedig, Possible and necessary winners of partial tournaments, in: V. Conitzer and M. Winiko_ (eds.), Proc. of 11th Int. Joint Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS), IFAAMAS, 2012. 8 pages. )19Search in Google Scholar

[9] L. B. Beasley, D. E. Brown, K. B. Reid, Extending partial tournaments, Math. Comput. Modelling 50, 1 (2009) 287–291. )1910.1016/j.mcm.2008.12.015Search in Google Scholar

[10] M. Blum, R. W. Floyd, W. Pratt, R. L. Rivest, R. E. Tarjan, Time bounds for selection, J. Computer System Sci., 7 (1973) 464–471. )1810.1016/S0022-0000(73)80033-9Search in Google Scholar

[11] B. Bollobás, A. Thomason, Parallel sorting, Discrete Appl. Math., 6, 1 (1983) 1–11 )1910.1016/0166-218X(83)90095-1Search in Google Scholar

[12] B. Bollobás, P. Hell, Sorting and graphs, in: Graphs and Order (ed. I. Rival), Reidel, Boston, 1985, pp.169–184. )1910.1007/978-94-009-5315-4_5Search in Google Scholar

[13] S. Bozóki, J. Fűlőp, A. Poesz, On pairwise comparison matrices that can be made consistent by the modification of a few elements, CEJOR Cent. Eur. J. Oper. Res. 19 (2011) 157–175. )1810.1007/s10100-010-0136-9Search in Google Scholar

[14] S. Bozóki, J. Fűlőp, L. Rónyai, On optimal completion of incomplete pairwise comparison matrices, Math. Comput. Modelling 52 (2010) 318–333. )1810.1016/j.mcm.2010.02.047Search in Google Scholar

[15] T. D. Bui, M. Thanh, Signi_cant improvements to the Ford-Johnson algorithm for sorting, BIT, 25 (1985) 70–75. )1810.1007/BF01934989Search in Google Scholar

[16] L. Carroll, Lawn tennis tournaments, St. James' Gazette, August 1, 1883, 5–6. Reprinted in The Complete Works of Lewis Carroll, Newyork Modern Library, 1947. )20, 22Search in Google Scholar

[17] T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithm (3rd edition), The MIT Press, 2009. )24Search in Google Scholar

[18] L. Csató, Ranking by pairwise comparisons for Swiss-system tournaments, Cent. Eur. J. Oper. Res., 21, 4 (2013) 783–803. )1810.1007/s10100-012-0261-8Search in Google Scholar

[19] L. Csató, On the ranking of a Swiss system, chess team tournament, Annals of Op. Res., 254, 1–2 (2017) 17–36. )18, 2110.1007/s10479-017-2440-4Search in Google Scholar

[20] W. Cunto, J. I. Munro, Average case selection, J. ACM, 36, 2 (1989) 270–279. )1810.1145/62044.62047Search in Google Scholar

[21] D. Dor, J. Hástad, S. Ulfberg, U. Zwick, On lower bounds for selecting the median, SIAM J. Discrete Math., 14, 3 (2001) 299–311. )1810.1137/S0895480196309481Search in Google Scholar

[22] D. Dor, U. Zwick, Selecting the median, SIAM J. Comp., 7, 5 (1999) 1722–1758. )1810.1137/S0097539795288611Search in Google Scholar

[23] A. E. Elo, The Rating of Chessplayers, Past and Present, Batsford, London, 1978. )23Search in Google Scholar

[24] J. Eusterbrock, Errata to "Selecting the top three elements" by M. Aigner, Dis- crete Appl. Math., 41 (1993) 131–137. )18 10.1016/0166-218X(93)90033-KSearch in Google Scholar

[25] FIDE, Handbook. 04. FIDE Swiss rules, 2013, http://www._de.com/component/handbook/?id=83&view=article, downloaded June 6, 2017. )21Search in Google Scholar

[26] FIDE, Basic rules for Swiss Systems, http://www._de.com/_de/handbook.html?id=83&view=article, downloaded June 6, 2017. )21Search in Google Scholar

[27] FIDE, Dutch System https://www._de.com/_de/handbook.html?id=167&view=article, downloaded June 6, 2017. )21Search in Google Scholar

[28] L. Ford, S. Johnson, A tournament problem, Amer. Math. Monthly 66 (1959) 387–389. )1810.1080/00029890.1959.11989306Search in Google Scholar

[29] L. Forlano, VEGA chess pairing software, User's manual http://www.vegachess.com/tl/tl_les/musicacademy/distrib/vegaen.pdf, downloaded June 6, 2017. )21Search in Google Scholar

[30] J. Griggs, K. B. Reid, Landau's theorem revisited, Australas. J. Comb. 20 (1999), 19–24. )18Search in Google Scholar

[31] E. Haág, Cs. Meleghegyi, A semifinal that decided nothing (Hungarian), Magyar Sakkélet 1972 (10), 190–191. )21Search in Google Scholar

[32] A. Hadian, M. Sobel, Selecting the tth largest using binary errorless comparisons. TR No. 121, Univ. of Minnesota, Department of Statistics, 1969. )1810.1097/00006199-196909000-00061Search in Google Scholar

[33] S. L. Hakimi, On the realizability of a set of integers as degrees of the vertices of a simple graph. J. SIAM Appl. Math. 10 (1962) 496–506. )1810.1137/0110037Search in Google Scholar

[34] R. Haggkvist, P. Hell, Parallel sorting with constant time for comparisons, SIAM J Comput, 10, 3 (1981) 465–472. )1910.1137/0210034Search in Google Scholar

[35] A. Hollosi, M. Pahle, Swiss pairing, in Sensei's Library, Graz, 2013, http://senseis.xmp.net/?SwissPairing, Downloaded June 6, 2017. )21, 23Search in Google Scholar

[36] A. Hollosi, M. Pahle, Tie Breaker, in Sensei's Library, Graz, 2013, http://senseis.xmp.net/?SwissPairing, Downloaded June 6, 2017. )21, 23Search in Google Scholar

[37] A. Iványi, Reconstruction of complete interval tournaments, Acta Univ. Sapientiae, Inform., 1, 1 (2009) 71–88. )18Search in Google Scholar

[38] A. Iványi, Reconstruction of complete interval tournaments II., Acta Univ. Sapientiae, Math., 2, 1 (2010) 47–71. )18Search in Google Scholar

[39] A. Iványi, Directed graphs with prescribed score sequences, in: The 7th Hungarian-Japanese Symposium on Discrete Mathematics and Applications (ed. S. Iwata, Kyoto, May 31 - June 3, 2011), 114–123. )18Search in Google Scholar

[40] A. Iványi, Deciding football sequences, Acta Univ. Sapientiae, Inform., 4, 1 (2012) 130|183. )18Search in Google Scholar

[41] A. Iványi, Degree sequences of multigraphs. Annales Univ. Sci. Budapest., Sect. Comp. 37 (2012) 195–214. )18Search in Google Scholar

[42] A. Iványi, Z. Kása, Parallel partial ranking, Appl. Discr. Math. and Heur. Alg., 1, 3 (2015) 57–76. )22, 24, 26Search in Google Scholar

[43] A. Iványi, L. Lucz, T. F. Móri, P. Sótér, On the Erd}os-Gallai and Havel-Hakimi algorithms. Acta Univ. Sapientiae, Inform. 3, 2 (2011) 230–268. )18Search in Google Scholar

[44] A. Iványi, S. Pirzada, Comparison based ranking, in: Algorithms of Informatics, Vol. 3 (ed. A. Iványi), AnTonCom, Budapest 2011, 1209–1258. )18Search in Google Scholar

[45] G. Kéri, On qualitatively consistent, transitive and contradictory judgment matrices emerging from multiattribute decision procedures, CEJOR Cent. Eur. J. Oper. Res. 19, 2 (2011) 215–224. )1810.1007/s10100-010-0138-7Search in Google Scholar

[46] H. Kim, Z. Toroczkai, I. Miklós, P. L. Erdős, L. A. Székely, Degree-based graph construction, J. Physics: Math. Theor. A 42, 39 (2009), 392001-1-3920001.10. ) 1810.1088/1751-8113/42/39/392001Search in Google Scholar

[47] D. G. Kirkpatrick, A uniéd lower bound for selection and set partitioning problems, J. ACM, 28 (1981) 150–165. )18 10.1145/322234.322245Search in Google Scholar

[48] D. G. Kirkpatrick, Closing a long-standing complexity gap for selection: V3(42) = 50, in Space-efficient Data Structures, Streams, and Algorithms, Springer Verlag, Berlin, 2013, pp.61–76 )1810.1007/978-3-642-40273-9_6Search in Google Scholar

[49] S.S. Kislitsyn, Finding the kth element in ordered set with pairwise comparisons (in Russian), Sibirsk. Mat. Zh., 2, 5 (1964) 557–564. )18Search in Google Scholar

[50] D. E. Knuth, The Art of Computer programming, Vol. 3. Sorting, Addison- Wesley, Upper Saddle River, NJ, 1998. )18, 20Search in Google Scholar

[51] H. G. Landau, On dominance relations and the structure of animal societies. III. The condition for a score sequence, Bull. Math. Biophys. 15 (1953) 143–148. )1810.1007/BF02476378Search in Google Scholar

[52] F. Liljeros, C. R. Edling, L. Amaral, H. E. Stanley, Y. Aberg, The web of humansexual contacts. Nature 411 (2001) 907–908. )18 10.1038/3508214011418846Search in Google Scholar

[53] G. K. Manacher, The Ford-Johnson sorting algorithm is not optimal. J. ACM, 26, 3 (1979) 441–456. )1810.1145/322139.322145Search in Google Scholar

[54] G. K. Manacher, Signi_cant improvements to the Hwang-Lin merging algorithm, J. ACM, 26, 3 (1979) 434–440. )1810.1145/322139.322144Search in Google Scholar

[55] G. K. Manacher, T. D. Bu, T. Mai, Optimal combinations of sorting and merging, J. ACM 36 (1989) 290–334. )1810.1145/62044.62049Search in Google Scholar

[56] C. Martínez, Partial quicksort Proc. 6th ACM-SIAM Workshop on Algorithm Engineering and Experiments and 1st ACM-SIAM Workshop on Analytic Algo- rithmics and Combinatorics. (2004) 5 pages. )18Search in Google Scholar

[57] M. Newman, A. L. Barabási, D. J. Watts, The Structure and Dynamics of Net- works. Princeton University Press, (2006). )18Search in Google Scholar

[58] S. Ólaffson, Weighted matchings in chess tournaments, J. Oper. Res. Soc., 41, 1 (1990) 17–24. )21, 23, 2410.1057/jors.1990.3Search in Google Scholar

[59] M. Peczarski, The Ford-Johnson algorithm still unbeaten for less than 47 elements, Inf. Proc. Letters, 101, 3 (2007) 126–128. )1810.1016/j.ipl.2006.09.001Search in Google Scholar

[60] M. Peczarski, Towards optimal sorting of 16 elements. Acta Univ. Sapientiae, Inform. 4, 2 (2012) 215–224. )18Search in Google Scholar

[61] N. Pippenger, Sorting and selecting in rounds, SIAM J Comput, 16, 6 (1987) 1032–1038. )1810.1137/0216066Search in Google Scholar

[62] S. Pirzada, A. Iványi, Minimal digraphs with given imbalance sets, Acta Univ. Sapientiae, Math., 4, 1 (2012) 86–101. )18Search in Google Scholar

[63] I. Pohl, A sorting problem and its complexity, Comm. ACM 15, 6 (1972) 462– 464. )1810.1145/361405.361423Search in Google Scholar

[64] K. B. Reid, Tournaments: Scores, kings, generalizations and special topics, Congr. Numer. 115 (1996) 171–211. )18Search in Google Scholar

[65] K. B. Reid, C. Q. Zhang, Score sequences of semicomplete digraphs, Bull. Inst. Combin. Appl. 24 (1998) 27–32. )18Search in Google Scholar

[66] A. Schőnhage, M. Paterson, N. Pippenger, Finding the median, J. Comp. Syst. Sci., 13 2 (1976) 184–199. )1810.1016/S0022-0000(76)80029-3Search in Google Scholar

[67] J. Schreier, The tournament elimination systems, Mathesis Polska, (7) (1932) 154–160. )18Search in Google Scholar

[68] L. Slupecki, On the systems of tournaments, Colloquium Math. 2, 4 (1951) 286– 290. )1810.4064/cm-2-3-4-286-290Search in Google Scholar

[69] J. Temesi, L. Csató, S. Bozóki, Tennis of old times and today. An application of the partially _lled comparison matrices (Hungarian), in: (ed. T. Solymosi and F. Forgó) Balance and optimum. Case studies for the seventieth birthday of Ferenc Forgó, Aula, Budapest, 2012, 213–245. )18Search in Google Scholar

[70] Á. Varecza, On the largest and smallest elements. Ann. Univ. Sci. Budapest. Sect. Comput., 4 (1983) 3–10. )18Search in Google Scholar

[71] A. C. Yao, F. F. Yao, On the average-case complexity of selecting the kth best, SIAM J. Comp., 11, 3 (1982) 428-447. )1810.1137/0211034Search in Google Scholar

[72] C. K. Yap, New upper bounds for selection, Comm. ACM, 19, 9 (1976) 501–508. )110.1145/360336.360339Search in Google Scholar