Reconstructing a binary tree from its traversals in doubly logarithmic CREW time

DOI10.1006/JPDC.1995.1075zbMath0833.68036OpenAlexW2010914215MaRDI QIDQ1898217

Zhaofang Wen, Stephan Olariu, Michael Overstreet

Publication date: 24 September 1995

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/261f15255e56c1d560be1d22353ad14c7ef58ea0

zbMATH Keywords

binary treeoptimal parallel algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Distributed algorithms (68W15)

Related Items (3)

Time-optimal tree computations on sparse meshes ⋮ Time-optimal tree computations on sparse meshes ⋮ Optimal binary search trees

This page was built for publication: Reconstructing a binary tree from its traversals in doubly logarithmic CREW time