General cycling operations in Garside groups
  In this article, we introduce the notion of cycling operations of arbitrary order in Garside groups, which is a full generalization of the cycling and decycling operations. Theoretically, this notion together with other related concepts provides a context in which various definitions and arguments concerning Garside groups are unified and simplified as well as improved. Practically, it yields a new algorithm which has a considerably improved performance on solving the conjugacy problem of reducible braids. 
Hao Zheng