The following pages link to Randomized proof-labeling schemes (Q2796267):
Displaying 14 items.
- Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs (Q1686112) (← links)
- Randomized proofs in arithmetic (Q1807460) (← links)
- Randomized proof-labeling schemes (Q2002054) (← links)
- Compact distributed certification of planar graphs (Q2037111) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Proof labeling schemes (Q2377139) (← links)
- A Randomized Algorithm for BBCSPs in the Prover-Verifier Model (Q3525105) (← links)
- Redundancy in distributed proofs (Q5090916) (← links)
- Fast distributed algorithms for testing graph properties (Q5915702) (← links)
- Approximate proof-labeling schemes (Q5919426) (← links)
- Proof-carrying data from arithmetized random oracles (Q6061366) (← links)
- Error-sensitive proof-labeling schemes (Q6487487) (← links)
- Invited Paper: Reactive PLS for Distributed Decision (Q6487898) (← links)
- Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs (Q6488452) (← links)