Equivalence between Priority Queues and Sorting

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Standard

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

Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS). 2002. p. 125-134.

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Harvard

Thorup, M 2002, Equivalence between Priority Queues and Sorting. in Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS). pp. 125-134.

APA

Thorup, M. (2002). Equivalence between Priority Queues and Sorting. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS) (pp. 125-134)

Vancouver

Thorup M. Equivalence between Priority Queues and Sorting. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS). 2002. p. 125-134

Author

Thorup, Mikkel. / Equivalence between Priority Queues and Sorting. Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS). 2002. pp. 125-134

Bibtex

@inproceedings{de86ac64d2794450923a0508d7c4a6f9,

title = "Equivalence between Priority Queues and Sorting",

author = "Mikkel Thorup",

note = "Covered by teTho07:pq-red",

year = "2002",

language = "English",

pages = "125--134",

booktitle = "Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS)",

}

RIS

TY - GEN

T1 - Equivalence between Priority Queues and Sorting

AU - Thorup, Mikkel

N1 - Covered by teTho07:pq-red

PY - 2002

Y1 - 2002

M3 - Article in proceedings

SP - 125

EP - 134

BT - Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS)

ER -

ID: 98320229