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

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s00446-023-00450-4 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S00446-023-00450-4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearizing well quasi-orders and bounding the length of bad sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Space Trade-offs in Population Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation in networks of passively mobile finite-state sensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation in networks of passively mobile finite-state sensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation by population protocols with a leader / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational power of population protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of controlled bad sequences over finite sets of Nd / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding cut-offs in leaderless rendez-vous protocols is easy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Population Protocols for Presburger Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3304110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Reachability Problem for Petri Nets Is Not Elementary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5207878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5089313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri nets and large finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal solutions of linear diophantine systems : bounds and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covering and boundedness problems for vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Hierarchies beyond Elementary / rank
 
Normal rank

Latest revision as of 18:23, 30 December 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