The following pages link to Data encodings and their costs (Q1139942):
Displaying 15 items.
- Minimal storage representations for binary relations (Q789170) (← links)
- Uniform data encodings (Q1134520) (← links)
- Simulations among multidimensional Turing machines (Q1165001) (← links)
- A fast implementation of a multidimensional storage into a tree storage (Q1166931) (← links)
- On efficient entreeings (Q1323334) (← links)
- Bandwidth and pebbling (Q1838912) (← links)
- Blocking for external graph searching (Q1920428) (← links)
- Perfect Storage Representations for Families of Data Structures (Q3036701) (← links)
- (Q3686051) (← links)
- Storage representations for tree-like data structures (Q3878744) (← links)
- On computing distances between leaves in a complete tree (Q3890125) (← links)
- Relative complexity of algebras (Q3928239) (← links)
- Encoding search trees in lists<sup>†</sup> (Q3939219) (← links)
- A comparison of two methods of encoding arrays (Q4167534) (← links)
- Bounds on the costs of data encodings (Q4188717) (← links)
