16 citations · 16 across the 2 of their papers we have counts for
2 papers
cs.DS2008
Low-Memory Adaptive Prefix Coding
Travis Gagie, Marek Karpinski, Yakov Nekrich
In this paper we study the adaptive prefix coding problem in cases where the size of the input alphabet is large. We present an online prefix coding algorithm that uses $O(σ^{1 / λ…
cs.DS2008★ 16 cited
Searching for Frequent Colors in Rectangles
Marek Karpinski, Yakov Nekrich
We study a new variant of colored orthogonal range searching problem: given a query rectangle all colors , such that at least a fraction of all points in are of colo…