Two-Tape Simulation of Multitape Turing Machines
Journal of the ACM (JACM)
Some Results on Tape-Bounded Turing Machines
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
An observation on time-storage trade off
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Circuit Size is Nonlinear in Depth
Circuit Size is Nonlinear in Depth
Formal languages and their relation to automata
Formal languages and their relation to automata
Time-Space trade-offs for some algebraic problems
Journal of the ACM (JACM)
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
On the power of one-way communication
Journal of the ACM (JACM)
Sublinear-space evaluation algorithms for attribute grammars
ACM Transactions on Programming Languages and Systems (TOPLAS)
Provably efficient scheduling for languages with fine-grained parallelism
Journal of the ACM (JACM)
Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game
Journal of the ACM (JACM)
Asymptotically tight bounds on time-space trade-offs in a pebble game
Journal of the ACM (JACM)
Size space tradeoffs for resolution
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Space-time tradeoffs for linear recursion
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Derandomizing Arthur-Merlin Games under Uniform Assumptions
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
On the Space and Access Complexity of Computation DAGs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The tight deterministic time hierarchy
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Probabilistic simulations (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
I/O complexity: The red-blue pebble game
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Time-space tradeoffs for computing functions, using connectivity properties of their circuits
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The pebbling problem is complete in polynomial space
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Upper and lower bounds on time-space tradeoffs
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Graph pebbling with many free pebbles can be difficult
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Time-space tradeoffs for some algebraic problems
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Comparative schematology and pebbling with auxiliary pushdowns (Preliminary Version)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Speedups of deterministic machines by synchronous parallel machines
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On the complexity of intersecting finite state automata and NL versus NP
Theoretical Computer Science
Simulations between multi-dimensional deterministic and alternating cellular automata
Fundamenta Informaticae - Special issue on cellular automata
On Scheduling Mesh-Structured Computations for Internet-Based Computing
IEEE Transactions on Computers
Parallel scheduling of complex dags under uncertainty
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Parallelizing time with polynomial circuits
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Inductive Time-Space Lower Bounds for Sat and Related Problems
Computational Complexity
Towards an optimal separation of space and length in resolution
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Algebrization: a new barrier in complexity theory
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Algebrization: A New Barrier in Complexity Theory
ACM Transactions on Computation Theory (TOCT)
Recursion Theoretic Operators for Function Complexity Classes
IEICE - Transactions on Information and Systems
Improved simulation of nondeterministic turing machines
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
The size and depth of layered Boolean circuits
Information Processing Letters
Complexity of nondeterministic multitape computations based on crossing sequences
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Improved simulation of nondeterministic Turing machines
Theoretical Computer Science
The size and depth of layered boolean circuits
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Recursion theoretic operators for function complexity classes
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On the Relative Strength of Pebbling and Resolution
ACM Transactions on Computational Logic (TOCL)
A pebble game for internet-based computing
Theoretical Computer Science
Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata
Fundamenta Informaticae - Cellular Automata
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Lower bounds for RAMs and quantifier elimination
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.01 |
It is shown that every deterministic multitape Turing machine of time complexity t(n) can be simulated by a deterministic Turing machine of tape complexity t(n)/logt(n). Consequently, for tape constructable t(n), the class of languages recognizable by multitape Turing machines of time complexity t(n) is strictly contained in the class of languages recognized by Turing machines of tape complexity t(n). In particular the context-sensitive languages cannot be recognized in linear time by deterministic multitape Turing machines.