Veracity radius
From MaRDI portal
Publication:5177271
DOI10.1145/1146381.1146399zbMath1314.68056OpenAlexW2097977690MaRDI QIDQ5177271
Ran Wolff, Assaf Schuster, Liran Liss, Yitzhak Birk, Idit Keidar
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
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (3)
Distributed approximation of capacitated dominating sets ⋮ Distributed Disaster Disclosure ⋮ Distributed Decision‐Tree Induction in Peer‐to‐Peer Systems
This page was built for publication: Veracity radius
