OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES
From MaRDI portal
Publication:4020276
DOI10.1142/S0129054192000024zbMath0772.68047OpenAlexW2164966011MaRDI QIDQ4020276
Stephan Olariu, Jingyuan Zhang, James L. Schwing
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
Circuits, networks (94C99) Theory of data (68P99) Data structures (68P05) Distributed algorithms (68W15)
Related Items
A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗ ⋮ Time-optimal tree computations on sparse meshes ⋮ Time-optimal tree computations on sparse meshes