Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Dynamic Ordered Sets with Exponential Search Trees Arne Andersson
 

Summary: Dynamic Ordered Sets with Exponential Search Trees
Arne Andersson
Computing Science Department
Information Technology, Uppsala University
Box 311, SE - 751 05 Uppsala, Sweden
arnea@csd.uu.se http://www.csd.uu.se/arnea
Mikkel Thorup
AT&T Labs­Research
Shannon Laboratory
180 Park Avenue, Florham Park
NJ 07932, USA
mthorup@research.att.com
Abstract
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. Searching X for an integer y means
finding the maximum key in X which is smaller than or equal to y. This problem is
equivalent to the standard text book problem of maintaining an ordered set.

  

Source: Andersson, Arne - Department of Information Technology, Uppsala Universitet

 

Collections: Computer Technologies and Information Sciences