Simulations among multidimensional Turing machines
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3692650 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3569862 (Why is no real title available?)
- scientific article; zbMATH DE number 3600020 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- An information-theoretic approach to time bounds for on-line computation
- Boolean Memories
- Bounds on the costs of data encodings
- Data encodings and their costs
- New Real-Time Simulations of Multihead Tape Units
- On the Computational Complexity of Algorithms
- Preserving Proximity in Arrays
- Relations Among Complexity Measures
- Space and Time Hierarchies for Classes of Control Structures and Data Structures
- Storage Modification Machines
- Zwei-Band Simulation von Turingmaschinen. (Two-tape simulation of Turing machines)
Cited in
(7)- Minimizing access pointers into trees and arrays
- Optimal dynamic embedding of X-trees into arrays
- A fast implementation of a multidimensional storage into a tree storage
- The complexity of on-line simulations between multidimensional turing machines and random access machines
- A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes
- Speedup of determinism by alternation for multidimensional Turing machines
- On the worst case performance of buddy systems
This page was built for publication: Simulations among multidimensional Turing machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165001)
