Allocating Storage for Extendible Arrays

From MaRDI portal

Revision as of 03:50, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4050118

Jump to:navigation, search

DOI10.1145/321850.321861zbMath0296.68032OpenAlexW2044167269MaRDI QIDQ4050118

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)

Related Items (9)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4050118&oldid=17779981"