Reconstructing Binary Trees in Parallel

We study the parallel query complexity of reconstructing binary trees from simple queries involving their nodes. We show that a querier can efficiently reconstruct a binary tree with a logarithmic number of rounds and quasilinear number of queries, with high probability, for various types of queries.

[1]  Eugene L. Lawler,et al.  Determining the Evolutionary Tree Using Experiments , 1996, J. Algorithms.

[2]  Jean Honorio,et al.  Reconstructing a Bounded-Degree Directed Tree Using Path Queries , 2019, 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton).