Veracity radius, capturing the locality of distributed computations

DOI10.1145/1146381.1146399MaRDI QIDQ5177271zbMATH OpenOpenAlexFDO

Authors Yitzhak Birk, Idit Keidar, Liran Liss, Assaf Schuster, Ran Wolff

Publication date 10 March 2015

Published in Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1146381.1146399

zbMATH Keywords

aggregationlocality

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Recommendations

• Efficient Dynamic Aggregation
• Local computation: lower and upper bounds
• Distributed verification and hardness of distributed approximation
• Distributed verification and hardness of distributed approximation
• What Can be Computed Locally?

Cited in

(3)

• Distributed Disaster Disclosure
• Distributed Decision‐Tree Induction in Peer‐to‐Peer Systems
• Distributed approximation of capacitated dominating sets

This page was built for publication: Veracity radius, capturing the locality of distributed computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5177271)