Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n<sup>1/2

Article Details
Title:	Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n^{1/2 - ε})-time
Article URLs:	https://doi.org/10.1145/3055399.3055447
Alternative Article URLs:
Authors:	Danupon Nanongkai	KTH Royal Institute of Technology
Authors:	Thatchaphol Saranurak	KTH Royal Institute of Technology
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/stoc/NanongkaiS17
Author Comments:

ACM Symposium on Theory of Computing, STOC 2017