• Publications
  • Influence
Alphabet Partitioning for Compressed Rank/Select and Applications
We present a data structure that stores a string s[1..n] over the alphabet [1..σ] in nH 0(s) + o(n)(H 0(s) + 1) bits, where H 0(s) is the zero-order entropy of s. This data structure supports theExpand
  • 69
  • 11
Adaptive intersection and t-threshold problems
Consider the problem of computing the intersection of k sorted sets. In the comparison model, we prove a new lower bound which depends on the non-deterministic complexity of the instance, and impliesExpand
  • 73
  • 8
  • PDF
Succinct indexes for strings, binary relations and multi-labeled trees
We define and design succinct indexes for several abstract data types (ADTs). The concept is to design auxiliary data structures that occupy asymptotically less space than the information-theoreticExpand
  • 95
  • 6
Faster Adaptive Set Intersections for Text Searching
The intersection of large ordered sets is a common problem in the context of the evaluation of boolean queries to a search engine. In this paper we engineer a better algorithm for this task, whichExpand
  • 74
  • 6
  • PDF
Succinct Representation of Labeled Graphs
In many applications, the properties of an object being modeled are stored as labels on vertices or edges of a graph. In this paper, we consider succinct representation of labeled graphs. Our mainExpand
  • 59
  • 6
  • PDF
Compressed Representations of Permutations, and Applications
We explore various techniques to compress a permutationover n integers, taking advantage of ordered subsequences in �, while supporting its application �(i) and the application of its inverse � −1Expand
  • 56
  • 4
  • PDF
Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
The most heavily used methods to answer conjunctive queries on binary relations (such as the one associating keywords with web pages) are based on inverted lists stored in sorted arrays and useExpand
  • 61
  • 4
  • PDF
Succinct indexes for strings, binary relations and multilabeled trees
We define and design succinct indexes for several abstract data types (ADTs). The concept is to design auxiliary data structures that ideally occupy asymptotically less space than theExpand
  • 57
  • 3
  • PDF
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm $A$ for computing 2-d or 3-dconvex hulls that is optimal for {\em every point set\/} in the following sense: %for every set $S$ of $n$ points and for everyExpand
  • 51
  • 3
  • PDF
On compressing permutations and adaptive sorting
We prove that, given a permutation @p over [1..n] formed of nRuns sorted blocks of sizes given by the vector R=, there exists a compressed data structure encoding @p inExpand
  • 43
  • 3
  • PDF