At CADCentre, the two Newells and Tom Sancha developed Newell's algorithm, a technique for eliminating cyclic dependencies when ordering polygons to be drawn by a computer graphics system.

While one can often perform substitutions to eliminate indirect dependencies, the chain rule provides for a more efficient and general technique.

After World War II there was strong international pressure to eliminate dependencies associated with colonialism.

Loop skewing: By "skewing" the logical shape of an array, this loop optimization can (when combined with loop interchange) eliminate loop-carried dependencies, allowing an inner loop to be parallelized.

LISA Service Virtualization (or Virtualize): Pioneered the concept of service virtualization, which involves creating virtual models to simulate the behavior of constrained resources to eliminate dependencies on unavailable or inaccessible resources during the software development and testing phases.

It attempts to simplify a loop or eliminate dependencies by breaking it into multiple loops which have the same bodies but iterate over different contiguous portions of the index range.

This is a subtle optimization which can help eliminate dependencies and thus enable other optimizations.

Advanced Dungeons & Dragons eliminated dependencies on Chainmail entirely.

However, all the values can be computed in parallel, and the algorithm can be adapted to perform the function in phases to eliminate dependencies.