  We introduce notions of linear reduction and linear equivalence of bijections
for the purposes of study bijections between Young tableaux. Originating in
Theoretical Computer Science, these notions allow us to give a unified view of
a number of classical bijections, and establish formal connections between
them.
