The Complexity of Sorting with Networks of Stacks and Queues

Authors:
Stefan Felsner;Martin Pergel
Affiliations:
Institut für Mathematik, Technische Universität Berlin,;Department of Applied Mathematics (KAM), Charles University Prague,
Venue:
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Year:
2008

Citing 6
Cited 0

Reversing trains: a turn of the century sorting problem

Journal of Algorithms
Permutations generated by token passing in graphs

Theoretical Computer Science
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Sorting Using Networks of Queues and Stacks

Journal of the ACM (JACM)
Combinatorics of Permutations

Combinatorics of Permutations
Solutions to real-world instances of PSPACE-complete stacking

ESA'07 Proceedings of the 15th annual European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a sorting problem on networks whose nodes are storage elements of type stack or queue. A railway switchyard could be an instance of such a network. Given is an input node where a permutation of items 1 to nis delivered and an output node where they are expected in sorted order. How many moves, where an item is transfered from one node to an adjacent node, are needed in the worst case for the sorting? Among others we have the following results: A characterization of networks where the sorting complexity is 茂戮驴(nlogn). A lower bound of 茂戮驴(n2 茂戮驴茂戮驴) for the network consisting of only two stacks that can exchange items.