New algorithms for the LCA problem and the binary tree reconstruction problem
type: Item
instance of: scholarly article
title: New algorithms for the LCA problem and the binary tree reconstruction problem
zbMATH Open document ID: 0807.68050
DOI: 10.1016/0020-0190(94)00058-1
author: Zhaofang Wen
published in: Information Processing Letters
publication date: 1994-08-03T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 612134
zbMATH Keywords: all nearest smaller value problem
zbMATH Keywords: \(R\)-forest
zbMATH Keywords: parallel algorithm design
zbMATH Keywords: LCA problem
zbMATH Keywords: binary tree reconstruction problem
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)00058-1
OpenAlex ID: W1969787801
cites work: Construction of a tree from its traversals in optimal time and space
cites work: Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
cites work: Two algorithms for constructing a binary tree from its traversals
cites work: A note on the reconstruction of a binary tree from its traversals
cites work: Fast Algorithms for Finding Nearest Common Ancestors
cites work: An optimal algorithm for reconstructing a binary tree
cites work: Q5585020
cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization
cites work: Q3974884
cites work: An Efficient Parallel Biconnectivity Algorithm
cites work: Q4036578
cites work: Deterministic Sampling–A New Technique for Fast Pattern Matching
cites work: A unifying look at data structures
cites work: Q3805897
description: scientific article; zbMATH DE number 612134