Reconstructing Binary Trees in Parallel

Ramtin Afshar,Michael T. Goodrich,Pedro Matias,Martha C. Osegueda

SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures Virtual Event USA July, 2020（2020）

引用 8|浏览95

暂无评分

摘要

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.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要