We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structures. This leads to an optimal bound of O(√log n/log log n) for searching and updating a dynamic set X of n integer keys in linear space.
Oct 9, 2002 · We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully ...
Maintaining a dynamic ordered set is a fundamental textbook problem (see, e.g., [13, Part. III]). Starting from an empty set X, the basic operations are: Insert ...
This work introduces exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into ...
In this paper, we introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully- ...
Apr 18, 2007 · We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully- ...
Dec 5, 2024 · Abstract. We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets ...
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear ...
Jan 17, 2014 · Ordinary BBSTs are a way of kinda saying (or at least similar to): grab a sorted array and start searching from its middle (the root of BBST) ...
Missing: Sets | Show results with:Sets
<jats:p>We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into ...