The Power of the Queue

Queues, stacks (pushdown stores), and tapes are storage models which have direct applications in compiler design and the general design of algorithms. Whereas stacks (pushdown store or last-in-first-out storage) have been thoroughly investigated and are well understood, this is much less the case for queues (first-in-first-out storage). In this paper we present a comprehensive study comparing queues to stacks and tapes. We address off-line machines with a one-way input. In particular, 1 queue and 1 tape (or stack) are not comparable:

[1]  Joel I. Seiferas,et al.  New Real-Time Simulations of Multihead Tape Units , 1977, JACM.

[2]  W. Maass.  Combinatorial lower bound arguments for deterministic and nondeterministic Turing machines , 1985 .

[3]  Oscar H. IBARm.  Information and Control , 1957, Nature.

[4]  A. Kolmogorov.  Three approaches to the quantitative definition of information , 1968 .

[5]  Joel I. Seiferas,et al.  New Real-Time Simulations of Multihead Tape Units , 1981, J. ACM.

[6]  Sheila A. Greibach,et al.  Time- and Tape-Bounded Turing Acceptors and AFLs , 1970, J. Comput. Syst. Sci..

[7]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[8]  Ming Li,et al.  Tape versus Queue and Stacks: The Lower Bounds , 1988, Inf. Comput..

[9]  Maria M. Klawe,et al.  Limitations on Explicit Constructions of Expanding Graphs , 1984, SIAM J. Comput..

[10]  Wolfgang J. Paul,et al.  On-line simulation of k+1 tapes by k tapes requires nonlinear time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[11]  Paul M. B. Vitányi,et al.  One queue or two pushdown stores take square time on a one-head tape unit , 1984 .

[12]  Ming Li,et al.  Simulating two pushdown stores by one tape in O(n1.5v) time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[13]  Wolfgang J. Paul,et al.  On-line simulation of k+1 tapes by k tapes requires nonlinear time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[14]  Richard Edwin Stearns,et al.  Two-Tape Simulation of Multitape Turing Machines , 1966, JACM.

[15]  Paul M. B. Vitányi,et al.  On Two-Tape Real-Time Computation and Queues , 1984, J. Comput. Syst. Sci..

[16]  Ming Li.  Lower bounds in Computational Complexity , 1985 .

[17]  Endre Szemerédi,et al.  On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines , 1986, STOC '86.

[18]  Michael C. Loui.  The Complexity of Sorting on Distributed Systems , 1984, Inf. Control..

[19]  Wolfgang J. Paul,et al.  An Information-Theoretic Approach to Time Bounds for On-Line Computation , 1981, J. Comput. Syst. Sci..

[20]  Paul M. B. Vitányi,et al.  An n1.618 Lower Bound on the Time to Simulate One Queue or Two Pushdown Stores by One Tape , 1985, Inf. Process. Lett..

[21]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[22]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[23]  James B. Morris.  Formal Languages and their Relation to Automata , 1970 .

[24]  Robert HOOD,et al.  Real-Time Queue Operation in Pure LISP , 1980, Inf. Process. Lett..

[25]  Wolfgang J. Paul,et al.  Two Nonlinear Lower Bounds for On-Line Computations , 1984, Inf. Control..