New algorithms for the LCA problem and the binary tree reconstruction problem

DOI10.1016/0020-0190(94)00058-1zbMath0807.68050OpenAlexW1969787801MaRDI QIDQ1328757

Zhaofang Wen

Publication date: 3 August 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00058-1

zbMATH Keywords

parallel algorithm design\(R\)-forestall nearest smaller value problembinary tree reconstruction problemLCA problem

Mathematics Subject Classification ID

Data structures (68P05) Distributed algorithms (68W15)

Related Items (2)

The lowest common ancestor problem on a tree with an unfixed root ⋮ A \(\min\)-\(\max\) relation in flowgraphs and some applications

Cites Work

• Construction of a tree from its traversals in optimal time and space
• Two algorithms for constructing a binary tree from its traversals
• An optimal algorithm for reconstructing a binary tree
• A note on the reconstruction of a binary tree from its traversals
• Deterministic Sampling–A New Technique for Fast Pattern Matching
• Fast Algorithms for Finding Nearest Common Ancestors
• An Efficient Parallel Biconnectivity Algorithm
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• A unifying look at data structures
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New algorithms for the LCA problem and the binary tree reconstruction problem