Faster worst case deterministic dynamic connectivity

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Standard

Faster worst case deterministic dynamic connectivity. / Kejlberg-Rasmussen, Casper; Kopelowitz, Tsvi; Pettie, Seth; Thorup, Mikkel.

24th Annual European Symposium on Algorithms (ESA 2016). ed. / Piotr Sankowski; Christos Zaroliagis. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. p. 53:1-53:15 53 (Leibniz International Proceedings in Informatics, Vol. 57).

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Harvard

Kejlberg-Rasmussen, C, Kopelowitz, T, Pettie, S & Thorup, M 2016, Faster worst case deterministic dynamic connectivity. in P Sankowski & C Zaroliagis (eds), 24th Annual European Symposium on Algorithms (ESA 2016)., 53, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics, vol. 57, pp. 53:1-53:15, European symposium on algorithms, Denmark, 22/08/2016. https://doi.org/10.4230/LIPIcs.ESA.2016.53

APA

Kejlberg-Rasmussen, C., Kopelowitz, T., Pettie, S., & Thorup, M. (2016). Faster worst case deterministic dynamic connectivity. In P. Sankowski, & C. Zaroliagis (Eds.), 24th Annual European Symposium on Algorithms (ESA 2016) (pp. 53:1-53:15). [53] Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Leibniz International Proceedings in Informatics, Vol.. 57 https://doi.org/10.4230/LIPIcs.ESA.2016.53

Vancouver

Kejlberg-Rasmussen C, Kopelowitz T, Pettie S, Thorup M. Faster worst case deterministic dynamic connectivity. In Sankowski P, Zaroliagis C, editors, 24th Annual European Symposium on Algorithms (ESA 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 2016. p. 53:1-53:15. 53. (Leibniz International Proceedings in Informatics, Vol. 57). https://doi.org/10.4230/LIPIcs.ESA.2016.53

Author

Kejlberg-Rasmussen, Casper ; Kopelowitz, Tsvi ; Pettie, Seth ; Thorup, Mikkel. / Faster worst case deterministic dynamic connectivity. 24th Annual European Symposium on Algorithms (ESA 2016). editor / Piotr Sankowski ; Christos Zaroliagis. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. pp. 53:1-53:15 (Leibniz International Proceedings in Informatics, Vol. 57).

Bibtex

@inproceedings{15482fca85b5452ab445186af747081c,
title = "Faster worst case deterministic dynamic connectivity",
author = "Casper Kejlberg-Rasmussen and Tsvi Kopelowitz and Seth Pettie and Mikkel Thorup",
year = "2016",
doi = "10.4230/LIPIcs.ESA.2016.53",
language = "English",
isbn = "978-3-95977-015-6",
series = "Leibniz International Proceedings in Informatics",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
pages = "53:1--53:15",
editor = "Piotr Sankowski and Christos Zaroliagis",
booktitle = "24th Annual European Symposium on Algorithms (ESA 2016)",

}

RIS

TY - GEN

T1 - Faster worst case deterministic dynamic connectivity

AU - Kejlberg-Rasmussen, Casper

AU - Kopelowitz, Tsvi

AU - Pettie, Seth

AU - Thorup, Mikkel

PY - 2016

Y1 - 2016

U2 - 10.4230/LIPIcs.ESA.2016.53

DO - 10.4230/LIPIcs.ESA.2016.53

M3 - Article in proceedings

SN - 978-3-95977-015-6

T3 - Leibniz International Proceedings in Informatics

SP - 53:1-53:15

BT - 24th Annual European Symposium on Algorithms (ESA 2016)

A2 - Sankowski, Piotr

A2 - Zaroliagis, Christos

PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik

ER -

ID: 165567060