Tournament Sorting
Tournament Sorting is a parallel sorting algorithm that organizes elements into a hierarchical tournament structure, where pairwise comparisons recursively determine the minimum (or maximum) element in logarithmic time, thereby enabling efficient selection and sorting through repeated elimination rounds.
31
Publications
1.4K
Citations
67
Authors
34
Institutions
Publications per year
2017–2026
7
Parents
31
Noga Alon · SIAM Journal on Discrete Mathematics · 2006 · 227 citations
Noisy Sorting Without Resampling
Mark Braverman, Elchanan Mossel · ArXiv.org · 2007 · 156 citations · Full text
James G. Lynch, Jeffrey S. Zax · Journal of Sports Economics · 2000 · 86 citations
1–5 of 31
67
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 67
34

Télécom Paris
Palaiseau, France
3 h-index
5 publications
331 citations
Norwegian School of Economics
Bergen, Norway
2 h-index
2 publications
79 citations
Universidad de Buenos Aires
Buenos Aires, Argentina
2 h-index
3 publications
94 citations
University of Chile
Santiago, Chile
2 h-index
6 publications
335 citations

Consejo Nacional de Investigaciones Científicas y Técnicas
Buenos Aires, Argentina
2 h-index
2 publications
79 citations
Northeastern University
Boston, United States
2 h-index
2 publications
46 citations
IZA - Institute of Labor Economics
Bonn, Germany
2 h-index
4 publications
178 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
3 publications
341 citations
1–8 of 34
Repository · 3 publications · 41 citations
3
h-index
3 publications · 148 citations
3
h-index
2 publications · 257 citations
2
h-index
2 publications · 47 citations
2
h-index
1 publications · 25 citations
1
h-index
1–5