Sorting Using Networks of Queues and Stacks
Journal of the ACM (JACM)
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Restricted permutations and the wreath product
Discrete Mathematics
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Algorithms for Pattern Involvement in Permutations
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Regular closed sets of permutations
Theoretical Computer Science
Generalized Stack Permutations
Combinatorics, Probability and Computing
On the least exponential growth admitting uncountably many closed permutation classes
Theoretical Computer Science
The enumeration of permutations sortable by pop stacks in parallel
Information Processing Letters
Queue Layout of Bipartite Graph Subdivisions
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Upper bounds on the queuenumber of k-ary n-cubes
Information Processing Letters
Sorting with networks of data structures
Discrete Applied Mathematics
| Hi-index | 0.00 |
A memory may be regarded as a computer with input, output and storage facilities, but with no explicit functional capability. The only possible outputs are permutations of a multiset of its inputs. Thus the natural question to ask of a class of memories is, what permutations can its members compute? We are particularly interested here in switchyard networks studied by Knuth [1968], Even and Itai [1971], and Tarjan [1972], where the permutations are of the set of inputs, rather than of a multiset of them.