Tony Finch. QP tries are smaller and faster than crit-bit trees. TinyToCS, 4, 2016. [doi]
@article{Finch16, title = {QP tries are smaller and faster than crit-bit trees}, author = {Tony Finch}, year = {2016}, url = {http://tinytocs.org/papers/tinytocs4_paper_finch.pdf}, researchr = {https://researchr.org/publication/Finch16}, cites = {0}, citedby = {0}, journal = {TinyToCS}, volume = {4}, }