Complexity of algorithm and operations on trees

DOI10.1016/0304-3975(93)90312-HzbMATH Open0789.68071OpenAlexW183199228MaRDI QIDQ688696FDOQ688696

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

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

zbMATH Keywords

mutual exclusion algorithmoperations on treespath compressionpaths reversal

Mathematics Subject Classification ID

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

Cites Work

• On the computational power of pushdown automata
• Self-adjusting binary search trees
• Worst-case Analysis of Set Union Algorithms
• Efficiency of Equivalence Algorithms
• Finding Minimum Spanning Trees
• Amortized Computational Complexity
• An improved equivalence algorithm
• Title not available (Why is that?)
• A tight amortized bound for path reversal
• Complexity of algorithm and operations on trees

Cited In (10)

• Complexity of algorithm and operations on trees
• Transactions on Rough Sets III
• An asymptotic study for path reversal.
• Complexity analysis of tree share structure
• On the Expected Performance of Path Compression Algorithms
• On the complexity of computing treelength
• Title not available (Why is that?)
• Title not available (Why is that?)
• Top-Down Analysis of Path Compression
• The recognition of union trees

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)