AG : Daniel Tamayo Jiménez (LRI) : Permutree Sorting
We define permutree sorting which generalizes the stack sorting and Coxeter sorting algorithms respectively due to Knuth and Reading. It consists of an algorithm that succeeds for a permutation if and only it is minimal in its permutree class or