Equivalence between Priority Queues and Sorting

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

Standard

Equivalence between Priority Queues and Sorting. / Thorup, Mikkel.

In: Journal of the ACM, Vol. 54, No. 6, 2007, p. Article 28.

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

Harvard

Thorup, M 2007, 'Equivalence between Priority Queues and Sorting', Journal of the ACM, vol. 54, no. 6, pp. Article 28.

APA

Thorup, M. (2007). Equivalence between Priority Queues and Sorting. Journal of the ACM, 54(6), Article 28.

Vancouver

Thorup M. Equivalence between Priority Queues and Sorting. Journal of the ACM. 2007;54(6):Article 28.

Author

Thorup, Mikkel. / Equivalence between Priority Queues and Sorting. In: Journal of the ACM. 2007 ; Vol. 54, No. 6. pp. Article 28.

Bibtex

@article{8e406e87a51e4d448d43c318f5840701,
title = "Equivalence between Priority Queues and Sorting",
author = "Mikkel Thorup",
note = "Announced at FOCS'02",
year = "2007",
language = "English",
volume = "54",
pages = "Article 28",
journal = "Journal of the ACM",
issn = "0004-5411",
publisher = "Association for Computing Machinery",
number = "6",

}

RIS

TY - JOUR

T1 - Equivalence between Priority Queues and Sorting

AU - Thorup, Mikkel

N1 - Announced at FOCS'02

PY - 2007

Y1 - 2007

M3 - Journal article

VL - 54

SP - Article 28

JO - Journal of the ACM

JF - Journal of the ACM

SN - 0004-5411

IS - 6

ER -

ID: 98325235