Managing Storage for Extendible Arrays
From MaRDI portal
Publication:4092980
DOI10.1137/0204024zbMath0327.68043OpenAlexW2089061030MaRDI QIDQ4092980
Publication date: 1975
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0204024
Analysis of algorithms and problem complexity (68Q25) Information storage and retrieval of data (68P20) General topics in the theory of software (68N01)
Related Items
On storing arbitrarily many extendible arrays of arbitrary dimensions ⋮ EFFICIENT PAIRING FUNCTIONS — AND WHY YOU SHOULD CARE ⋮ On storing ragged arrays by hashing ⋮ Perfect Storage Representations for Families of Data Structures ⋮ Storage schemes for boundedly extendible 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
This page was built for publication: Managing Storage for Extendible Arrays