considered separable permutations again in their study of bootstrap percolation, a process in which an initial permutation matrix is modified by repeatedly changing to one any matrix coefficient that has two or more orthogonal neighbors equal to one.
The term "separable permutation" was introduced later by , who considered them for their algorithmic properties.