scientific article; zbMATH DE number 7561276
From MaRDI portal
Publication:5090916
DOI10.4230/LIPIcs.DISC.2018.24zbMath1497.68297MaRDI QIDQ5090916
Juho Hirvonen, Pierre Fraigniaud, Ami Paz, Mor Perry, Laurent Feuilloley
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
non-determinismdistributed verificationdistributed graph algorithmsproof-labeling schemesspace-time tradeoffs
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Distributed algorithms (68W15)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST
- Local stabilizer
- The local detection paradigm and its applications to self-stabilization
- Near-linear lower bounds for distributed distance computations, even in sparse networks
- Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs
- Space-time tradeoffs for distributed verification
- Transient fault detectors
- Distributed verification of minimum spanning trees
- Proof labeling schemes
- Randomized Proof-Labeling Schemes
- On Mobile Agent Verifiable Problems
- Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings
- Decidability Classes for Mobile Agents Computing
- Distributedly Testing Cycle-Freeness
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Distributed Computing: A Locality-Sensitive Approach
- Communication Complexity
- Distributed Verification and Hardness of Distributed Approximation
- Proof-Labeling Schemes: Broadcast, Unicast and in Between
- Interactive Distributed Proofs
- Towards a complexity theory for local distributed computing
- Approximate proof-labeling schemes
- Perfect failure detection with very few bits
This page was built for publication:
