Gerth Stølting Brodal  Home/Search
Context Related
| brics.dk/~gerth/Pa...ii971020.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brics.dk/~gerth/pub20 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the problem of implementing finger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at any arbitrary element f in the list, only requires logarithmic time in the distance between x and f in the list. We present the first pointer-based implementation of finger search trees allowing new elements to be inserted at any arbitrary position in the list in worst case constant time. Previously, the best known... (Update)
Context of citations to this paper: More
.... searched consecutively [6, 16] Insertions take O(1) time and deletions O(log n) time by a recent result for one dimensional keys in [5]. To the best of our knowledge, this was not previously known. One of the applications of this result is the e cient implementation of set...
Cited by: More
Efficient Techniques for Maintaining Multidimensional Keys.. - Grossi, Italiano (1999) (Correct)
Active bibliography (related documents): More All
1.7: Finger Search Trees with Constant Insertion Time - Brodal (1998) (Correct)
0.6: Optimal Finger Search Trees in the Pointer - Machine Gerth Stlting (Correct)
0.6: Optimal Finger Search Trees in the Pointer Machine (Extended.. - Brodal, al. (2002) (Correct)
Similar documents based on text: More All
0.4: Optimal Finger Search Trees in the Pointer Machine - Exte Nd Ed (Correct)
0.4: Cache Oblivious Search Trees via Binary Trees of Small Height - Brodal, Fagerberg, Jacob (2002) (Correct)
0.3: Dynamic Planar Convex Hull with Optimal Query Time and O(log n .. - Brodal, Jacob (Correct)
BibTeX entry: (Update)
Gerth St lting Brodal. Finger search trees with constant insertion time. In Proc. 9th ACM-SIAM Symp. on Discrete Algorithms (1998), 540-549. http://citeseer.ist.psu.edu/st97finger.html More
@misc{ st98finger,
author = "G. St and l Brodal",
title = "Finger search trees with constant insertion time",
text = "Gerth St lting Brodal. Finger search trees with constant insertion time.
In Proc. 9th ACM-SIAM Symp. on Discrete Algorithms (1998), 540-549.",
year = "1998",
url = "citeseer.ist.psu.edu/st97finger.html" }
Citations (may not include all citations):106 Purely Functional Data Structures - Okasaki - 1996
99 Two algorithms for maintaining order in a list (context) - Dietz, Sleator - 1987
67 A new data structure for representing sorted lists (context) - Huddleston, Mehlhorn - 1982
36 A new representation for linear lists (context) - Guibas, McCreight et al. - 1977
33 Making data structures persistent (context) - Driscoll, Sarnak et al. - 1989
28 volume 156 of Lecture Notes in Computer Science (context) - Overmars, of et al. - 1983
25 Design and analysis of a data structure for representing sor.. (context) - Brown, Tarjan - 1980
20 Persistent lists with catenation via recursive slow-down (context) - Kaplan, Tarjan - 1995
16 Localized search in sorted lists (context) - Kosaraju - 1981
14 A balanced search tree with O (context) - Levcopoulos, Overmars - 1988
12 A simple balanced search tree with O (context) - Fleischer - 1996
11 Eliminating Amortization: On Data Structures with Guaranteed.. (context) - Raman - 1992
10 A constant update time finger search tree (context) - Dietz, Raman - 1994
7 Partially persistent data structures of bounded degree with .. - Brodal - 1996
6 A data structure with movable fingers and deletions (context) - Harel, Lueker - 1979
2 Fast updates of balanced search trees with a guaranteed time.. (context) - Harel - 1980
2 Information and Computation (context) - Tsakalidis, localized - 1985
Documents on the same site (http://www.brics.dk/~gerth/pub20.html): More
A Communication Complexity Proof that Symmetric Functions.. - Brodal, Husfeldt (1996) (Correct)
The Randomized Complexity of Maintaining the Minimum - Brodal, Chaudhuri.. (1996) (Correct)
Optimal Finger Search Trees in the Pointer Machine (Extended.. - Brodal, al. (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC