2 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DS2018★ 1 cited
On the Worst-Case Complexity of TimSort
Nicolas Auger, Vincent Jugé, Cyril Nicaud +1
TimSort is an intriguing sorting algorithm designed in 2002 for Python, whose worst-case complexity was announced, but not proved until our recent preprint. In fact, there are two…
cs.DM2016★ 2 cited
Analysis of Algorithms for Permutations Biased by Their Number of Records
Nicolas Auger, Mathilde Bouvel, Cyril Nicaud +1
The topic of the article is the parametric study of the complexity of algorithms on arrays of pairwise distinct integers. We introduce a model that takes into account the non-unifo…