Now showing items 1-2 of 2

    • Grossi, Roberto; Iacono, John; Navarro, Gonzalo; Raman, Rajeev; Satti, S. Rao (Association for Computing Machinery, 2017)
      Given an array A[1, n] of elements with a total order, we consider the problem of building a data structure that solves two queries: (a) selection queries receive a range [i, j] and an integer k and return the position of ...
    • Arroyuelo, Diego; Cánovas, Rodrigo; Navarro, Gonzalo; Raman, Rajeev (Springer, 2017)
      We present the first algorithms that perform the LZ78 compression of a text of length n over alphabet [1..σ], whose output is z integers, using only O(z lg σ) bits of main memory. The algorithms read the input text from ...