The following pages link to Proof labeling schemes (Q2377139):
Displaying 50 items.
- Topology recognition with advice (Q259077) (← links)
- Tight bounds for distributed minimum-weight spanning tree verification (Q372968) (← links)
- Drawing maps with advice (Q433400) (← links)
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- Fast rendezvous with advice (Q896137) (← links)
- A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem (Q1625600) (← 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)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← 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)
- Advice complexity of treasure hunt in geometric terrains (Q2051769) (← links)
- Optimized silent self-stabilizing scheme for tree-based constructions (Q2072099) (← links)
- Local certification of graphs on surfaces (Q2078616) (← links)
- Local mending (Q2097329) (← 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)
- Planarity can be verified by an approximate proof labeling scheme in constant-time (Q2154327) (← links)
- A hierarchy of local decision (Q2219059) (← links)
- Randomized distributed decision (Q2256969) (← links)
- The ANTS problem (Q2401118) (← links)
- Locality and checkability in wait-free computing (Q2441537) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- Finding the size and the diameter of a radio network using short labels (Q2661761) (← links)
- Proof-labeling schemes: broadcast, unicast and in between (Q2672621) (← links)
- Locality and Checkability in Wait-Free Computing (Q3095336) (← links)
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
- Introduction to local certification (Q5024672) (← links)
- (Q5090916) (← links)
- (Q5090917) (← links)
- Distributed Testing of Distance-k Colorings (Q5100965) (← links)
- On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency (Q5881540) (← links)
- Fast distributed algorithms for testing graph properties (Q5915702) (← links)
- Short labeling schemes for topology recognition in wireless tree networks (Q5915998) (← links)
- Approximate proof-labeling schemes (Q5919426) (← links)
- (Q6065460) (← links)
- Four shades of deterministic leader election in anonymous networks (Q6071119) (← 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)
- Edge exploration of anonymous graph by mobile agent with external help (Q6488105) (← links)
- Twenty-two new approximate proof labeling schemes (Q6535018) (← links)
- Brief announcement: Distributed quantum proofs for replicated data (Q6535042) (← links)
- Reducing the number of messages in self-stabilizing protocols (Q6536331) (← links)
- The hardness of local certification of finite-state dynamics (Q6547916) (← links)
