Randomized Proof-Labeling Schemes

DOI10.1145/2767386.2767421zbMath1333.68044OpenAlexW1970517175MaRDI QIDQ2796267

Pierre Fraigniaud, Boaz Patt-Shamir, Mor Baruch

Publication date: 23 March 2016

Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01247352/file/podc9.pdf

zbMATH Keywords

communication complexitydistributed verification

Mathematics Subject Classification ID

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

Related Items (5)

Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs ⋮ Fooling views: a new lower bound technique for distributed computations under congestion ⋮ Unnamed Item ⋮ Fast distributed algorithms for testing graph properties ⋮ Approximate proof-labeling schemes

Cites Work

• Memorization and Association on a Realistic Neural Model
• Unnamed Item

This page was built for publication: Randomized Proof-Labeling Schemes