The cost of offline binary search tree algorithms and the complexity of the request sequence

Research output: Contribution to journal › Article › Scientific › peer-review

2 Citations (Scopus)

Translated title of the contribution	The cost of offline binary search tree algorithms and the complexity of the request sequence
Original language	English
Pages (from-to)	231-239
Journal	Theoretical Computer Science
Volume	393
Issue number	1-3
DOIs	https://doi.org/10.1016/j.tcs.2007.12.015
Publication status	Published - 2008
Publication type	A1 Journal article-refereed

Publication forum classification

@article{0a9522ebf2634dfdab437ed539368c7b,

title = "The cost of offline binary search tree algorithms and the complexity of the request sequence",

author = "J. Kujala and T. Elomaa",

note = "Contribution: organisation=ohj,FACT1=1",

year = "2008",

doi = "10.1016/j.tcs.2007.12.015",

language = "English",

volume = "393",

pages = "231--239",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - The cost of offline binary search tree algorithms and the complexity of the request sequence

AU - Kujala, J.

AU - Elomaa, T.

N1 - Contribution: organisation=ohj,FACT1=1

PY - 2008

Y1 - 2008

U2 - 10.1016/j.tcs.2007.12.015

DO - 10.1016/j.tcs.2007.12.015

M3 - Article

SN - 0304-3975

VL - 393

SP - 231

EP - 239

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1-3

ER -