On real-time cellular automata and trellis automata
Acta Informatica
An Efficient Unsorted VLSI Dictionary Machine
IEEE Transactions on Computers
Designing systolic algorithms using sequential machines
IEEE Transactions on Computers - The MIT Press scientific computation series
SIAM Journal on Computing
Systolic Tree Implementation of Data Structures
IEEE Transactions on Computers
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
A Note Concerning Nondeterministic Tape Complexities
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
ACM SIGACT News
Machine models and linear time complexity
ACM SIGACT News
A brief history of cellular automata
ACM Computing Surveys (CSUR)
Constructible functions in cellular automata and their applications to hierarchy results
Theoretical Computer Science
On interacting automata with limited nondeterminism
Fundamenta Informaticae - Special issue on cellular automata
On Time-Constructible Functions in One-Dimensional Cellular Automata
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Speeding-Up Cellular Automata by Alternations
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Simulations between multi-dimensional deterministic and alternating cellular automata
Fundamenta Informaticae - Special issue on cellular automata
Space- and time-bounded nondeterminism for cellular automata
Fundamenta Informaticae - Special issue on cellular automata
Closure properties of cellular automata
Theoretical Computer Science
Low complexity classes of multidimensional cellular automata
Theoretical Computer Science
On Algebraic Structure of Neighborhoods of Cellular Automata: Horse Power Problem
Fundamenta Informaticae - Special issue on DLT'04
Simulation of one-way cellular automata by boolean circuits
Theoretical Computer Science
On Algebraic Structure of Neighborhoods of Cellular Automata: Horse Power Problem
Fundamenta Informaticae - Special issue on DLT'04
Space- and Time-Bounded Nondeterminism for Cellular Automata
Fundamenta Informaticae - Cellular Automata
Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata
Fundamenta Informaticae - Cellular Automata
On Interacting Automata with Limited Nondeterminism
Fundamenta Informaticae - Cellular Automata
Hi-index | 0.01 |
In this paper, a very simple model of parallel computation is considered, and the question of how restricting the flow of data to be one way compares with two-way flow is studied. It is shown that the one-way version is surprisingly very powerful in that it can solve problems that seemingly require two-way communication. Whether or not one-way communication is strictly weaker than two-way is an open problem, although the conjecture in this paper is in the positive. It is shown, however, that proving this conjecture is at least as hard as some well-known open problems in complexity theory.