Schneider, C. and Sulzgruber, R. (2017) “Asymptotic and Exact Results on the Complexity of the Novelli-Pak-Stoyanovskii Algorithm”, The Electronic Journal of Combinatorics, 24(2), p. P2.28. doi: 10.37236/6354.