[1]
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 (Jun. 2017), P2.28. DOI:https://doi.org/10.37236/6354.