Allocating Storage for Extendible Arrays

DOI10.1145/321850.321861MaRDI QIDQ4050118zbMATH OpenOpenAlexFDO

Authors Arnold L. Rosenberg

Publication date 1974

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321850.321861

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited in

(9)

• Some decision problems for polynomial mappings
• Polynomial indexing of integer lattice-points. I. General conceopts and quadratic polynomials
• On storing arbitrarily many extendible arrays of arbitrary dimensions
• EFFICIENT PAIRING FUNCTIONS — AND WHY YOU SHOULD CARE
• On storing ragged arrays by hashing
• On storing concatenable arrays
• Using time stamps for storing and addressing extendible arrays
• A storage scheme for extendible arrays
• Storage schemes for boundedly extendible arrays

This page was built for publication: Allocating Storage for Extendible Arrays

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