Publication date
September 2011
DOIAbstract
Let S be a set of n reals. We show how to process on-line r membership queries, insertions, and deletions in time O(r log (n + r) + (n + r) log r). This is optimal in the binary comparison model
Let S be a set of n reals. We show how to process on-line r membership queries, insertions, and deletions in time O(r log (n + r) + (n + r) log r). This is optimal in the binary comparison model
This paper presents a general technique for optimally transforming any dynamic data structure that o...
Answering connectivity queries is fundamental to fully dynamic graphs where edges and vertices are i...
We present a general transformation for combining a constant number of binary search tree data struc...
In this paper we show how a slight modification of $(a,b)$-trees allows us to perform member and nei...
Abstract. We consider space-efficient solutions to two dynamic data structuring problems. We first g...
This paper introduces randomized K-dimensional binary search trees (randomized Kd-trees), a varian...
We show how binary trees of bounded balance can be maintained so that the time to perform each indiv...
AbstractWe consider the problem of maintaining a dynamic ordered set of n integers in a universe U u...
A static dictionary is a data structure for storing subsets of a finite universe U, so that membersh...
Augmented B-trees (aB-trees) are a broad class of data structures. The seminal work "succincter" by ...
We address the extension of the binary search technique from sorted arrays and totally ordered sets ...
This paper presents three new results on data structures which lead to improvement in two classical ...
We propose new succinct representations of ordinal trees, which have been studied exten-sively. It i...
This thesis aims to analyze the costs of various binary search tree (BST) algorithms. BST is one of ...
This paper presents a general technique for optimally transforming any dynamic data structure that o...
This paper presents a general technique for optimally transforming any dynamic data structure that o...
Answering connectivity queries is fundamental to fully dynamic graphs where edges and vertices are i...
We present a general transformation for combining a constant number of binary search tree data struc...
In this paper we show how a slight modification of $(a,b)$-trees allows us to perform member and nei...
Abstract. We consider space-efficient solutions to two dynamic data structuring problems. We first g...
This paper introduces randomized K-dimensional binary search trees (randomized Kd-trees), a varian...
We show how binary trees of bounded balance can be maintained so that the time to perform each indiv...
AbstractWe consider the problem of maintaining a dynamic ordered set of n integers in a universe U u...
A static dictionary is a data structure for storing subsets of a finite universe U, so that membersh...
Augmented B-trees (aB-trees) are a broad class of data structures. The seminal work "succincter" by ...
We address the extension of the binary search technique from sorted arrays and totally ordered sets ...
This paper presents three new results on data structures which lead to improvement in two classical ...
We propose new succinct representations of ordinal trees, which have been studied exten-sively. It i...
This thesis aims to analyze the costs of various binary search tree (BST) algorithms. BST is one of ...
This paper presents a general technique for optimally transforming any dynamic data structure that o...
This paper presents a general technique for optimally transforming any dynamic data structure that o...
Answering connectivity queries is fundamental to fully dynamic graphs where edges and vertices are i...
We present a general transformation for combining a constant number of binary search tree data struc...
Add to ORKG