Lower bounds on the state complexity of population protocols (Q6096031): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / title
 
Lower Bounds on the State Complexity of Population Protocols (English)
Property / title: Lower Bounds on the State Complexity of Population Protocols (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1145/3465084.3467912 / rank
 
Normal rank
Property / published in
 
Property / published in: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing / rank
 
Normal rank
Property / publication date
 
26 March 2024
Timestamp+2024-03-26T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 26 March 2024 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7824181 / rank
 
Normal rank
Property / zbMATH Keywords
 
distributed computing
Property / zbMATH Keywords: distributed computing / rank
 
Normal rank

Revision as of 05:04, 28 April 2024

scientific article; zbMATH DE number 7735997
Language Label Description Also known as
English
Lower bounds on the state complexity of population protocols
scientific article; zbMATH DE number 7735997

    Statements

    Lower bounds on the state complexity of population protocols (English)
    0 references
    Lower Bounds on the State Complexity of Population Protocols (English)
    0 references
    0 references
    0 references
    0 references
    11 September 2023
    0 references
    26 March 2024
    0 references
    population protocols
    0 references
    state complexity
    0 references
    distributed computing
    0 references

    Identifiers

    0 references
    0 references
    0 references