On the Impact of Identifiers on Local Decision
From MaRDI portal
Publication:5499979
DOI10.1007/978-3-642-35476-2_16zbMath1323.68032arXiv1512.06989MaRDI QIDQ5499979
Amos Korman, Pierre Fraigniaud, Magnús M. Halldórsson
Publication date: 5 August 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.06989
68Q25: Analysis of algorithms and problem complexity
68M14: Distributed systems
68W15: Distributed algorithms
Related Items
Introduction to local certification, Approximate proof-labeling schemes, Fast and compact self-stabilizing verification, computation, and fault detection of an MST, Node labels in local decision, What can be verified locally?, Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs, On mobile agent verifiable problems, Deciding and verifying network properties locally with few output bits, Randomized proof-labeling schemes, Proof labeling schemes for reachability-related problems in directed graphs, Planarity can be verified by an approximate proof labeling scheme in constant-time, A hierarchy of local decision, Proof-labeling schemes: broadcast, unicast and in between
