Pages that link to "Item:Q1156484"
From MaRDI portal
The following pages link to An information-theoretic approach to time bounds for on-line computation (Q1156484):
Displaying 13 items.
- On the power of several queues (Q685436) (← links)
- Minimizing access pointers into trees and arrays (Q795505) (← links)
- On two-tape real-time computation and queues (Q801685) (← links)
- Milking the Aanderaa argument (Q918198) (← links)
- An \(n^{1.618}\) lower bound on the time to simulate one queue or two pushdown stores by one tape (Q1068538) (← links)
- On the structure of one-tape nondeterministic Turing machine time hierarchy (Q1082813) (← links)
- Tape versus queue and stacks: The lower bounds (Q1109567) (← links)
- Simulations among multidimensional Turing machines (Q1165001) (← links)
- On space-bounded synchronized alternating Turing machines (Q1193901) (← links)
- Three one-way heads cannot do string matching (Q1318467) (← links)
- On the simulation of many storage heads by one (Q1348528) (← links)
- `Ideal learning' of natural language: positive results about learning from positive evidence (Q2382634) (← links)
- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity (Q3297821) (← links)
