Getting this item's online copy...
Find a copy in the library
Getting this item's location and availability...
Find it in libraries globally
|All Authors / Contributors:||
Rajeev Raman; Paul Frederick Dietz
|Description:||14 pages ; 28 cm.|
|Series Title:||University of Rochester.; Department of Computer Science.; Technical report|
|Responsibility:||Rajeev Raman, Paul Dietz.|
Abstract: "Levcopolous and Overmars [LO88] described a search tree in which the time to insert or delete a key was O(1) once the position of the key to be inserted or deleted was known. Their data structure did not support fingers, pointers to points of high access or update activity in the set such that access and update operations in the vicinity of a finger are particularly efficient [GMPR77, BT80, Kos81, HM82, Tsa85]. Levcopolous and Overmars left open the question of whether a data structure could be designed which allowed updates in constant time and supported fingers. We answer the question in the affirmative by giving an algorithm in the RAM with logarithmic word size."
Retrieving notes about this item