On the dynamic finger conjecture for splay trees. Part I: Splay sorting log n-block sequences

Research output: Contribution to journalArticle

Abstract

The splay tree is a binary search tree in which each access will cause some rotations to be performed on the tree. A special instance of the splay sorting problem related to the dynamic finger conjecture is investigated. The splay sort conjecture is proven in a variety of sequences. A number of features and several new techniques for proving amortized results are introduced.

Original languageEnglish (US)
Pages (from-to)1-43
Number of pages43
JournalSIAM Journal on Computing
Volume30
Issue number1
DOIs
StatePublished - 2000

Fingerprint

Sorting
Binary Search Tree
Sort

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 I : Splay sorting log n-block sequences. / Cole, R.; Mishra, B.; Schmidt, J.; Siegel, A.

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

Research output: Contribution to journalArticle

@article{e8ea1c28a52e4e499239f2dd5d600633,
title = "On the dynamic finger conjecture for splay trees. Part I: Splay sorting log n-block sequences",
abstract = "The splay tree is a binary search tree in which each access will cause some rotations to be performed on the tree. A special instance of the splay sorting problem related to the dynamic finger conjecture is investigated. The splay sort conjecture is proven in a variety of sequences. A number of features and several new techniques for proving amortized results are introduced.",
keywords = "Amortized analysis, Binary search tree, Finger search tree, Splay tree",
author = "R. Cole and B. Mishra and J. Schmidt and A. Siegel",
year = "2000",
doi = "10.1137/S0097539797326988",
language = "English (US)",
volume = "30",
pages = "1--43",
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 I

T2 - Splay sorting log n-block sequences

AU - Cole, R.

AU - Mishra, B.

AU - Schmidt, J.

AU - Siegel, A.

PY - 2000

Y1 - 2000

N2 - The splay tree is a binary search tree in which each access will cause some rotations to be performed on the tree. A special instance of the splay sorting problem related to the dynamic finger conjecture is investigated. The splay sort conjecture is proven in a variety of sequences. A number of features and several new techniques for proving amortized results are introduced.

AB - The splay tree is a binary search tree in which each access will cause some rotations to be performed on the tree. A special instance of the splay sorting problem related to the dynamic finger conjecture is investigated. The splay sort conjecture is proven in a variety of sequences. A number of features and several new techniques for proving amortized results are introduced.

KW - Amortized analysis

KW - Binary search tree

KW - Finger search tree

KW - Splay tree

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

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

U2 - 10.1137/S0097539797326988

DO - 10.1137/S0097539797326988

M3 - Article

VL - 30

SP - 1

EP - 43

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 1

ER -