Abstract. This paper deals with the problem of storing a subset of elements from the bounded universeM = {0,...,M−1} so that membership queries can be performed efficiently. In particular, we introduce a data structure to represent a subset of N elements of M in a number of bits close to the information-theoretic minimum, B = l
We study the dynamic membership (or dynamic dictionary) problem, which is one of the most fundamenta...
We consider the bit-probe complexity of the set membership problem: represent an n-element subset S ...
In this paper we consider the question of how much space is needed to represent a set. Given a finit...
We study the it static membership problem: Given a set S of at most n keys drawn from a universe U o...
An approximate membership data structure is a randomized data structure representing a set which sup...
Abstract. We revisit the range minimum query problem and present a new O(n)-space data structure tha...
We look at time-space tradeoffs for the static membership problem in the bit-probe model. The proble...
We propose measures for compressed data structures, in which space usage is measured in a data-aware...
AbstractIn this paper, we propose measures for compressed data structures, in which space usage is m...
We show that it is possible to store a dynamic ordered set S(n,u) of n integers drawn from a bounded...
We propose measures for compressed data structures, in which space usage is mea- sured in a data-awa...
Abstract. We consider space-efficient solutions to two dynamic data structuring problems. We first g...
We study the dynamic membership (or dynamic dictionary) problem, which is one of the most fundamenta...
We consider the problem of storing a single element from an m-element set as\ua0a binary string of o...
We study the following set membership problem in the bit probe model: given a set S from a finite un...
We study the dynamic membership (or dynamic dictionary) problem, which is one of the most fundamenta...
We consider the bit-probe complexity of the set membership problem: represent an n-element subset S ...
In this paper we consider the question of how much space is needed to represent a set. Given a finit...
We study the it static membership problem: Given a set S of at most n keys drawn from a universe U o...
An approximate membership data structure is a randomized data structure representing a set which sup...
Abstract. We revisit the range minimum query problem and present a new O(n)-space data structure tha...
We look at time-space tradeoffs for the static membership problem in the bit-probe model. The proble...
We propose measures for compressed data structures, in which space usage is measured in a data-aware...
AbstractIn this paper, we propose measures for compressed data structures, in which space usage is m...
We show that it is possible to store a dynamic ordered set S(n,u) of n integers drawn from a bounded...
We propose measures for compressed data structures, in which space usage is mea- sured in a data-awa...
Abstract. We consider space-efficient solutions to two dynamic data structuring problems. We first g...
We study the dynamic membership (or dynamic dictionary) problem, which is one of the most fundamenta...
We consider the problem of storing a single element from an m-element set as\ua0a binary string of o...
We study the following set membership problem in the bit probe model: given a set S from a finite un...
We study the dynamic membership (or dynamic dictionary) problem, which is one of the most fundamenta...
We consider the bit-probe complexity of the set membership problem: represent an n-element subset S ...
In this paper we consider the question of how much space is needed to represent a set. Given a finit...
DOI
Add to ORKG