What can be verified locally?
From MaRDI portal
Publication:1672006
DOI10.1016/J.JCSS.2018.05.004zbMATH Open1398.68167OpenAlexW2885668823WikidataQ129395629 ScholiaQ129395629MaRDI QIDQ1672006FDOQ1672006
Authors: Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti 
Publication date: 7 September 2018
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://aaltodoc.aalto.fi/handle/123456789/35266
Recommendations
Cites Work
- Proof labeling schemes
- Distributed Computing: A Locality-Sensitive Approach
- Locality in Distributed Graph Algorithms
- What cannot be computed locally!
- Leveraging Linial’s Locality Limit
- Survey of local algorithms
- Locally checkable proofs
- On the Impact of Identifiers on Local Decision
- What Can be Computed Locally?
- Towards a complexity theory for local distributed computing
- Survey of distributed decision
- What can be decided locally without identifiers?
- Title not available (Why is that?)
- Distributed graph automata
Cited In (14)
- Deciding and verifying network properties locally with few output bits
- Introduction to local certification
- Local certification of graphs with bounded genus
- A hierarchy of local decision
- Locally verifiable distributed SNARGs
- What can be verified locally?
- What Can be Sampled Locally?
- What Can be Computed Locally?
- A meta-theorem for distributed certification
- Infinite networks, halting and local algorithms
- Twenty-two new approximate proof labeling schemes
- The hardness of local certification of finite-state dynamics
- What can be decided locally without identifiers?
- A meta-theorem for distributed certification
This page was built for publication: What can be verified locally?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1672006)
