On the dynamic finger conjecture for splay trees. Part II

The proof

Research output: Contribution to journalArticle

Abstract

The following result is shown: On an n-node splay tree, the amortized cost of an access at distance d from the preceding access is O(log(d+1)). In addition, there is an O(n) initialization cost. The accesses include searches, insertions, and deletions.

Original languageEnglish (US)
Pages (from-to)44-85
Number of pages42
JournalSIAM Journal on Computing
Volume30
Issue number1
DOIs
StatePublished - 2000

Fingerprint

Costs
Initialization
Deletion
Insertion
Vertex of a graph

Keywords

  • Amortized analysis
  • Binary search tree
  • Finger search tree
  • Splay tree

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Theoretical Computer Science

Cite this

On the dynamic finger conjecture for splay trees. Part II : The proof. / Cole, R.

In: SIAM Journal on Computing, Vol. 30, No. 1, 2000, p. 44-85.

Research output: Contribution to journalArticle

@article{1726aee4f6af43879a95c701f2f392bd,
title = "On the dynamic finger conjecture for splay trees. Part II: The proof",
abstract = "The following result is shown: On an n-node splay tree, the amortized cost of an access at distance d from the preceding access is O(log(d+1)). In addition, there is an O(n) initialization cost. The accesses include searches, insertions, and deletions.",
keywords = "Amortized analysis, Binary search tree, Finger search tree, Splay tree",
author = "R. Cole",
year = "2000",
doi = "10.1137/S009753979732699X",
language = "English (US)",
volume = "30",
pages = "44--85",
journal = "SIAM Journal on Computing",
issn = "0097-5397",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "1",

}

TY - JOUR

T1 - On the dynamic finger conjecture for splay trees. Part II

T2 - The proof

AU - Cole, R.

PY - 2000

Y1 - 2000

N2 - The following result is shown: On an n-node splay tree, the amortized cost of an access at distance d from the preceding access is O(log(d+1)). In addition, there is an O(n) initialization cost. The accesses include searches, insertions, and deletions.

AB - The following result is shown: On an n-node splay tree, the amortized cost of an access at distance d from the preceding access is O(log(d+1)). In addition, there is an O(n) initialization cost. The accesses include searches, insertions, and deletions.

KW - Amortized analysis

KW - Binary search tree

KW - Finger search tree

KW - Splay tree

UR - http://www.scopus.com/inward/record.url?scp=0034455378&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034455378&partnerID=8YFLogxK

U2 - 10.1137/S009753979732699X

DO - 10.1137/S009753979732699X

M3 - Article

VL - 30

SP - 44

EP - 85

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 1

ER -