We consider a generalization of the problem of supporting rank and select queries on binary strings. Given a string of length <i>n</i> from an alphabet of size Ïƒ, we give the first representationâ€¦ (More)

The Minimal Cycle Basis Problem (MCB) is the following. Given a binary matroid with nonnegative weights assigned to its elements, what is the set of cycles with total smallest weight which generateâ€¦ (More)

We consider the problem of :nding the longest increasing subsequence in a sliding window over a given sequence (LISW). We propose an output-sensitive data structure that solves this problem in timeâ€¦ (More)

We study the global cardinality constraint (gcc) and propose an O(nd) algorithm for domain consistency and an O(cn + dn) algorithm for range consistency, where n is the number of variables, d theâ€¦ (More)

The main goal of this thesis is to investigate the complexity of a variety of problems related to text indexing and text searching. We present new data structures that can be used as building blocksâ€¦ (More)

In this paper, we consider several static data structure problems in the deterministic cell probe model. We develop a new technique for proving lower bounds for succinct data structures, where theâ€¦ (More)