Jérémy Barbay. Optimal Prefix Free Codes with Partial Sorting. In Roberto Grossi, Moshe Lewenstein, editors, 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, June 27-29, 2016, Tel Aviv, Israel. Volume 54 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]
@inproceedings{Barbay16-0,
title = {Optimal Prefix Free Codes with Partial Sorting},
author = {Jérémy Barbay},
year = {2016},
doi = {10.4230/LIPIcs.CPM.2016.29},
url = {http://dx.doi.org/10.4230/LIPIcs.CPM.2016.29},
researchr = {https://researchr.org/publication/Barbay16-0},
cites = {0},
citedby = {0},
booktitle = {27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, June 27-29, 2016, Tel Aviv, Israel},
editor = {Roberto Grossi and Moshe Lewenstein},
volume = {54},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-012-5},
}