Christian Wulff-Nilsen. Faster Deterministic Fully-Dynamic Graph Connectivity. In Sanjeev Khanna, editor, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013. pages 1757-1769, SIAM, 2013. [doi]
@inproceedings{Wulff-Nilsen13a,
title = {Faster Deterministic Fully-Dynamic Graph Connectivity},
author = {Christian Wulff-Nilsen},
year = {2013},
url = {http://knowledgecenter.siam.org/0236-000046/},
researchr = {https://researchr.org/publication/Wulff-Nilsen13a},
cites = {0},
citedby = {0},
pages = {1757-1769},
booktitle = {Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013},
editor = {Sanjeev Khanna},
publisher = {SIAM},
}