15 citations · 77 across the 40 of their papers we have counts for
1 paper · 1 filter
Anke van Zuylen, James Bieron, Frans Schalekamp +1
We consider the problem of upper bounding the number of circular transpositions needed to sort a permutation. It is well known that any permutation can be sorted using at most $n(n…