Real-Time Simulation of Multihead Tape Units
Journal of the ACM (JACM)
Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps
Proceedings of the Fourth Colloquium on Automata, Languages and Programming
New real-time simulations of multihead tape units
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Saving tapes in the simulation of multihead turing machines
ACM SIGACT News
Machine models and linear time complexity
ACM SIGACT News
Persistent lists with catenation via recursive slow-down
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Confluently persistent deques via data structuaral bootstrapping
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An optimal RAM implementation of catenable min double-ended queues
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
New Real-Time Simulations of Multihead Tape Units
Journal of the ACM (JACM)
Purely functional, real-time deques with catenation
Journal of the ACM (JACM)
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Localized search in sorted lists
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
An information-theoretic approach to time bounds for on-line computation (preliminary version)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
It is shown that concatenable double-ended queues can be simulated in real-time by double-ended queues without concatenation. Consequently, every multihead Turing machine with head-to-head jumps can be simulated in real-time by multitape Turing machines.