%0 Conference Paper %1 conf/esa/AugerJNP18 %A Auger, Nicolas %A Jugé, Vincent %A Nicaud, Cyril %A Pivoteau, Carine %B ESA %D 2018 %E Azar, Yossi %E Bast, Hannah %E Herman, Grzegorz %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 4:1-4:13 %T On the Worst-Case Complexity of TimSort. %U http://dblp.uni-trier.de/db/conf/esa/esa2018.html#AugerJNP18 %V 112 %@ 978-3-95977-081-1

@inproceedings{conf/esa/AugerJNP18, added-at = {2018-08-23T00:00:00.000+0200}, author = {Auger, Nicolas and Jugé, Vincent and Nicaud, Cyril and Pivoteau, Carine}, biburl = {https://www.bibsonomy.org/bibtex/20d6904bcc376dd84ea4d2023697e1554/dblp}, booktitle = {ESA}, crossref = {conf/esa/2018}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, ee = {https://doi.org/10.4230/LIPIcs.ESA.2018.4}, interhash = {6c79e82e2dff4d9710fc61fb4aee1fca}, intrahash = {0d6904bcc376dd84ea4d2023697e1554}, isbn = {978-3-95977-081-1}, keywords = {dblp}, pages = {4:1-4:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2020-02-12T11:44:53.000+0100}, title = {On the Worst-Case Complexity of TimSort.}, url = {http://dblp.uni-trier.de/db/conf/esa/esa2018.html#AugerJNP18}, volume = 112, year = 2018 }