In the classical dictionary problem, a set of $n$ distinct keys over an unbounded and ordered universe is maintained under insertions and deletions of individual keys while supporting search operations. An implicit dictionary has the additional constraint of occupying the space merely required by storing the~$n$~keys, that is, exactly $n$ contiguous words of space in total. All what is known is the starting position of the memory segment hosting the keys, as the rest of the information is implicitly encoded by a suitable permutation of the keys. This paper describes the flat implicit tree, which is the first implicit dictionary requiring $O(\log n)$ time per search and update operation
AbstractIn this paper, we propose measures for compressed data structures, in which space usage is m...
We present a new technique of universe reduction. Primary applications are the dictionary problem an...
Given a set of integer keys from a bounded universe along with associated data, the dictionary prob...
In the classical dictionary problem, a set of $n$ distinct keys over an unbounded and ordered unive...
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap fo...
Abstract. We develop dynamic dictionaries on the word RAM that use asymptotically optimal space, up ...
AbstractThis paper proves a tradeoff between the time it takes to search for elements in an implicit...
We consider dictionaries over the universe U = {0, 1}^w on a unit-costRAM with word size w and a sta...
In this paper, we present an experimental study of the spacetime tradeoffs for the dictionary proble...
We present a new technique of universe reduction. Primary applications are the dictionary problem an...
AbstractAn implicit data structure for the dictionary problem maintains n data values in the first n...
An implicit data structure for the dictionary problem maintains n data values in the first n locatio...
We propose measures for compressed data structures, in which space usage is mea- sured in a data-awa...
[[abstract]]We propose measures for compressed data structures, in which space usage is measured in ...
The talk is about a dictionary data structure D for matching multiple pat-tern. If the input alphabe...
AbstractIn this paper, we propose measures for compressed data structures, in which space usage is m...
We present a new technique of universe reduction. Primary applications are the dictionary problem an...
Given a set of integer keys from a bounded universe along with associated data, the dictionary prob...
In the classical dictionary problem, a set of $n$ distinct keys over an unbounded and ordered unive...
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap fo...
Abstract. We develop dynamic dictionaries on the word RAM that use asymptotically optimal space, up ...
AbstractThis paper proves a tradeoff between the time it takes to search for elements in an implicit...
We consider dictionaries over the universe U = {0, 1}^w on a unit-costRAM with word size w and a sta...
In this paper, we present an experimental study of the spacetime tradeoffs for the dictionary proble...
We present a new technique of universe reduction. Primary applications are the dictionary problem an...
AbstractAn implicit data structure for the dictionary problem maintains n data values in the first n...
An implicit data structure for the dictionary problem maintains n data values in the first n locatio...
We propose measures for compressed data structures, in which space usage is mea- sured in a data-awa...
[[abstract]]We propose measures for compressed data structures, in which space usage is measured in ...
The talk is about a dictionary data structure D for matching multiple pat-tern. If the input alphabe...
AbstractIn this paper, we propose measures for compressed data structures, in which space usage is m...
We present a new technique of universe reduction. Primary applications are the dictionary problem an...
Given a set of integer keys from a bounded universe along with associated data, the dictionary prob...