The following pages link to (Q4967211):
Displayed 15 items.
- What can be verified locally? (Q1672006) (← links)
- On mobile agent verifiable problems (Q1753994) (← links)
- Deciding and verifying network properties locally with few output bits (Q1988527) (← links)
- Redundancy in distributed proofs (Q2025853) (← links)
- Compact distributed certification of planar graphs (Q2037111) (← links)
- Proof labeling schemes for reachability-related problems in directed graphs (Q2097332) (← links)
- A hierarchy of local decision (Q2219059) (← links)
- A Time Hierarchy Theorem for the LOCAL Model (Q4646447) (← links)
- Introduction to local certification (Q5024672) (← links)
- (Q5090916) (← links)
- (Q5090917) (← links)
- Distributed Testing of Distance-k Colorings (Q5100965) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- How long it takes for an ordinary node with an ordinary ID to output? (Q5916003) (← links)
- Approximate proof-labeling schemes (Q5919426) (← links)