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

Authors

67

  1. OH
    Olivier Hudry

    Télécom Paris, France

    3 publications · 188 citations

    3

    h-index

  2. BV
    Bonnie Vaughan

    Northeastern University, United States

    2 publications · 46 citations

    2

    h-index

  3. IC
    Irène Charon

    Télécom Paris, France

    2 publications · 143 citations

    2

    h-index

  4. SU
    Susan Uren

    Northeastern University, United States

    2 publications · 46 citations

    2

    h-index

  5. GD
    Guillermo Durán

    University of Chile, Chile

    2 publications · 79 citations

    2

    h-index

1–5 of 67

Venues

  1. arXiv (Cornell University)

    Repository · 3 publications · 41 citations

    3

    h-index

  2. Annals of Operations Research

    3 publications · 148 citations

    3

    h-index

  3. SIAM Journal on Discrete Mathematics

    2 publications · 257 citations

    2

    h-index

  4. SIAM Journal on Computing

    2 publications · 47 citations

    2

    h-index

  5. Labour Economics

    1 publications · 25 citations

    1

    h-index

1–5