OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES

DOI10.1142/S0129054192000024MaRDI QIDQ4020276zbMATH OpenOpenAlexFDO

Authors Stephan Olariu, James L. Schwing, Jingyuan Zhang

Publication date 16 January 1993

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054192000024

zbMATH Keywords

binary tree encoding/decoding problemEREW-PRAMEuler-tourintegrated circuit design

Mathematics Subject Classification ID

Data structures (68P05) Theory of data (68P99) Distributed algorithms (68W15) Circuits, networks (94C99)

Recommendations

• Tree approximation and optimal encoding
• Parallel algorithms for tree accumulations
• scientific article; zbMATH DE number 54593
• Parallel Algorithms with Optimal Speedup for Bounded Treewidth
• Parallel algorithms with optimal speedup for bounded treewidth
• A parallel algorithm for optimum height-limited alphabetic binary trees
• scientific article; zbMATH DE number 3958748
• The Parallel Complexity of Tree Embedding Problems
• scientific article; zbMATH DE number 2087827

Cited in

(11)

• Time-optimal tree computations on sparse meshes
• Bit-optimal decoding of codes whose Tanner graphs are trees
• Accelerated partial decoding in wavelet trees
• scientific article; zbMATH DE number 2089399 (Why is no real title available?)
• Parallel algorithms for encoding and decoding Blob code
• A New Coding Algorithm for Trees
• A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗
• Constructing Huffman Trees in Parallel
• Time-optimal tree computations on sparse meshes
• Unified parallel encoding and decoding algorithms for Dandelion-like codes
• Bijective linear time coding and decoding for \(k\)-trees

This page was built for publication: OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES

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