Standard
Faster deterministic fully-dynamic graph connectivity. / Wulff-Nilsen, Christian.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / Sanjeev Khanna. Association for Computing Machinery, 2013. p. 1757-1769.
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Wulff-Nilsen, C 2013,
Faster deterministic fully-dynamic graph connectivity. in S Khanna (ed.),
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery, pp. 1757-1769, Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, United States,
06/01/2013.
https://doi.org/10.1137/1.9781611973105.126
APA
Wulff-Nilsen, C. (2013).
Faster deterministic fully-dynamic graph connectivity. In S. Khanna (Ed.),
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1757-1769). Association for Computing Machinery.
https://doi.org/10.1137/1.9781611973105.126
Vancouver
Wulff-Nilsen C.
Faster deterministic fully-dynamic graph connectivity. In Khanna S, editor, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery. 2013. p. 1757-1769
https://doi.org/10.1137/1.9781611973105.126
Author
Wulff-Nilsen, Christian. / Faster deterministic fully-dynamic graph connectivity. Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. editor / Sanjeev Khanna. Association for Computing Machinery, 2013. pp. 1757-1769
Bibtex
@inproceedings{bbfc45a5533e420285a87dcd32796f48,
title = "Faster deterministic fully-dynamic graph connectivity",
author = "Christian Wulff-Nilsen",
year = "2013",
doi = "10.1137/1.9781611973105.126",
language = "English",
isbn = "978-1-61197-251-1",
pages = "1757--1769",
editor = "Sanjeev Khanna",
booktitle = "Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms",
publisher = "Association for Computing Machinery",
note = "null ; Conference date: 06-01-2013 Through 08-01-2013",
}
RIS
TY - GEN
T1 - Faster deterministic fully-dynamic graph connectivity
AU - Wulff-Nilsen, Christian
N1 - Conference code: 24
PY - 2013
Y1 - 2013
U2 - 10.1137/1.9781611973105.126
DO - 10.1137/1.9781611973105.126
M3 - Article in proceedings
SN - 978-1-61197-251-1
SP - 1757
EP - 1769
BT - Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
A2 - Khanna, Sanjeev
PB - Association for Computing Machinery
Y2 - 6 January 2013 through 8 January 2013
ER -
