Complexity of algorithm and operations on trees

DOI10.1016/0304-3975(93)90312-HzbMath0789.68071OpenAlexW183199228MaRDI QIDQ688696

Dulucq, Serge, 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)

Related Items

Complexity of algorithm and operations on trees

Cites Work

• Unnamed Item
• Complexity of algorithm and operations on trees
• A tight amortized bound for path reversal
• On the computational power of pushdown automata
• Amortized Computational Complexity
• Self-adjusting binary search trees
• Worst-case Analysis of Set Union Algorithms
• Finding Minimum Spanning Trees
• Efficiency of Equivalence Algorithms
• An improved equivalence algorithm