Pages that link to "Item:Q3179347"

The following pages link to Locally checkable proofs in distributed computing (Q3179347):

Displaying 32 items.

• Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs (Q1686112) (← links)
• On mobile agent verifiable problems (Q1753994) (← links)
• Almost global problems in the LOCAL model (Q1981631) (← 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)
• Local certification of graphs on surfaces (Q2078616) (← links)
• Proof labeling schemes for reachability-related problems in directed graphs (Q2097332) (← links)
• A meta-theorem for distributed certification (Q2097341) (← links)
• Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← links)
• Local certification of graphs with bounded genus (Q2104916) (← links)
• A new approach on locally checkable problems (Q2127611) (← links)
• Planarity can be verified by an approximate proof labeling scheme in constant-time (Q2154327) (← links)
• Emptiness problems for distributed automata (Q2182732) (← links)
• A hierarchy of local decision (Q2219059) (← links)
• A Time Hierarchy Theorem for the LOCAL Model (Q4646447) (← links)
• Introduction to local certification (Q5024672) (← links)
• Redundancy in distributed proofs (Q5090916) (← links)
• Local verification of global proofs (Q5090917) (← links)
• Distributed Testing of Distance-k Colorings (Q5100965) (← links)
• Approximate proof-labeling schemes (Q5919426) (← links)
• (Q6065460) (← links)
• Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width (Q6094029) (← links)
• Lower bound for constant-size local certification (Q6155248) (← links)
• A meta-theorem for distributed certification (Q6182681) (← links)
• Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs (Q6488452) (← links)
• The complexity landscape of distributed locally checkable problems on trees (Q6535015) (← links)
• Twenty-two new approximate proof labeling schemes (Q6535018) (← links)
• Brief announcement: Distributed quantum proofs for replicated data (Q6535042) (← links)
• The hardness of local certification of finite-state dynamics (Q6547916) (← links)
• Locally verifiable distributed SNARGs (Q6581783) (← links)