Sorting with a forklift

Simple item page
dc.creatorAlbert, M. H.
dc.creatorAtkinson, M. D.
dc.date2002-09-10
dc.date.accessioned2026-07-07T03:18:52Z
dc.date.available2026-07-07T03:18:52Z
dc.descriptionA 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 forkstack, or dually, which permutations of a fixed input stream can be produced using a single forkstack. An algorithm is given to solve the sorting problem and the minimal unsortable sequences are found. The results are extended to fork stacks where there are bounds on how many items can be pushed and popped at one time. In this context we also establish how to enumerate the collection of sortable sequences.
dc.description24 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/cs/0209016
dc.identifierhttp://arxiv.org/abs/cs/0209016
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31292
dc.subjectDiscrete Mathematics
dc.subjectData Structures and Algorithms
dc.subjectCombinatorics
dc.subjectG.2.1
dc.titleSorting with a forklift
dc.typetext

Files

Collections

arXiv