6 citations · 10 across the 3 of their papers we have counts for
3 papers
cs.DS2021★ 6 cited
More on Change-Making and Related Problems
Timothy M. Chan, Qizheng He
Given a set of integer-valued coin types and a target value , the well-known change-making problem asks for the minimum number of coins that sum to , assuming an unlimite…
cs.DS2011★ 4 cited
Space-Efficient Data-Analysis Queries on Grids
Gonzalo Navarro, Yakov Nekrich, Luís M. S. Russo
We consider various data-analysis queries on two-dimensional points. We give new space/time tradeoffs over previous work on geometric queries such as dominance and rectangle visibi…
cs.DS2009
Efficient Fully-Compressed Sequence Representations
Jeremy Barbay, Francisco Claude, Travis Gagie +2
We present a data structure that stores a sequence over alphabet in $n\Ho(s) + o(n)(\Ho(s){+}1)$ bits, where $\Ho(s)$ is the zero-order entropy of . This stru…