Asymptotic and exact results on the complexity of the Novelli-Pak-Stoyanovskii algorithm

Research output: Contribution to journal › Article › peer-review

Original language	English
Article number	P2.28
Pages (from-to)	1-33
Number of pages	25
Journal	The Electronic Journal of Combinatorics
Volume	24
Issue number	2
DOIs	https://doi.org/10.37236/6354
Publication status	Published - 2017

Fields of science

@article{dca6c1141cc4416186124815ade9d610,

title = "Asymptotic and exact results on the complexity of the Novelli-Pak-Stoyanovskii algorithm",

author = "Carsten Schneider and Robin Sulzgruber",

year = "2017",

doi = "10.37236/6354",

language = "English",

volume = "24",

pages = "1--33",

journal = "The Electronic Journal of Combinatorics",

issn = "1077-8926",

number = "2",

}

TY - JOUR

T1 - Asymptotic and exact results on the complexity of the Novelli-Pak-Stoyanovskii algorithm

AU - Schneider, Carsten

AU - Sulzgruber, Robin

PY - 2017

Y1 - 2017

UR - http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i2p28

U2 - 10.37236/6354

DO - 10.37236/6354

M3 - Article

SN - 1077-8926

VL - 24

SP - 1

EP - 33

JO - The Electronic Journal of Combinatorics

JF - The Electronic Journal of Combinatorics

IS - 2

M1 - P2.28

ER -