On efficient entreeings

DOI10.1007/BF01179370MaRDI QIDQ1323334zbMATH OpenOpenAlexFDO

Authors Paul S. Amerins, Ricardo Baeza-Yates, D. Wood

Publication date 10 May 1994

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01179370

zbMATH Keywords

data structuredata encodingcomplete treesentreeing

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Data structures (68P05)

Recommendations

• On binary tree encodements
• A uniform paradigm to succinctly encode various families of trees
• Entropy and optimal compression of some general plane trees
• A compact encoding of unordered binary trees
• Encoding data structures

Cites work

• Cost Trade-offs in Graph Embeddings, with Applications
• Data encodings and their costs
• Encoding Data Structures in Trees
• Storage representations for tree-like data structures

Cited in

(1)

• On the intricacy of avoiding multiple-entry arrays

This page was built for publication: On efficient entreeings

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