scientific article; zbMATH DE number 6820307

DOI10.4230/LIPIcs.ICALP.2016.118zbMath1388.68062arXiv1602.08925MaRDI QIDQ4598260

Juho Hirvonen, Laurent Feuilloley, Pierre Fraigniaud

Publication date: 19 December 2017

Full work available at URL: https://arxiv.org/abs/1602.08925

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

localitydistributed algorithmdistributed decisiondistributed network computing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (9)

What can be verified locally? ⋮ Proof-labeling schemes: broadcast, unicast and in between ⋮ Randomized proof-labeling schemes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Redundancy in distributed proofs ⋮ Fast distributed algorithms for testing graph properties ⋮ Approximate proof-labeling schemes ⋮ Compact distributed certification of planar graphs

This page was built for publication: