A comparison of two methods of encoding arrays

DOI10.1007/BF01931698zbMath0386.68018OpenAlexW2016726883MaRDI QIDQ4167534

Derick 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)

Related Items (1)

Encoding search trees in lists^†

Cites Work

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

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