We give the first algorithm for adaptive alphabetic prefix-free coding that is worst-case optimal in terms of time and compression when $\sigma \in o \left( \frac{n^{1 / 2}}{\log n} \right)$, where $\sigma$ is the size of the alphabet and $n$ is the length of the input.
Related papers
Ranked by semantic similarity β how closely each paper's abstract matches this one (100% = near-identical topic).