A note on storage of strings

Authors:
A. T. Berztiss
Affiliations:
Univ. of Melbourne, Victoria, Australia
Venue:
Communications of the ACM
Year:
1965

Citing 2
Cited 2

Symbol manipulation in FORTRAN: SASP I subroutines

Communications of the ACM
Multiword list items

Communications of the ACM

Dynamic memory allocation in computer simulation

Communications of the ACM
Analysis of free-storage algorithms: revisited

IBM Systems Journal

Quantified Score

Hi-index	48.23

Visualization

Abstract

A method for storing strings is described which uses blocks of indefinite size, and is therefore completely dynamic. Its relation to similar schemes is discussed.