On the Dynamic Finger Conjecture for splay trees extended abstract

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The Dynamic Finger Conjecture for splay trees states that the cost of m searches on an n-node splay tree is O(m + n + Σ log(|ij - ij-1$/|), where the sum is from i = 1 to m and the jth access is to the ijth item in symmetric order (the i0th item is the item originally at the root of the tree). In other words, the amortized cost of an access is O(1 + log d), where the current access is at distance d from the previous access (distance being measured in terms of the number of items straddled by the two successive accesses); in addition, there is an additive O(n) initialization cost. A bound on the cost is obtained.

Original languageEnglish (US)
Title of host publicationProc 22nd Annu ACM Symp Theory Comput
PublisherPubl by ACM
Pages8-17
Number of pages10
ISBN (Print)0897913612
StatePublished - 1990
EventProceedings of the 22nd Annual ACM Symposium on Theory of Computing - Baltimore, MD, USA
Duration: May 14 1990May 16 1990

Other

OtherProceedings of the 22nd Annual ACM Symposium on Theory of Computing
CityBaltimore, MD, USA
Period5/14/905/16/90

Fingerprint

Costs

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Cole, R. (1990). On the Dynamic Finger Conjecture for splay trees extended abstract. In Proc 22nd Annu ACM Symp Theory Comput (pp. 8-17). Publ by ACM.

On the Dynamic Finger Conjecture for splay trees extended abstract. / Cole, Richard.

Proc 22nd Annu ACM Symp Theory Comput. Publ by ACM, 1990. p. 8-17.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cole, R 1990, On the Dynamic Finger Conjecture for splay trees extended abstract. in Proc 22nd Annu ACM Symp Theory Comput. Publ by ACM, pp. 8-17, Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, 5/14/90.
Cole R. On the Dynamic Finger Conjecture for splay trees extended abstract. In Proc 22nd Annu ACM Symp Theory Comput. Publ by ACM. 1990. p. 8-17
Cole, Richard. / On the Dynamic Finger Conjecture for splay trees extended abstract. Proc 22nd Annu ACM Symp Theory Comput. Publ by ACM, 1990. pp. 8-17
@inproceedings{84d815f463104ea2a50228d2ad6bba59,
title = "On the Dynamic Finger Conjecture for splay trees extended abstract",
abstract = "The Dynamic Finger Conjecture for splay trees states that the cost of m searches on an n-node splay tree is O(m + n + Σ log(|ij - ij-1$/|), where the sum is from i = 1 to m and the jth access is to the ijth item in symmetric order (the i0th item is the item originally at the root of the tree). In other words, the amortized cost of an access is O(1 + log d), where the current access is at distance d from the previous access (distance being measured in terms of the number of items straddled by the two successive accesses); in addition, there is an additive O(n) initialization cost. A bound on the cost is obtained.",
author = "Richard Cole",
year = "1990",
language = "English (US)",
isbn = "0897913612",
pages = "8--17",
booktitle = "Proc 22nd Annu ACM Symp Theory Comput",
publisher = "Publ by ACM",

}

TY - GEN

T1 - On the Dynamic Finger Conjecture for splay trees extended abstract

AU - Cole, Richard

PY - 1990

Y1 - 1990

N2 - The Dynamic Finger Conjecture for splay trees states that the cost of m searches on an n-node splay tree is O(m + n + Σ log(|ij - ij-1$/|), where the sum is from i = 1 to m and the jth access is to the ijth item in symmetric order (the i0th item is the item originally at the root of the tree). In other words, the amortized cost of an access is O(1 + log d), where the current access is at distance d from the previous access (distance being measured in terms of the number of items straddled by the two successive accesses); in addition, there is an additive O(n) initialization cost. A bound on the cost is obtained.

AB - The Dynamic Finger Conjecture for splay trees states that the cost of m searches on an n-node splay tree is O(m + n + Σ log(|ij - ij-1$/|), where the sum is from i = 1 to m and the jth access is to the ijth item in symmetric order (the i0th item is the item originally at the root of the tree). In other words, the amortized cost of an access is O(1 + log d), where the current access is at distance d from the previous access (distance being measured in terms of the number of items straddled by the two successive accesses); in addition, there is an additive O(n) initialization cost. A bound on the cost is obtained.

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

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

M3 - Conference contribution

SN - 0897913612

SP - 8

EP - 17

BT - Proc 22nd Annu ACM Symp Theory Comput

PB - Publ by ACM

ER -