The following pages link to Locally checkable proofs (Q2943393):
Displaying 10 items.
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- What can be verified locally? (Q1672006) (← links)
- Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs (Q1686112) (← links)
- Deciding and verifying network properties locally with few output bits (Q1988527) (← links)
- Local mending (Q2097329) (← links)
- Randomized distributed decision (Q2256969) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- Locality and checkability in wait-free computing (Q2441537) (← links)
- Proof-labeling schemes: broadcast, unicast and in between (Q2672621) (← links)
- Locality and Checkability in Wait-Free Computing (Q3095336) (← links)
