Allowing each node to communicate only once in a distributed system: shared whiteboard models (Q2355326): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Communication Complexity of Simultaneous Messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Can be Computed Locally? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distributing symmetric streaming computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a complexity theory for local distributed computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound of the Hadwiger number of graphs by their average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: What cannot be computed locally! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal function for contractions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equal sums of like powers / rank
 
Normal rank

Latest revision as of 12:44, 10 July 2024

scientific article
Language Label Description Also known as
English
Allowing each node to communicate only once in a distributed system: shared whiteboard models
scientific article

    Statements

    Allowing each node to communicate only once in a distributed system: shared whiteboard models (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 July 2015
    0 references
    distributed computing
    0 references
    local computation
    0 references
    graph properties
    0 references
    bounded communication
    0 references

    Identifiers