The following pages link to (Q4598260):
Displaying 16 items.
- What can be verified locally? (Q1672006) (← links)
- Deciding and verifying network properties locally with few output bits (Q1988527) (← links)
- Randomized proof-labeling schemes (Q2002054) (← links)
- Redundancy in distributed proofs (Q2025853) (← links)
- Compact distributed certification of planar graphs (Q2037111) (← links)
- A hierarchy of local decision (Q2219059) (← links)
- Proof-labeling schemes: broadcast, unicast and in between (Q2672621) (← links)
- Locally checkable proofs in distributed computing (Q3179347) (← links)
- (Q4967233) (← links)
- Introduction to local certification (Q5024672) (← links)
- Redundancy in distributed proofs (Q5090916) (← links)
- Local verification of global proofs (Q5090917) (← links)
- What can be decided locally without identifiers? (Q5176091) (← links)
- On the Impact of Identifiers on Local Decision (Q5499979) (← links)
- Fast distributed algorithms for testing graph properties (Q5915702) (← links)
- Approximate proof-labeling schemes (Q5919426) (← links)