Local verification of global proofs
From MaRDI portal
Publication:5090917
DOI10.4230/LIPICS.DISC.2018.25zbMATH Open1497.68298arXiv1803.09553MaRDI QIDQ5090917FDOQ5090917
Authors: Laurent Feuilloley, Juho Hirvonen 
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1803.09553
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Distributed algorithms (68W15) Communication complexity, information complexity (68Q11)
Cites Work
- Introduction to algorithms.
- Worst-case equilibria
- Proof labeling schemes
- Title not available (Why is that?)
- Communication Complexity
- Algorithms, games, and the internet
- Non-interactive proofs of proximity
- Distributed verification of minimum spanning trees
- Local Distributed Decision
- Non-deterministic graph property testing
- Proof labeling schemes
- Towards a complexity theory for local distributed computing
- Survey of distributed decision
- Title not available (Why is that?)
- Locally checkable proofs in distributed computing
- Proof-labeling schemes: broadcast, unicast and in between
- Error-sensitive proof-labeling schemes
- The landscape of communication complexity classes
- Approximate proof-labeling schemes
Cited In (8)
- Introduction to local certification
- A hierarchy of local decision
- Locally checkable proofs in distributed computing
- Redundancy in distributed proofs
- Locally checkable proofs
- Compact distributed certification of planar graphs
- Local Proofs for Global Safety Properties
- The hardness of local certification of finite-state dynamics
This page was built for publication: Local verification of global proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090917)
