Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Storage schemes for boundedly extendible arrays

From MaRDI portal
Publication:1237541
Jump to:navigation, search

DOI10.1007/BF00290338zbMath0356.68027OpenAlexW2009851642MaRDI QIDQ1237541

Arnold L. Rosenberg, Larry J. Stockmeyer

Publication date: 1977

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00290338



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)


Related Items

Minimum-complexity pairing functions ⋮ Perfect Storage Representations for Families of Data Structures ⋮ A storage scheme for extendible arrays ⋮ A language-driven generalized numerical database translator



Cites Work

  • Unnamed Item
  • Allocating Storage for Extendible Arrays
  • Managing Storage for Extendible Arrays
  • Hashing Schemes for Extendible Arrays


This page was built for publication: Storage schemes for boundedly extendible arrays

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1237541&oldid=13319957"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 09:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki