Serafino Amoroso

According to our database, Serafino Amoroso authored at least 11 papers between 1969 and 1988.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1988

Revised Graduate Software Engineering Curriculum at Monmouth College.

Serafino Amoroso, Richard Kuntz, Thoams Wheeler, Bud Graff

Proceedings of the Software Engineering Education, 1988

1976

Indecomposable Parallel Maps in Tessellation Structures.

Serafino Amoroso, Irving J. Epstein

J. Comput. Syst. Sci., 1976

1975

Some Clarifications of the Concept of a Garden-of-Eden Configuration.

Serafino Amoroso, Gerald Cooper, Yale N. Patt

J. Comput. Syst. Sci., 1975

1974

Maps Preserving the Uniformity of Neighborhood Interconnection Patterns in Tessellation Structures

Serafino Amoroso, Irving J. Epstein

Inf. Control., May, 1974

1972

Some Comments on Neighborhood Size for Tessellation Automata

Serafino Amoroso, R. Guilfoyle

Inf. Control., August, 1972

Decision Procedures for Surjectivity and Injectivity of Parallel Maps for Tessellation Structures.

Serafino Amoroso, Yale N. Patt

J. Comput. Syst. Sci., 1972

1971

Structural and Behavioral Equivalences of Tessellation Automata

Hisao Yamada, Serafino Amoroso

Inf. Control., February, 1971

Tessellation Structures for Reproduction of Arbitrary Patterns.

Serafino Amoroso, Gerald Cooper

J. Comput. Syst. Sci., 1971

1970

A Completeness Problem for Pattern Generation in Tessellation Automata.

Hisao Yamada, Serafino Amoroso

J. Comput. Syst. Sci., 1970

1969

Tessellation Automata

Hisao Yamada, Serafino Amoroso

Inf. Control., March, 1969

A Unifying Framework for the Theory of Iterative Arrays of Machines

Serafino Amoroso, Edward Lieblein, Hisao Yamada

Proceedings of the 1st Annual ACM Symposium on Theory of Computing, 1969