A comparison of two methods of encoding arrays

DOI10.1007/BF01931698MaRDI QIDQ4167534zbMATH OpenOpenAlexFDO

Authors D. Wood

Publication date 1978

Published in BIT (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Trees (05C05) Data structures (68P05)

Cites work

• Bounds on the costs of data encodings
• Data encodings and their costs
• Encoding Data Structures in Trees
• Preserving average proximity in arrays
• Preserving Proximity in Arrays
• Pyramids: A data type for matrix representation in Pascal
• Quad trees: A data structure for retrieval by composite keys

Cited in

(1)

• Encoding search trees in lists^†

This page was built for publication: A comparison of two methods of encoding arrays

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