An algorithm for equivalence declarations

Authors:
Bruce W. Arden;Bernard A. Galler;Robert M. Graham
Affiliations:
Univ. of Michigan, Ann Arbor;Univ. of Michigan, Ann Arbor;Univ. of Michigan, Ann Arbor
Venue:
Communications of the ACM
Year:
1961

Citing 0
Cited 8

Data structures and algorithms for disjoint set union problems

ACM Computing Surveys (CSUR)
Union-copy structures and dynamic segment trees

Journal of the ACM (JACM)
Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
Applications of Path Compression on Balanced Trees

Journal of the ACM (JACM)
Translator writing systems

Communications of the ACM
An improved equivalence algorithm

Communications of the ACM
Some Observations on Equivalence Handling Methods

IEEE Transactions on Computers
Topics in data structures

Algorithms and theory of computation handbook

Quantified Score

Hi-index	48.25

Visualization

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.