Lower bounds for the union-find and the split-find problem on pointer machines
From MaRDI portal
Publication:1915507
DOI10.1006/jcss.1996.0008zbMath0846.68035OpenAlexW2103361121MaRDI QIDQ1915507
Publication date: 16 July 1996
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1996.0008
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
A lower bound on the single-operation worst-case time complexity of the union-find problem on intervals ⋮ Efficient algorithms for the temporal precedence problem ⋮ Optimal decremental connectivity in planar graphs ⋮ Two linear time Union--Find strategies for image processing ⋮ The Level-Ancestor problem on pure pointer machines ⋮ Efficient Union-Find for planar graphs and other sparse graph classes ⋮ An optimal data structure to handle dynamic environments in non-deterministic computations
This page was built for publication: Lower bounds for the union-find and the split-find problem on pointer machines
