Fast and succinct population protocols for Presburger arithmetic (Q6142599): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2023.103481 / 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: Fast and Exact Majority in Population Protocols / 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: Q5111475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space trade-offs in population protocols for the majority problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal time and space leader election in population protocols / 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: Expressive Power of Broadcast Consensus Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Size Estimation and Impossibility of Termination in Uniform Dense Population Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5207878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding and using linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brief Announcement / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation with finite stochastic chemical reaction networks / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2023.103481 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:50, 30 December 2024

scientific article; zbMATH DE number 7783115
Language Label Description Also known as
English
Fast and succinct population protocols for Presburger arithmetic
scientific article; zbMATH DE number 7783115

    Statements

    Fast and succinct population protocols for Presburger arithmetic (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 January 2024
    0 references
    population protocols
    0 references
    fast
    0 references
    succinct
    0 references
    population computers
    0 references

    Identifiers