75 citations · 230 across the 32 of their papers we have counts for
Showing 2002Show all
3 papers · 1 filter
math.CO2002
Restricted permutations and queue jumping
M. H. Albert, R. E. L. Aldred, M. D. Atkinson +3
A connection between permutations that avoid 4231 and a certain queueing discipline is established. It is proved that a more restrictive queueing discipline corresponds to avoiding…
cs.DM2002
Sorting with a forklift
M. H. Albert, M. D. Atkinson
A fork stack is a generalised stack which allows pushes and pops of several items at a time. We consider the problem of determining which input streams can be sorted using a single…
math.CO2002★ 2 cited
Regular closed classes of permutations
M. Albert, M. D. Atkinson, N. Ruskuc
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques…