@InProceedings{auger_et_al:LIPIcs:2018:9467,
  author ={Nicolas Auger and Vincent Jug{\'e} and Cyril Nicaud and Carine Pivoteau},
  title ={{On the Worst-Case Complexity of TimSort}},
  booktitle ={26th Annual European Symposium on Algorithms (ESA 2018)},
  pages ={4:1--4:13},
  series ={Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN ={978-3-95977-081-1},
  ISSN ={1868-8969},
  year ={2018},
  volume ={112},
  editor ={Yossi Azar and Hannah Bast and Grzegorz Herman},
  publisher ={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address ={Dagstuhl, Germany},
  URL ={http://drops.dagstuhl.de/opus/volltexte/2018/9467},
  URN ={urn:nbn:de:0030-drops-94678},
  doi ={10.4230/LIPIcs.ESA.2018.4},
  annote ={Keywords: Sorting algorithms, Merge sorting algorithms, TimSort, Analysis of algorithms}
}