Vaughan R. Pratt
ABSTRACT
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.
- 1.Even, S. and Itai, A. Queues, stacks, and graphs, in Theory of Machines and Computations, Z. Kohavi and A. Paz, Eds. Academic Press, New York, 1971. pp. 71-86.Google Scholar
Cross Ref
- 2.Knuth, D., The Art of Computer Programming, Addison-Wesley, Reading, Mass., 1968. Volume 1. Google ScholarDigital Library
- 3.Schensted, C. Longest increasing and decreasing subsequences, Canad.J.Math, 13, 2 (1961), pp. 179-191.Google ScholarCross Ref
- 4.Tarjan, R., Sorting Using Networks of Queues and Stacks, JACM, 19, 2, 341-346. (April, 1972). Google ScholarDigital Library
Index Terms
- Computing permutations with double-ended queues, parallel stacks and parallel queues
Recommendations
Catenable double-ended queues
Catenable double-ended queues are double-ended queues (deques) that support catenation (i.e., append) efficiently without sacrificing the efficiency of other operations. We present a purely functional implementation of catenable deques for which every ...
Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues
A deque with heap order is a linear list of elements with real-valued keys that allows insertions and deletions of elements at both ends of the list. It also allows the findmin (alternatively findmax ) operation, which returns the element of least (...
Diffusion approximations for double-ended queues with reneging in heavy traffic
We study a double-ended queue consisting of two classes of customers. Whenever there is a pair of customers from both classes, they are matched and leave the system. The matching is instantaneous following the first-come---first-match principle. If a ...
Comments