Encoding search trees in lists<sup>†</sup> (Q3939219): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Preserving average proximity in arrays / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Data encodings and their costs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Encoding Data Structures in Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Uniform data encodings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds on the costs of data encodings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Storage representations for tree-like data structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Encoding search trees in lists<sup>†</sup> / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A comparison of two methods of encoding arrays / rank | |||
Normal rank |
Latest revision as of 15:17, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Encoding search trees in lists<sup>†</sup> |
scientific article |
Statements
Encoding search trees in lists<sup>†</sup> (English)
0 references
1982
0 references
data encoding
0 references
optimal encodings
0 references
translation of logical data structures to physical storage structures
0 references