Total Ordering

Total Ordering is a mathematical relation that belongs to the class of binary relations on a set, distinguished by the property that every pair of elements is comparable, ensuring that for any two elements a and b, either a ≤ b or b ≤ a holds, thereby imposing a linear sequence on all elements in the context of distributed synchronization.

222

Publications

17.5K

Citations

419

Authors

226

Institutions

Publications per year

2017–2026

21

Variants

Linear Ordering

Authors

419

  1. PM
    P. M. Melliar‐Smith

    University of California, Santa Barbara, United States

    4 publications · 119 citations

    4

    h-index

  2. AR
    Asok Ray

    Pennsylvania State University, United States

    4 publications · 88 citations

    4

    h-index

  3. HC
    Hubert Comon

    Centre National de la Recherche Scientifique, France

    4 publications · 140 citations

    4

    h-index

  4. LE
    Louise E. Moser

    University of California, Santa Barbara, United States

    3 publications · 104 citations

    3

    h-index

  5. EV
    Edward V. Huntington

    Harvard University Press, United States

    2 publications · 52 citations

    2

    h-index

1–5 of 419

Venues

  1. Theoretical Computer Science

    7 publications · 345 citations

    7

    h-index

  2. Transactions of the American Mathematical Society

    TRAN · 6 publications · 176 citations

    6

    h-index

  3. 4

    h-index

  4. SIAM Journal on Computing

    4 publications · 293 citations

    4

    h-index

  5. SIAM Journal on Discrete Mathematics

    3 publications · 259 citations

    3

    h-index

1–5