scientific article; zbMATH DE number 3988713
From MaRDI portal
Publication:3751011
zbMATH Open0611.68025MaRDI QIDQ3751011FDOQ3751011
Authors: Luc Longpré, Paul M. B. Vitányi, Ming Li
Publication date: 1986
Title of this publication is not available (Why is that?)
Recommendations
Cited In (14)
- Bad luck when joining the shortest queue
- The Power of the Queue
- k\(+1\) heads are better than k for PDAs
- Diving into the queue
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the power of several queues
- Tape versus queue and stacks: The lower bounds
- The linked list representation of \(n\) LIFO-stacks and/or FIFO-queues in the single-level memory
- The Power of Priority Channel Systems
- Efficient Simulations by Queue Machines
- Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit
- The complexity of matrix transposition on one-tape off-line Turing machines
- The complexity of matrix transposition on one-tape off-line Turing machines with output tape
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751011)