Permuting machines and priority queues

DOI10.1016/j.tcs.2005.07.039zbMath1086.68033OpenAlexW2004597191MaRDI QIDQ817805

M. D. Atkinson, Hans P. van Ditmarsch, C. C. Handley, R. E. L. Aldred, Derek Holton, D. J. McCaughan

Publication date: 20 March 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.07.039

zbMATH Keywords

permutationpriority queuebasispattern

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Data structures (68P05)

Related Items (3)

Enhancing the connections between patterns in permutations and forbidden configurations in restricted elections ⋮ Unnamed Item ⋮ Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded capacity priority queues
• A survey of stack-sorting disciplines
• Regular closed sets of permutations.
• The permutational power of a priority queue
• Priority Queues and Permutations
• Restricted permutations

This page was built for publication: Permuting machines and priority queues