A note on storage of strings

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A note on storage of strings

Full text

Pdf (239 KB)

Source

Communications of the ACM archive
Volume 8 , Issue 8 (August 1965) table of contents

Page: 512

Year of Publication: 1965

ISSN:0001-0782

Author

A. T. Berztiss

Univ. of Melbourne, Victoria, Australia

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 9, Citation Count: 2

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/365474.365525 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	NEWEI, L, A., AND SHAW, J.C. Progralnming the logic theory machine. Proc. Western Joint, Comput. Conf., 1957, 230-240.
	2	W. T. Comfort, Multiword list items, Communications of the ACM, v.7 n.6, June 1964 [doi>10.1145/512274.512288]
	3	M. J. Bailey , M. P. Barnett , P. B. Burleson, Symbol manipulation in FORTRAN: SASP I subroutines, Communications of the ACM, v.7 n.6, June 1964 [doi>10.1145/512274.512282]

CITED BY 2

	Norman R. Nielsen, Dynamic memory allocation in computer simulation, Communications of the ACM, v.20 n.11, p.864-873, Nov. 1977
	G. Bozman , W. Buco , T. P. Daly , W. H. Tetzlaff, Analysis of free-storage algorithms: revisited, IBM Systems Journal, v.23 n.1, p.44-64, March 1984