Counting Inversions

Counting Inversions is a computational problem in algorithm design that, within the divide and conquer paradigm, specifically refers to the task of determining the number of pairs in a sequence where the order of elements is reversed relative to a sorted arrangement.

23

Publications

1K

Citations

45

Authors

34

Institutions

Publications per year

2017–2026

1

Authors

45

  1. TM
    Toufik Mansour

    University of Haifa, Israel

    2 publications · 65 citations

    2

    h-index

  2. MP
    Mihai Pǎtraşcu

    AT&T (United States), United States

    2 publications · 106 citations

    2

    h-index

  3. TM
    Timothy M. Chan

    University of Waterloo, Canada

    2 publications · 106 citations

    2

    h-index

  4. IK
    Ilias Kotsireas

    Wilfrid Laurier University, Canada

    1 publications · 12 citations

    1

    h-index

  5. MC
    Mark Conger

    University of Michigan, United States

    1 publications · 19 citations

    1

    h-index

1–5 of 45

Venues

  1. Discrete Mathematics

    3 publications · 106 citations

    3

    h-index

  2. Journal of Symbolic Computation

    2 publications · 29 citations

    2

    h-index

  3. PubMed

    Repository · 1 publications · 39 citations

    1

    h-index

  4. Mechanism and Machine Theory

    1 publications · 119 citations

    1

    h-index

  5. Journal of Computational Biology

    1 publications · 34 citations

    1

    h-index

1–5