Bijections for Cayley trees, spanning trees, and their q-analogues
Journal of Combinatorial Theory Series A
Tree codes that preserve increases and degree sequences
Discrete Mathematics
An introduction to parallel algorithms
An introduction to parallel algorithms
Computing Prüfer codes efficiently in parallel
Discrete Applied Mathematics
Synthesis of Parallel Algorithms
Synthesis of Parallel Algorithms
Introduction to Algorithms
A Parallel Algorithm for Constructing a Labeled Tree
IEEE Transactions on Parallel and Distributed Systems
Full fault dictionary storage based on labeled tree encoding
VTS '96 Proceedings of the 14th IEEE VLSI Test Symposium
PRIX: Indexing And Querying XML Using Prüfer Sequences
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
PRAM-on-chip: first commitment to silicon
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Theoretical Computer Science
Parallel Algorithms for Dandelion-Like Codes
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
String coding of trees with locality and heritability
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Distributed maintenance of a spanning tree using labeled tree encoding
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Parallel algorithms for encoding and decoding blob code
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
| Hi-index | 0.00 |
The Dandelion-like codes are eight bijections between labeled trees and strings of node labels. The literature contains optimal sequential algorithms for these bijections, but no parallel algorithms have been reported. In this paper the first parallel encoding and decoding algorithms for Dandelion-like codes are presented. Namely, a unique encoding algorithm and a unique decoding algorithm, which when properly parameterized, can be used for all Dandelion-like codes, are designed. These algorithms are optimal in the sequential setting. The encoding algorithm implementation on an EREW PRAM is optimal, while the efficient implementation of the decoding algorithm requires concurrent reading.