ACM Symposium on Theory of Computing, STOC 2017


Article Details
Title: Fully-dynamic minimum spanning forest with improved worst-case update time
Article URLs:
Alternative Article URLs:
Authors: Christian Wulff-Nilsen
  • University of Copenhagen, Department of Computer Science
Sharing: Unknown
Verification: Author has not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/Wulff-Nilsen17
Author Comments:

Discuss this paper and its artifacts below