scientific article; zbMATH DE number 857346

MaRDI QIDQ4870196zbMATH OpenFDO

Authors Dmitri Burago

Publication date 14 May 1996

zbMATH Keywords

union-split-find problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A Lower Bound on the Complexity of the Union-Split-Find Problem
• Lower bounds for the union-find and the split-find problem on pointer machines
• scientific article; zbMATH DE number 4035134
• Lower bounds for union-split-find related problems on random access machines
• A lower bound on the single-operation worst-case time complexity of the union-find problem on intervals

Cited in

(4)

• Lower bounds for the union-find and the split-find problem on pointer machines
• Lower bounds for union-split-find related problems on random access machines
• scientific article; zbMATH DE number 4035134 (Why is no real title available?)
• A Lower Bound on the Complexity of the Union-Split-Find Problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4870196)