-
1
-
-
84918284155
-
An iterative one-dimensional real-time multiplier
-
Stanford University
-
A.J. Atrubin, An iterative one-dimensional real-time multiplier. Term Paper for App. Math. 298, Stanford University (1962).
-
(1962)
Term Paper for App. Math.
, vol.298
-
-
Atrubin, A.J.1
-
2
-
-
0001824412
-
An eight-state minimal time solution to the Firing Squad Synchronization Problem
-
R. Balzer, An eight-state minimal time solution to the Firing Squad Synchronization Problem, Inf. and Contr. 10(1967)22-42.
-
(1967)
Inf. and Contr.
, vol.10
, pp. 22-42
-
-
Balzer, R.1
-
3
-
-
84937741242
-
Real-time computation by n-dimensional arrays
-
S. Cole, Real-time computation by n-dimensional arrays, IEEE Trans. Comp. 4(1969)349-365.
-
(1969)
IEEE Trans. Comp.
, vol.4
, pp. 349-365
-
-
Cole, S.1
-
4
-
-
0021519504
-
On real-time cellular automata and trellis automata
-
C. Choffrut and C. Culik II, On real-time cellular automata and trellis automata, Actae Informaticae (1984) 393-407.
-
(1984)
Actae Informaticae
, pp. 393-407
-
-
Choffrut, C.1
Culik II, C.2
-
5
-
-
84892707336
-
Systolic treillis automaton (for VLSI)
-
Department of Computer Science, University of Waterloo
-
C. Čulik II, J. Gruska and A. Salomaa, Systolic treillis automaton (for VLSI), Research Report CS-81.34, Department of Computer Science, University of Waterloo (1981).
-
(1981)
Research Report
, vol.CS-81.34
-
-
Čulik II, C.1
Gruska, J.2
Salomaa, A.3
-
6
-
-
0024607918
-
Variation of the Firing Squad Synchronization Problem
-
C. Čulik II, Variation of the Firing Squad Synchronization Problem, Inf. Proc. Lett. (1989) 152-157.
-
(1989)
Inf. Proc. Lett.
, pp. 152-157
-
-
Čulik II, C.1
-
7
-
-
0018995310
-
One-way bounded cellular automata
-
C. Dyer, One-way bounded cellular automata, Inf. and Contr. 44(1980)54-69.
-
(1980)
Inf. and Contr.
, vol.44
, pp. 54-69
-
-
Dyer, C.1
-
8
-
-
0000751573
-
Generation on primes by a one-dimensional real-time iterative array
-
P.C. Fisher, Generation on primes by a one-dimensional real-time iterative array, J. ACM 12(1965)388-394.
-
(1965)
J. ACM
, vol.12
, pp. 388-394
-
-
Fisher, P.C.1
-
9
-
-
0023496686
-
A six-state minimal time solution to the Fring Squad Synchronization Problem
-
J. Mazoyer, A six-state minimal time solution to the Fring Squad Synchronization Problem, Theor. Comp. Sci. 50(1987)183-238.
-
(1987)
Theor. Comp. Sci.
, vol.50
, pp. 183-238
-
-
Mazoyer, J.1
-
12
-
-
0026886532
-
A linear speed-up theorem for cellular automata
-
N. Reimen and J. Mazoyer, A linear speed-up theorem for cellular automata, Theor. Comp. Sci. 101(1992)59-98.
-
(1992)
Theor. Comp. Sci.
, vol.101
, pp. 59-98
-
-
Reimen, N.1
Mazoyer, J.2
-
13
-
-
0348175024
-
Cellular automata theory
-
Stanford University
-
A.R. Smith, Cellular automata theory, Technical Report 2, Stanford University (1960).
-
(1960)
Technical Report
, vol.2
-
-
Smith, A.R.1
-
14
-
-
0015360148
-
Real time language recognition by one-dimensional cellular automata
-
A.R. Smith, Real time language recognition by one-dimensional cellular automata, J. ACM 6(1972)233-235.
-
(1972)
J. ACM
, vol.6
, pp. 233-235
-
-
Smith, A.R.1
-
17
-
-
0002725637
-
An optimal solution to the Firing Squad Synchronization Problem
-
A. Waksman, An optimal solution to the Firing Squad Synchronization Problem, Inf. and Contr. 9(1966)66-87.
-
(1966)
Inf. and Contr.
, vol.9
, pp. 66-87
-
-
Waksman, A.1
|