On the power of several queues
From MaRDI portal
Publication:685436
DOI10.1016/0304-3975(93)90211-BzbMath0782.68058MaRDI QIDQ685436
Publication date: 13 March 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Milking the Aanderaa argument
- Tape versus queue and stacks: The lower bounds
- Simulating two pushdown stores by one tape in \(O(n^{1.5}\,\sqrt{\log \,n})\) time
- Multiple equality sets and Post machines
- An information-theoretic approach to time bounds for on-line computation
- Theories of computational complexity
- The speed of copying on one-tape off-line turing machines
- Real time computation
- Über einen Automaten mit Pufferspeicherung
- On-line simulation of k + 1 tapes by k tapes requires nonlinear time
- Two nonlinear lower bounds for on-line computations
- Combinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines
- The Power of the Queue
- Relations Among Complexity Measures
- On the Computational Complexity of Algorithms
- Boolean Memories
- Two-Tape Simulation of Multitape Turing Machines
- One-tape, off-line Turing machine computations
- Computability of Recursive Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the power of several queues
