Recommendations
Cites work
- Distributed Computing: A Locality-Sensitive Approach
- Distributed graph automata
- scientific article; zbMATH DE number 6820307 (Why is no real title available?)
- Leveraging Linial’s Locality Limit
- Locality in Distributed Graph Algorithms
- Locally checkable proofs
- On the Impact of Identifiers on Local Decision
- Proof labeling schemes
- Survey of distributed decision
- Survey of local algorithms
- Towards a complexity theory for local distributed computing
- What Can be Computed Locally?
- What can be decided locally without identifiers?
- What cannot be computed locally!
Cited in
(17)- Deciding and verifying network properties locally with few output bits
- A meta-theorem for distributed certification
- Local certification of graphs with bounded genus
- A hierarchy of local decision
- What can be verified locally?
- What Can be Computed Locally?
- Infinite networks, halting and local algorithms
- Introduction to local certification
- What can be decided locally without identifiers?
- What Can be Sampled Locally?
- A meta-theorem for distributed certification
- Twenty-two new approximate proof labeling schemes
- The hardness of local certification of finite-state dynamics
- Locally verifiable distributed SNARGs
- Distributed model checking on graphs of bounded treedepth
- A LOCAL view of the polynomial hierarchy
- Distributed quantum proofs for replicated data
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)
