Storage schemes for boundedly extendible arrays

  title={Storage schemes for boundedly extendible arrays},
  author={Arnold L. Rosenberg and Larry J. Stockmeyer},
  journal={Acta Informatica},
The high costs of extendibility in array realizations can be reduced dramatically by placing a bound on how big the arrays of interest will grow. Whereas extendible array realizations require order of p · log p storage locations to store two-dimensional arrays having p or fewer positions, boundedly extendible array realizations (with a bound of p) can store… CONTINUE READING