Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Seth Pettie. An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification. Combinatorica, 26(2):207-230, 2006. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: An Inverse-Ackermann Style Lower Bound for the Online Minimum Spanning TreeSeth Pettie. focs 2002: 155 [doi] Sensitivity Analysis of Minimum Spanning Trees in Sub-inverse-Ackermann TimeSeth Pettie. isaac 2005: 964-973 [doi] Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann TimeSeth Pettie. jgaa, 19(1):375-391, 2015. [doi]
The following publications are possibly variants of this publication: