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
Parents
23
1–5 of 23
45
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 45
34
University of Haifa
Haifa, Israel
2 h-index
2 publications
65 citations
State University of New York
Albany, United States
1 h-index
1 publications
39 citations

University of Gothenburg
Gothenburg, Sweden
1 h-index
1 publications
11 citations
University of Florence
Florence, Italy
1 h-index
4 publications
112 citations
Växjö Kommun
Vaxjo, Sweden
1 h-index
1 publications
11 citations
Université Libre de Bruxelles
Brussels, Belgium
1 h-index
1 publications
24 citations

University of Waterloo
Waterloo, Canada
1 h-index
1 publications
63 citations
Center for Discrete Mathematics and Theoretical Computer Science
Piscataway, United States
1 h-index
1 publications
15 citations
1–8 of 34
3 publications · 106 citations
3
h-index
2 publications · 29 citations
2
h-index
Repository · 1 publications · 39 citations
1
h-index
1 publications · 119 citations
1
h-index
1 publications · 34 citations
1
h-index
1–5