The computational power of simple protocols for self-awareness on graphs (Q392008): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.08.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092894787 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57608028 / 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: Computational models for networks of tiny artifacts: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of population protocols when population goes to infinity / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Passively mobile communicating machines that use restricted space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mediated Population Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Advances in Population Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dynamics of Probabilistic Population Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing systems in spite of distributed control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2782251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of classes of graphs recognizable by local computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups, Presburger formulas, and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computation in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mediated population protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Causality, influence, and computation in possibly disconnected synchronous dynamic networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:01, 7 July 2024

scientific article
Language Label Description Also known as
English
The computational power of simple protocols for self-awareness on graphs
scientific article

    Statements

    The computational power of simple protocols for self-awareness on graphs (English)
    0 references
    0 references
    0 references
    0 references
    13 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    population protocol
    0 references
    diffuse computation
    0 references
    finite-state agent
    0 references
    intermittent communication
    0 references
    stable computation
    0 references
    passive mobility
    0 references
    graph property
    0 references
    self-awareness
    0 references
    complexity
    0 references
    0 references
    0 references