Time-optimal tree computations on sparse meshes

DOI10.1016/S0166-218X(97)00135-2MaRDI QIDQ1364469zbMATH OpenOpenAlexFDO

Authors D. Bhagavathi, V. Bokka, Himabindu Gurla, Stephan Olariu, 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

encodingmesh with multiple broadcasting architectureparentheses matchingtree reconstruction

Mathematics Subject Classification ID

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

Recommendations

• Solving tree problems on a mesh-connected processor array
• scientific article; zbMATH DE number 742956
• OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES
• Scheduling tree dags on parallel architectures

Cites work

• Convexity problems on meshes with multiple broadcasting
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 922844 (Why is no real title available?)
• Lexicographic generation of ordered trees
• OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES
• Reconstructing a binary tree from its traversals in doubly logarithmic CREW time
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes

Cited in

(3)

• scientific article; zbMATH DE number 3876584 (Why is no real title available?)
• Solving tree problems on a mesh-connected processor array
• Time-optimal tree computations on sparse meshes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364469)