Now showing items 1-2 of 2

    • Barbay, Jérémy; Claude, Francisco; Gagie, Travis; Navarro, Gonzalo; Nekrich, Yakov (Springer, 2012)
      We present a data structure that stores a sequence s[1..n] over alphabet [1..σ ] in nH0(s) + o(n)(H0(s)+1) bits, where H0(s) is the zero-order entropy of s. This structure supports the queries access, rank and select, ...
    • Navarro, Gonzalo; Nekrich, Yakov; Luís M., S. Russo (Elsevier, 2013)
      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 visibility, and on semigroup and group queries ...