On the minimal firing time of the firing squad synchronization problem for polyautomata networks (Q1253922): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(78)90046-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042455821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The firing squad synchronization problem for two-dimensional arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: The firing squad synchronization problem for a class of polyautomata networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cellular automata synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5681937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimum solution to the firing squad synchronization problem / rank
 
Normal rank

Latest revision as of 00:16, 13 June 2024

scientific article
Language Label Description Also known as
English
On the minimal firing time of the firing squad synchronization problem for polyautomata networks
scientific article

    Statements

    On the minimal firing time of the firing squad synchronization problem for polyautomata networks (English)
    0 references
    0 references
    1978
    0 references
    Minimal Firing Time
    0 references
    Firing Squad Synchronization Problem For Polyautomata Networks
    0 references

    Identifiers