Reconstructing a binary tree from its traversals in doubly logarithmic CREW time (Q1898217)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reconstructing a binary tree from its traversals in doubly logarithmic CREW time |
scientific article; zbMATH DE number 799687
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reconstructing a binary tree from its traversals in doubly logarithmic CREW time |
scientific article; zbMATH DE number 799687 |
Statements
Reconstructing a binary tree from its traversals in doubly logarithmic CREW time (English)
0 references
24 September 1995
0 references
binary tree
0 references
optimal parallel algorithms
0 references
