Pages that link to "Item:Q4188717"
From MaRDI portal
The following pages link to Bounds on the costs of data encodings (Q4188717):
Displayed 16 items.
- Tabu search for the cyclic bandwidth problem (Q337475) (← links)
- On the k-ary hypercube (Q673771) (← links)
- Minimal storage representations for binary relations (Q789170) (← links)
- Lattice bandwidth of random graphs (Q810061) (← links)
- Embeddings of binary trees in lines (Q1058856) (← links)
- Uniform data encodings (Q1134520) (← links)
- Data encodings and their costs (Q1139942) (← links)
- Simulations among multidimensional Turing machines (Q1165001) (← links)
- Representing graph families with edge grammars (Q1801468) (← links)
- Bandwidth and pebbling (Q1838912) (← links)
- A new combinatorial approach to optimal embeddings of rectangles (Q1920427) (← links)
- Blocking for external graph searching (Q1920428) (← links)
- (Q3686051) (← links)
- Storage representations for tree-like data structures (Q3878744) (← links)
- Encoding search trees in lists<sup>†</sup> (Q3939219) (← links)
- A comparison of two methods of encoding arrays (Q4167534) (← links)