Comparing algorithms for sorting with \(t\) stacks in series
From MaRDI portal
Publication:1889895
DOI10.1007/s00026-004-0209-3zbMath1055.05001arXivmath/0404176OpenAlexW2082782379MaRDI QIDQ1889895
Publication date: 13 December 2004
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0404176
Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) General topics in the theory of algorithms (68W01)
Related Items
Stack-sortable permutations and beyond, Stack sorting with increasing and decreasing stacks, Counting 3-stack-sortable permutations