Time-optimal tree computations on sparse meshes
Publication:6184369
DOI10.1007/3-540-59071-4_48zbMath1528.68268OpenAlexW1885872773MaRDI QIDQ6184369
Himabindu Gurla, V. Bokka, D. Bhagavathi, Stephan Olariu, James L. Schwing
Publication date: 5 January 2024
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://digitalcommons.odu.edu/cgi/viewcontent.cgi?article=1123&context=computerscience_fac_pubs
decodingencodingbinary treesordered treestree reconstructiontraversalsmeshes with multiple broadcastingparentheses algorithms
Graph theory (including graph drawing) in computer science (68R10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Cites Work
- Lexicographic generation of ordered 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
- OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Time-optimal tree computations on sparse meshes