Sorting with a forklift (Q1871364): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q189413 |
Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Michael Henry Albert / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: cs/0209016 / rank | |||
Normal rank |
Latest revision as of 22:38, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sorting with a forklift |
scientific article |
Statements
Sorting with a forklift (English)
0 references
7 May 2003
0 references
Summary: 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 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.
0 references
permutation
0 references
sortable sequences
0 references