Preserving Proximity in Arrays

DOI10.1137/0204038zbMath0324.68016OpenAlexW1967958850MaRDI QIDQ4088266

Arnold L. Rosenberg

Publication date: 1975

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0204038

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (12)

Blocking for external graph searching ⋮ Data encodings and their costs ⋮ Linear layouts of generalized hypercubes ⋮ A scalable architecture for lattice-gas simulations ⋮ Simulations among multidimensional Turing machines ⋮ Accessibility of values as a determinant of relative complexity in algebras ⋮ LINEAR LAYOUT OF GENERALIZED HYPERCUBES ⋮ A comparison of two methods of encoding arrays ⋮ Some decision problems for polynomial mappings ⋮ Storage representations for tree-like data structures ⋮ Bounds on the costs of data encodings ⋮ Storing matrices on disk for efficient row and column retrieval

This page was built for publication: Preserving Proximity in Arrays