An algorithm for equivalence declarations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An algorithm for equivalence declarations

Full text

Pdf (460 KB)

Source

Communications of the ACM archive
Volume 4 , Issue 7 (July 1961) table of contents

Pages: 310 - 314

Year of Publication: 1961

ISSN:0001-0782

Authors

Bruce W. Arden	Univ. of Michigan, Ann Arbor
Bernard A. Galler	Univ. of Michigan, Ann Arbor
Robert M. Graham	Univ. of Michigan, Ann Arbor

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 24, Citation Count: 6

Additional Information:

abstract 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/366622.366626 What is a DOI?

ABSTRACT

Many algebraic translators provide the programmer with a limited ability to allocate storage. Of course one of the most desirable features of these translators is the extent to which they remove the burden of storage allocation from the programmer. Nevertheless, there are situations in which one wishes to make certain vectors and arrays contiguous, coincident, or overlapping. This is made possible in FORTRAN by the use of COMMON and EQUIVALENCE statements, in MAD by the use of PROGRAM COMMON, ERASABLE, and EQUIVALENCE statements, etc.

CITED BY 6

	Jerome Feldman , David Gries, Translator writing systems, Communications of the ACM, v.11 n.2, p.77-113, Feb. 1968
	Zvi Galil , Giuseppe F. Italiano, Data structures and algorithms for disjoint set union problems, ACM Computing Surveys (CSUR), v.23 n.3, p.319-344, Sept. 1991
	Robert Endre Tarjan, Applications of Path Compression on Balanced Trees, Journal of the ACM (JACM), v.26 n.4, p.690-715, Oct. 1979
	Marc J. van Kreveld , Mark H. Overmars, Union-copy structures and dynamic segment trees, Journal of the ACM (JACM), v.40 n.3, p.635-652, July 1993
	Benrard A. Galler , Michael J. Fisher, An improved equivalence algorithm, Communications of the ACM, v.7 n.5, p.301-303, May 1964
	Robert Endre Tarjan, Efficiency of a Good But Not Linear Set Union Algorithm, Journal of the ACM (JACM), v.22 n.2, p.215-225, April 1975