Self-assembling graphs (Q2461296)

From MaRDI portal
Revision as of 13:33, 27 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Self-assembling graphs
scientific article

    Statements

    title
    Self-assembling graphs (English)
    0 references
    author
    Vincent Danos
    0 references
    Fabien Tarissan
    0 references
    publication date
    27 November 2007
    0 references
    zbMATH Keywords
    concurrency theory
    0 references
    distributed algorithm theory
    0 references
    process algebra
    0 references
    cites work
    Self-assembling Trees
    0 references
    Q4417901
    0 references
    Self-assembling graphs
    0 references
    Q4248252
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    68Q85
    0 references
    68W15
    0 references
    zbMATH DE Number
    5214752
    0 references
    OpenAlex ID
    W1990968091
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2461296&oldid=35021216"
    Powered by MediaWiki