Redundancy in distributed proofs
type: Item
instance of: scholarly article
title: Redundancy in distributed proofs
author: Laurent Feuilloley
author: Pierre Fraigniaud
author: Juho Hirvonen
author: Ami Paz
author: Mor Perry
published in: Distributed Computing
publication date: 2021-05-17T00:00:00Z
full work available at URL: https://arxiv.org/abs/1803.03031
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 7348621
zbMATH Keywords: distributed verification
zbMATH Keywords: distributed graph algorithms
zbMATH Keywords: proof-labeling schemes
zbMATH Keywords: space-time tradeoffs
zbMATH Keywords: nondeterminism
MaRDI profile type: Publication
OpenAlex ID: W3091964988
cites work: Near-linear lower bounds for distributed distance computations, even in sparse networks
cites work: Local stabilizer
cites work: The local detection paradigm and its applications to self-stabilization
cites work: Distributedly Testing Cycle-Freeness
cites work: Memory-efficient and self-stabilizing network RESET (extended abstract)
cites work: Q4636605
cites work: On Mobile Agent Verifiable Problems
cites work: Transient fault detectors
cites work: Approximate proof-labeling schemes
cites work: Distributed Verification and Hardness of Distributed Approximation
cites work: Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem
cites work: Q4967211
cites work: Q4598260
cites work: Q5090916
cites work: Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs
cites work: Towards a complexity theory for local distributed computing
cites work: Randomized proof-labeling schemes
cites work: Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings
cites work: Perfect failure detection with very few bits
cites work: Q5743466
cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees
cites work: Q3179347
cites work: Interactive Distributed Proofs
cites work: Distributed verification of minimum spanning trees
cites work: Fast and compact self-stabilizing verification, computation, and fault detection of an MST
cites work: Proof labeling schemes
cites work: Communication Complexity
cites work: Probability and Computing
cites work: The Power of Distributed Verifiers in Interactive Proofs
cites work: Space-time tradeoffs for distributed verification
cites work: Proof-Labeling Schemes: Broadcast, Unicast and in Between
cites work: Distributed Computing: A Locality-Sensitive Approach
cites work: High-Probability Parallel Transitive-Closure Algorithms
cites work: Trade-offs in distributed interactive proofs
cites work: Error-sensitive proof-labeling schemes
Wikidata QID: Q113905016
DOI: 10.1007/S00446-020-00386-Z
Recommended article: Q5090916
Recommended article: Distributed Provers with Applications to Undeniable Signatures
Recommended article: Trade-offs in distributed interactive proofs
Recommended article: Q3179347
Recommended article: The Power of Distributed Verifiers in Interactive Proofs
Recommended article: Interactive Distributed Proofs
Recommended article: Security, veriflability, and universality in distributed computing
Recommended article: A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
Recommended article: Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
Recommended article: Proof rules for fault tolerant distributed programs
description: scientific article; zbMATH DE number 7348621