Nathan Amani Collet, Cyril Nicaud, Pablo Rotondo. On the average complexity of Timsort with the minrun heuristic. // Information Processing Letters. – 2027. – DOI: 10.1016/j.ipl.2026.106665. – URL: https://doi.org/10.1016/j.ipl.2026.106665
Nathan Amani Collet, Cyril Nicaud, & Pablo Rotondo (2027). On the average complexity of Timsort with the minrun heuristic. Information Processing Letters. https://doi.org/10.1016/j.ipl.2026.106665
Nathan Amani Collet, et al. “On the average complexity of Timsort with the minrun heuristic.” Information Processing Letters, 2027. doi:10.1016/j.ipl.2026.106665.
@article{Collet2027,
title = {On the average complexity of Timsort with the minrun heuristic},
author = {Collet, Nathan Amani and Nicaud, Cyril and Rotondo, Pablo},
journal = {Information Processing Letters},
year = {2027},
doi = {10.1016/j.ipl.2026.106665},
url = {https://doi.org/10.1016/j.ipl.2026.106665}
}