Pages that link to "Item:Q5395731"

The following pages link to Towards a complexity theory for local distributed computing (Q5395731):

Displaying 38 items.

• An interpretation of Shenoy and Shafer's axioms for local computation (Q911810) (← links)
• What can be verified locally? (Q1672006) (← links)
• Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs (Q1686112) (← links)
• On mobile agent verifiable problems (Q1753994) (← 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 meta-theorem for distributed certification (Q2097341) (← links)
• Local certification of graphs with bounded genus (Q2104916) (← links)
• What can be sampled locally? (Q2189170) (← links)
• A hierarchy of local decision (Q2219059) (← links)
• Randomized distributed decision (Q2256969) (← links)
• A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring (Q2304020) (← links)
• Allowing each node to communicate only once in a distributed system: shared whiteboard models (Q2355326) (← links)
• The ANTS problem (Q2401118) (← links)
• Proof-labeling schemes: broadcast, unicast and in between (Q2672621) (← links)
• The Local Information Dynamics of Distributed Computation in Complex Systems (Q3166398) (← links)
• The Time-Complexity of Local Decision in Distributed Agreement (Q3507518) (← links)
• Local Computation Schemes with Partially Ordered Preferences (Q3638136) (← links)
• A Time Hierarchy Theorem for the LOCAL Model (Q4646447) (← links)
• (Q4668735) (← links)
• Introduction to local certification (Q5024672) (← links)
• Redundancy in distributed proofs (Q5090916) (← links)
• Local verification of global proofs (Q5090917) (← links)
• (Q5091092) (← links)
• Distributed Testing of Distance-k Colorings (Q5100965) (← links)
• (Q5155689) (← links)
• What Can be Computed in a Distributed System? (Q5170751) (← links)
• How long it takes for an ordinary node with an ordinary ID to output? (Q5916003) (← links)
• Approximate proof-labeling schemes (Q5919426) (← links)
• Making local algorithms wait-free: the case of ring coloring (Q5920224) (← links)
• (Q6065460) (← links)
• Transmitting once to elect a leader on wireless networks (Q6077889) (← 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)
• Locally verifiable distributed SNARGs (Q6581783) (← links)