QP tries are smaller and faster than crit-bit trees

Tony Finch. QP tries are smaller and faster than crit-bit trees. TinyToCS, 4, 2016. [doi]

Abstract

Abstract is missing.