We consider the problem of performing predecessor searches in a bounded universe while achieving query times that depend on the distribution of queries. We obtain several data structures with various properties: in
Machine-learning techniques, properly combined with data structures, have resulted in Learned Static...
Abstract. We give lower and upper bounds for the batched predecessor problem in external memory. We ...
International audienceEarliest query answering is needed for streaming XML processing with optimal m...
Given a bounded universe {0,1,⋯,U-1}, we show how to perform predecessor searches in O(loglogΔ) expe...
We describe new algorithms for the predecessor problem in the Noisy Comparison Model. In this proble...
AbstractWe consider a fundamental problem in data structures, static predecessor searching: Given a ...
We present highly optimized data structures for the dynamic predecessor problem, where the task is t...
In this work, we continue the examination of the role non-adaptivity plays in maintaining dynamic da...
AbstractIn this paper, we propose measures for compressed data structures, in which space usage is m...
In this work, we continue the examination of the role non-adaptivity plays in maintaining dynamic da...
We study the problem of supporting queries on a string S of length n within a space bounded by the s...
AbstractWe consider the problem of maintaining a dynamic ordered set of n integers in a universe U u...
New data structures are presented for very fast predecessor queries on integer data sets stored on m...
We answer a basic data structuring question (for example, raised by Dietz and Raman [1991]): can van...
We study the problem of supporting queries on a string S of length n within a space bounded by the s...
Machine-learning techniques, properly combined with data structures, have resulted in Learned Static...
Abstract. We give lower and upper bounds for the batched predecessor problem in external memory. We ...
International audienceEarliest query answering is needed for streaming XML processing with optimal m...
Given a bounded universe {0,1,⋯,U-1}, we show how to perform predecessor searches in O(loglogΔ) expe...
We describe new algorithms for the predecessor problem in the Noisy Comparison Model. In this proble...
AbstractWe consider a fundamental problem in data structures, static predecessor searching: Given a ...
We present highly optimized data structures for the dynamic predecessor problem, where the task is t...
In this work, we continue the examination of the role non-adaptivity plays in maintaining dynamic da...
AbstractIn this paper, we propose measures for compressed data structures, in which space usage is m...
In this work, we continue the examination of the role non-adaptivity plays in maintaining dynamic da...
We study the problem of supporting queries on a string S of length n within a space bounded by the s...
AbstractWe consider the problem of maintaining a dynamic ordered set of n integers in a universe U u...
New data structures are presented for very fast predecessor queries on integer data sets stored on m...
We answer a basic data structuring question (for example, raised by Dietz and Raman [1991]): can van...
We study the problem of supporting queries on a string S of length n within a space bounded by the s...
Machine-learning techniques, properly combined with data structures, have resulted in Learned Static...
Abstract. We give lower and upper bounds for the batched predecessor problem in external memory. We ...
International audienceEarliest query answering is needed for streaming XML processing with optimal m...
DOI
Add to ORKG