Suthee Ruangwises

This paper establishes a complexity hierarchy for shuffle operations used in card-based cryptography, classifying them by implementation difficulty and proving separations between these levels.

This paper completely characterizes cyclic equalizability for two words over any finite alphabet by proving that the words must share the same Parikh vector.