Meldable RAM priority queues and minimum directed spanning trees

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

Standard

Meldable RAM priority queues and minimum directed spanning trees. / Mendelson, Ran; Thorup, Mikkel; Zwick, Uri.

Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA). 2003. p. 40-48.

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

Harvard

Mendelson, R, Thorup, M & Zwick, U 2003, Meldable RAM priority queues and minimum directed spanning trees. in Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA). pp. 40-48.

APA

Mendelson, R., Thorup, M., & Zwick, U. (2003). Meldable RAM priority queues and minimum directed spanning trees. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 40-48)

Vancouver

Mendelson R, Thorup M, Zwick U. Meldable RAM priority queues and minimum directed spanning trees. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA). 2003. p. 40-48

Author

Mendelson, Ran ; Thorup, Mikkel ; Zwick, Uri. / Meldable RAM priority queues and minimum directed spanning trees. Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA). 2003. pp. 40-48

Bibtex

@inproceedings{25128fbb21b64f83bece0db3ffa926d2,
title = "Meldable RAM priority queues and minimum directed spanning trees",
author = "Ran Mendelson and Mikkel Thorup and Uri Zwick",
note = "Covered by teMTTZ06",
year = "2003",
language = "English",
pages = "40--48",
booktitle = "Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA)",

}

RIS

TY - GEN

T1 - Meldable RAM priority queues and minimum directed spanning trees

AU - Mendelson, Ran

AU - Thorup, Mikkel

AU - Zwick, Uri

N1 - Covered by teMTTZ06

PY - 2003

Y1 - 2003

M3 - Article in proceedings

SP - 40

EP - 48

BT - Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA)

ER -

ID: 98321452