… Now we observe that the total number of equivalence edges created is bounded above
by the number of arcs of the dag, hence the total running time is linear in the "nodes + edges" …

… unification problems, which we have called linear. We deal with completely general second-order
typed unification … context unification problem, named linear second-order unification. …

… by a linear search. The complexity of find can be reduced by employing a more efficient
union-find algorithm as eg described in [Tr75]. In this way one gets an almost linear unification …

… Since the flexible term is a subterm in the original unification problem, our solution may
be linear. Now a unification p~ir may have terms with different sequences of outermost )`-binders. …

… unification, see [7, 1, 23. In 1976, Paterson and Wegman published a unification algorithm
that was claimed to be linear [… to decide whether this algorithm is really linear and/or useful. In …

… unification algorithm. It is based on the theoretical framework developed in [6] and it makes
use of a union-find algorithmic schema, thus keeping an almost linear … of unification success …

… Unification in the context of linear X-calculi has received … Unification in with linear
restrictions on existential variables … in the linear simply-typed X-calculus We give a pre-unification …

… first-order linear unification Our linear unification algorithm for patterns is a linear unification
… order linear unification algorithm. In order to avoid going into too many details of a first-order …

The Robinson unification algorithm has exponential worst case behavior. This triggered the
development of (semi-)linear versions around 1976 by Martelli and Montanari as well as by …

… This last algorithm is no longer truly linear but runs in time O(n + m log m), where m is the
number … [ 19821 reported a new linear algorithm for unification. They also related the unification …