Permuting machines and priority queues

Authors:
R. E. L. Aldred;M. D. Atkinson;H. P. van Ditmarsch;C. C. Handley;D. A. Holton;D. J. McCaughan
Affiliations:
Department of Computer Science, University of Otago, New Zealand;Department of Mathematics and Statistics, University of Otago, New Zealand;Department of Mathematics and Statistics, University of Otago, New Zealand;Department of Mathematics and Statistics, University of Otago, New Zealand;Department of Computer Science, University of Otago, New Zealand;Department of Computer Science, University of Otago, New Zealand
Venue:
Theoretical Computer Science
Year:
2005

Citing 3
Cited 0

Priority Queues and Permutations

SIAM Journal on Computing
Bounded capacity priority queues

Theoretical Computer Science
Regular closed sets of permutations

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

Machines whose sole function is to re-order their input data are considered. Every such machine defines a set of allowable input-output pairs of permutations. These sets are studied in terms of the minimal disallowed pairs (the basis). Some allowable sets with small bases are considered including the one defined by a priority queue machine. For more complex machines defined by two or more priority queues in series or parallel, the basis is proved to be infinite.