Preserving Proximity in Arrays

DOI10.1137/0204038MaRDI QIDQ4088266zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(12)

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

This page was built for publication: Preserving Proximity in Arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4088266)