Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Serafino Amoroso

dblp:14/568 · DBLP profile ↗
← Back
10ranked-venue papers
7as first author
0since 2021 · last 1976
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 10 · 7 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
4 papers
Automata and formal languages · 76% Graph algorithms and graph theory · 16% Logic in computer science · 8%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages
cellular automata
0.041974
Maps Preserving the Uniformity of Neighborhood Interconnection Patterns in Tessellation Structures · Inf. Control. 1974
Structural and Behavioral Equivalences of Tessellation Automata · Inf. Control. 1971
Tessellation Automata · Inf. Control. 1969
Automata and formal languages › cellular automata
tessellation automata
0.021971
Structural and Behavioral Equivalences of Tessellation Automata · Inf. Control. 1971
Tessellation Automata · Inf. Control. 1969
Graph algorithms and graph theory
graph theory
0.011974
Maps Preserving the Uniformity of Neighborhood Interconnection Patterns in Tessellation Structures · Inf. Control. 1974
Emerging computing paradigms
cellular automata
0.011972
Some Comments on Neighborhood Size for Tessellation Automata · Inf. Control. 1972
Automata and formal languages
finite automata
0.011969
A Unifying Framework for the Theory of Iterative Arrays of Machines · STOC 1969
Automata and formal languages › cellular automata
iterative arrays
0.011969
A Unifying Framework for the Theory of Iterative Arrays of Machines · STOC 1969
Logic in computer science
semantics
0.011974
Maps Preserving the Uniformity of Neighborhood Interconnection Patterns in Tessellation Structures · Inf. Control. 1974
Logic in computer science › process algebra
behavioral equivalence
0.011971
Structural and Behavioral Equivalences of Tessellation Automata · Inf. Control. 1971

Methods — techniques the papers use, named apart from their topics

mathematical framework · 0.0
YearPublicationVenuePosition
1976 Indecomposable Parallel Maps in Tessellation Structures
Serafino Amoroso, Irving J. Epstein
J. Comput. Syst. Sci.1
1975 Some Clarifications of the Concept of a Garden-of-Eden Configuration
Serafino Amoroso, Gerald Cooper, Yale N. Patt
J. Comput. Syst. Sci.1
1974 Maps Preserving the Uniformity of Neighborhood Interconnection Patterns in Tessellation Structures
Serafino Amoroso, Irving J. Epstein
Inf. Control.1
1972 Some Comments on Neighborhood Size for Tessellation Automata
Serafino Amoroso, R. Guilfoyle
Inf. Control.1
1972 Decision Procedures for Surjectivity and Injectivity of Parallel Maps for Tessellation Structures
Serafino Amoroso, Yale N. Patt
J. Comput. Syst. Sci.1
1971 Structural and Behavioral Equivalences of Tessellation Automata
Hisao Yamada, Serafino Amoroso
Inf. Control.2
1971 Tessellation Structures for Reproduction of Arbitrary Patterns
Serafino Amoroso, Gerald Cooper
J. Comput. Syst. Sci.1
1970 A Completeness Problem for Pattern Generation in Tessellation Automata
Hisao Yamada, Serafino Amoroso
J. Comput. Syst. Sci.2
1969 A Unifying Framework for the Theory of Iterative Arrays of Machines
abstract
A mathematical framework is defined in which many questions concerning uniform arrays of finite-state machines can be formulated and studied. An outline is then presented that informally describes some research areas that have been under investigation. Some of the results uncovered to date are described and many open problems are stated.
Serafino Amoroso, Edward Lieblein, Hisao Yamada
STOC1
1969 Tessellation Automata
Hisao Yamada, Serafino Amoroso
Inf. Control.2