Reconstructing a binary tree from its traversals in doubly logarithmic CREW time
type: Item
instance of: scholarly article
title: Reconstructing a binary tree from its traversals in doubly logarithmic CREW time
zbMATH Open document ID: 0833.68036
author: Stephan Olariu
author: Michael Overstreet
author: Zhaofang Wen
published in: Journal of Parallel and Distributed Computing
publication date: 1995-09-24T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 799687
zbMATH Keywords: binary tree
zbMATH Keywords: optimal parallel algorithms
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2010914215
DOI: 10.1006/JPDC.1995.1075
Recommended article: An optimal algorithm for reconstructing a binary tree
Recommended article: A note on the reconstruction of a binary tree from its traversals
Recommended article: Efficient algorithms for tree reconstruction
Recommended article: Construction of a tree from its traversals in optimal time and space
Recommended article: Parallel algorithms for tree traversals
description: scientific article; zbMATH DE number 799687