English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  Finger Search Trees with Constant Update Time

Brodal, G. S. (1998). Finger Search Trees with Constant Update Time. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98) (pp. 540-549). New York, USA: ACM Press / SIAM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3795-1 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3796-0
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Brodal, Gerth Stølting1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: We consider the problem of implementing finger search trees on the pointer machine, {\it 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 insertion time on the pointer machine was $O(\log^{*} n)$, where $n$ is the total length of the list. On a unit-cost RAM, a constant insertion time has been achieved by Dietz and Raman by using standard techniques of packing small problem sizes into a constant number of machine words. Deletion of a list element is supported in $O(\log^{*} n)$ time, which matches the previous best bounds. Our data structure requires linear space.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021998
 Publication Status: Issued
 Pages: -
 Publishing info: New York, USA : ACM Press / SIAM
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 517894
Other: Local-ID: C1256428004B93B8-F7F4FED03445DDFFC12565B70057C405-Brodal98a
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: San Francisko, USA
Start-/End Date: 1998

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, USA : ACM Press / SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 540 - 549 Identifier: ISBN: 0-89871-410-9