Pages that link to "Item:Q2441537"
From MaRDI portal
The following pages link to Locality and checkability in wait-free computing (Q2441537):
Displaying 12 items.
- On mobile agent verifiable problems (Q1753994) (← links)
- Randomized proof-labeling schemes (Q2002054) (← links)
- A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks (Q2043796) (← links)
- A new approach on locally checkable problems (Q2127611) (← 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)
- Translating submachine locality into locality of reference (Q2497735) (← links)
- Proof-labeling schemes: broadcast, unicast and in between (Q2672621) (← links)
- Locality and Checkability in Wait-Free Computing (Q3095336) (← links)
- (Q4490739) (← links)
- Approximate proof-labeling schemes (Q5919426) (← links)