Dynamic Ordered Sets with Exponential Search Trees

Research output: Contribution to journal › Journal article › Research › peer-review

Standard

Dynamic Ordered Sets with Exponential Search Trees. / Andersson, Arne; Thorup, Mikkel.

In: Journal of the ACM, Vol. 54, No. 3, 2007, p. Article 13.

Research output: Contribution to journal › Journal article › Research › peer-review

Harvard

Andersson, A & Thorup, M 2007, 'Dynamic Ordered Sets with Exponential Search Trees', Journal of the ACM, vol. 54, no. 3, pp. Article 13.

APA

Andersson, A., & Thorup, M. (2007). Dynamic Ordered Sets with Exponential Search Trees. Journal of the ACM, 54(3), Article 13.

Vancouver

Andersson A, Thorup M. Dynamic Ordered Sets with Exponential Search Trees. Journal of the ACM. 2007;54(3):Article 13.

Author

Andersson, Arne ; Thorup, Mikkel. / Dynamic Ordered Sets with Exponential Search Trees. In: Journal of the ACM. 2007 ; Vol. 54, No. 3. pp. Article 13.

Bibtex

@article{60fe94ea22de4c3f9ea7156b2c33eebd,
title = "Dynamic Ordered Sets with Exponential Search Trees",
author = "Arne Andersson and Mikkel Thorup",
note = "Announced at STOC'00 and SODA'01",
year = "2007",
language = "English",
volume = "54",
pages = "Article 13",
journal = "Journal of the ACM",
issn = "0004-5411",
publisher = "Association for Computing Machinery",
number = "3",

}

RIS

TY - JOUR

T1 - Dynamic Ordered Sets with Exponential Search Trees

AU - Andersson, Arne

AU - Thorup, Mikkel

N1 - Announced at STOC'00 and SODA'01

PY - 2007

Y1 - 2007

M3 - Journal article

VL - 54

SP - Article 13

JO - Journal of the ACM

JF - Journal of the ACM

SN - 0004-5411

IS - 3

ER -

ID: 98324761