Pages that link to "Item:Q4157931"
From MaRDI portal
The following pages link to Preserving average proximity in arrays (Q4157931):
Displaying 13 items.
- Storing matrices on disk for efficient row and column retrieval (Q1064062) (← links)
- Data encodings and their costs (Q1139942) (← links)
- A fast implementation of a multidimensional storage into a tree storage (Q1166931) (← links)
- Edge separators for graphs of bounded genus with applications (Q1210307) (← links)
- A new combinatorial approach to optimal embeddings of rectangles (Q1920427) (← links)
- Blocking for external graph searching (Q1920428) (← links)
- Storage representations for tree-like data structures (Q3878744) (← links)
- On computing distances between leaves in a complete tree (Q3890125) (← links)
- Encoding search trees in lists<sup>†</sup> (Q3939219) (← links)
- Pyramids: A data type for matrix representation in Pascal (Q4142621) (← links)
- A comparison of two methods of encoding arrays (Q4167534) (← links)
- Bounds on the costs of data encodings (Q4188717) (← links)
- LINEAR LAYOUT OF GENERALIZED HYPERCUBES (Q5696897) (← links)