Sorting with a Forklift

Authors:
Michael H. Albert;Mike D. Atkinson
Affiliations:
-;-
Venue:
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Year:
2002

Citing 5
Cited 0

Restricted permutations

Discrete Mathematics
Sorting Using Networks of Queues and Stacks

Journal of the ACM (JACM)
Computing permutations with double-ended queues, parallel stacks and parallel queues

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Generalized Stack Permutations

Combinatorics, Probability and Computing
Combinatorial Enumeration

Combinatorial Enumeration

Quantified Score

Hi-index	0.00

Visualization

Abstract

A fork stack is a stack that allows pushes and pops of several items at a time.An algorithm to determine which sequences of input streams can be sorted by a fork stack is given.The minimal unsortable sequences are found (there are a finite number only). The results are extended to fork stacks where there are bounds on how many items can be pushed and popped at one time. Some enumeration results for the number of sortable sequences are given.