Sorting permutations with pile shuffle on queue-like and stack-like piles

Documenti analoghi

• Sorting by pile shuffles on queue-like and stack-like piles can be hard
  di: Treleaven, Kyle B.
  Pubblicazione: (2025)
• Dimer piling problems and interacting field theory
  di: Camasca, Rolando Ramirez, et al.
  Pubblicazione: (2023)
• Fibonacci-like partitions and their associated piecewise-defined permutations
  di: Bárcena-Petisco, Jon Asier, et al.
  Pubblicazione: (2025)
• Sorting permutations using a pop stack with a bypass
  di: Cioni, Lapo, et al.
  Pubblicazione: (2025)
• Bounded displacement permutations on tree-like spaces
  di: Corson, Samuel M.
  Pubblicazione: (2025)