Complexity of algorithm and operations on trees

DOI10.1016/0304-3975(93)90312-HMaRDI QIDQ688696zbMATH OpenOpenAlexFDO

Authors Serge Dulucq, Sophie Gire

Publication date 12 December 1993

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(93)90312-h

zbMATH Keywords

mutual exclusion algorithmoperations on treespath compressionpaths reversal

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Recommendations

• A tight amortized bound for path reversal
• On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
• scientific article; zbMATH DE number 3907792
• Top-Down Analysis of Path Compression
• Worst-case Analysis of Set Union Algorithms

Cites work

• scientific article; zbMATH DE number 4003522 (Why is no real title available?)
• A tight amortized bound for path reversal
• Amortized Computational Complexity
• An improved equivalence algorithm
• Complexity of algorithm and operations on trees
• Efficiency of Equivalence Algorithms
• Finding Minimum Spanning Trees
• On the computational power of pushdown automata
• Self-adjusting binary search trees
• Worst-case Analysis of Set Union Algorithms

Cited in

(10)

• Complexity analysis of tree share structure
• The recognition of union trees
• An asymptotic study for path reversal.
• scientific article; zbMATH DE number 2044508 (Why is no real title available?)
• Top-Down Analysis of Path Compression
• On the Expected Performance of Path Compression Algorithms
• Transactions on Rough Sets III
• Complexity of algorithm and operations on trees
• On the complexity of computing treelength
• scientific article; zbMATH DE number 844505 (Why is no real title available?)

This page was built for publication: Complexity of algorithm and operations on trees

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