Tampere University of Technology

TUTCRIS Research Portal

Assembling approximately optimal binary search trees efficiently using arithmetics

Research output: Contribution to journalArticleScientificpeer-review

Standard

Assembling approximately optimal binary search trees efficiently using arithmetics. / Kujala, J.

In: Information Processing Letters, Vol. 109, No. 16, 2009, p. 962-966.

Research output: Contribution to journalArticleScientificpeer-review

Harvard

Kujala, J 2009, 'Assembling approximately optimal binary search trees efficiently using arithmetics', Information Processing Letters, vol. 109, no. 16, pp. 962-966. https://doi.org/10.1016/j.ipl.2008.08.012

APA

Vancouver

Author

Kujala, J. / Assembling approximately optimal binary search trees efficiently using arithmetics. In: Information Processing Letters. 2009 ; Vol. 109, No. 16. pp. 962-966.

Bibtex - Download

@article{4faad81949674a819a2475b75c1f6ee2,
title = "Assembling approximately optimal binary search trees efficiently using arithmetics",
author = "J. Kujala",
note = "Contribution: organisation=ohj,FACT1=1",
year = "2009",
doi = "10.1016/j.ipl.2008.08.012",
language = "English",
volume = "109",
pages = "962--966",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "16",

}

RIS (suitable for import to EndNote) - Download

TY - JOUR

T1 - Assembling approximately optimal binary search trees efficiently using arithmetics

AU - Kujala, J.

N1 - Contribution: organisation=ohj,FACT1=1

PY - 2009

Y1 - 2009

U2 - 10.1016/j.ipl.2008.08.012

DO - 10.1016/j.ipl.2008.08.012

M3 - Article

VL - 109

SP - 962

EP - 966

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 16

ER -