Labeled trees and the efficient computation of derivations

This paper is concerned with the effective parallel symbolic computation of operators under composition. Examples include differential operators under composition and vector fields under the Lie bracket. In general, such operators do not commute. An important problem is to find efficient algorithm