@InProceedings{barbay:LIPIcs.CPM.2016.29,
author = {Barbay, J\'{e}r\'{e}my},
title = {{Optimal Prefix Free Codes with Partial Sorting}},
booktitle = {27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)},
pages = {29:1--29:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-012-5},
ISSN = {1868-8969},
year = {2016},
volume = {54},
editor = {Grossi, Roberto and Lewenstein, Moshe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.29},
URN = {urn:nbn:de:0030-drops-60635},
doi = {10.4230/LIPIcs.CPM.2016.29},
annote = {Keywords: Deferred Data Structure, Huffman, Median, Optimal Prefix Free Codes, van Leeuwen.}
}