Integer priority queues with decrease key in constant time and the single source shortest paths problem

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

Standard

Integer priority queues with decrease key in constant time and the single source shortest paths problem. / Thorup, Mikkel.

Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC). 2003. p. 149-158.

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

Harvard

Thorup, M 2003, Integer priority queues with decrease key in constant time and the single source shortest paths problem. in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC). pp. 149-158. https://doi.org/10.1145/780542.780566

APA

Thorup, M. (2003). Integer priority queues with decrease key in constant time and the single source shortest paths problem. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC) (pp. 149-158) https://doi.org/10.1145/780542.780566

Vancouver

Thorup M. Integer priority queues with decrease key in constant time and the single source shortest paths problem. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC). 2003. p. 149-158 https://doi.org/10.1145/780542.780566

Author

Thorup, Mikkel. / Integer priority queues with decrease key in constant time and the single source shortest paths problem. Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC). 2003. pp. 149-158

Bibtex

@inproceedings{3eaab609068a406080c138ce96a4ea2a,
title = "Integer priority queues with decrease key in constant time and the single source shortest paths problem",
author = "Mikkel Thorup",
note = "Covered by teTho04:dec-key",
year = "2003",
doi = "10.1145/780542.780566",
language = "English",
pages = "149--158",
booktitle = "Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC)",

}

RIS

TY - GEN

T1 - Integer priority queues with decrease key in constant time and the single source shortest paths problem

AU - Thorup, Mikkel

N1 - Covered by teTho04:dec-key

PY - 2003

Y1 - 2003

U2 - 10.1145/780542.780566

DO - 10.1145/780542.780566

M3 - Article in proceedings

SP - 149

EP - 158

BT - Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC)

ER -

ID: 98320593