Time-optimal tree computations on sparse meshes

DOI10.1016/S0166-218X(97)00135-2zbMath0879.68078OpenAlexW2049114937MaRDI QIDQ1364469

V. Bokka, D. Bhagavathi, Stephan Olariu, Himabindu Gurla, James L. Schwing

Publication date: 17 December 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

encodingtree reconstructionparentheses matchingmesh with multiple broadcasting architecture

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Lexicographic generation of ordered trees
• Reconstructing a binary tree from its traversals in doubly logarithmic CREW time
• Convexity problems on meshes with multiple broadcasting
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES

This page was built for publication: Time-optimal tree computations on sparse meshes