Add to ORKGGiven a dictionary S of n binary strings each of length m,we consider the problem of designing a data structure for S thatsupports d-queries; given a binary query string q of length m, ad-query reports if there exists a string in S within Hamming distance d of q. We construct a data structure for the case d = 1, thatrequires space O(n log m) and has query time O(1) in a cell probemodel with word size m. This generalizes and improves the previous bounds of Yao and Yao for the problem in the bit probemodel.Keywords: Data Structures, Dictionaries, Hashing, Hamming Distance
We study data structures in the presence of adversarial noise. We want to encode a given object in a...
This paper studies the 1-error dictionary search problem in external memory. The input is a set D of...
Abstract. We develop dynamic dictionaries on the word RAM that use asymptotically optimal space, up ...
We revisit the fundamental problem of dictionary look-up with mismatches. Given a set (dictionary) o...
We consider dictionaries that perform lookups by probing a single word of memory, knowing only the s...
We consider dictionaries of size n over the finite universe U ={0, 1}^w and introduce a new techniqu...
In the cell probe model with word size 1 (the bit probe model), a static data structure problem is g...
Abstract. LetW be a dictionary consisting of n binary strings of length m each, represented as a tri...
A static dictionary is a data structure for storing subsets of a finite universe U, so that membersh...
We consider the dictionary problem in external memory and improve the update time of the well-known ...
We consider the dictionary problem in external memory and improve the update time of the well-known ...
AbstractIn this paper, we propose measures for compressed data structures, in which space usage is m...
Abstract. Given a set of n binary strings of length m each. We consider the problem of answering d{q...
[[abstract]]We propose measures for compressed data structures, in which space usage is measured in ...
AbstractWe consider time-space tradeoffs for static data structure problems in the cell probe model ...
We study data structures in the presence of adversarial noise. We want to encode a given object in a...
This paper studies the 1-error dictionary search problem in external memory. The input is a set D of...
Abstract. We develop dynamic dictionaries on the word RAM that use asymptotically optimal space, up ...
We revisit the fundamental problem of dictionary look-up with mismatches. Given a set (dictionary) o...
We consider dictionaries that perform lookups by probing a single word of memory, knowing only the s...
We consider dictionaries of size n over the finite universe U ={0, 1}^w and introduce a new techniqu...
In the cell probe model with word size 1 (the bit probe model), a static data structure problem is g...
Abstract. LetW be a dictionary consisting of n binary strings of length m each, represented as a tri...
A static dictionary is a data structure for storing subsets of a finite universe U, so that membersh...
We consider the dictionary problem in external memory and improve the update time of the well-known ...
We consider the dictionary problem in external memory and improve the update time of the well-known ...
AbstractIn this paper, we propose measures for compressed data structures, in which space usage is m...
Abstract. Given a set of n binary strings of length m each. We consider the problem of answering d{q...
[[abstract]]We propose measures for compressed data structures, in which space usage is measured in ...
AbstractWe consider time-space tradeoffs for static data structure problems in the cell probe model ...
We study data structures in the presence of adversarial noise. We want to encode a given object in a...
This paper studies the 1-error dictionary search problem in external memory. The input is a set D of...
Abstract. We develop dynamic dictionaries on the word RAM that use asymptotically optimal space, up ...