Allowing each node to communicate only once in a distributed system: shared whiteboard models

DOI10.1007/s00446-014-0221-8zbMath1331.68029OpenAlexW1978731163WikidataQ62046028 ScholiaQ62046028MaRDI QIDQ2355326

Ioan Todinca, Karol Suchan, Adrian Kosowski, Ivan Rapaport, Nicolas Nisse, Florent Becker, Martin Matamala

Publication date: 22 July 2015

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-014-0221-8

zbMATH Keywords

graph propertiesdistributed computinglocal computationbounded communication

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (4)

Deciding and verifying network properties locally with few output bits ⋮ The role of randomness in the broadcast congested clique model ⋮ The Impact of Locality in the Broadcast Congested Clique Model ⋮ The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model

Cites Work

• Lower bound of the Hadwiger number of graphs by their average degree
• The extremal function for complete minors
• On distributing symmetric streaming computations
• An extremal function for contractions of graphs
• Locality in Distributed Graph Algorithms
• Communication Complexity of Simultaneous Messages
• Distributed Computing: A Locality-Sensitive Approach
• What Can be Computed Locally?
• Towards a complexity theory for local distributed computing
• What cannot be computed locally!
• Equal sums of like powers
• Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract)

This page was built for publication: Allowing each node to communicate only once in a distributed system: shared whiteboard models