Managing Storage for Extendible Arrays

DOI10.1137/0204024zbMATH Open0327.68043OpenAlexW2089061030MaRDI QIDQ4092980FDOQ4092980

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/0204024

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25)

Cited In (8)

• 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
• Perfect Storage Representations for Families of Data Structures
• On storing ragged arrays by hashing
• A storage scheme for extendible arrays
• Storage schemes for boundedly extendible arrays

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

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