Proof-Labeling Schemes: Broadcast, Unicast and in Between

DOI10.1007/978-3-319-69084-1_1zbMath1498.68023OpenAlexW2963368942MaRDI QIDQ5045429

Mor Perry, Boaz Patt-Shamir

Publication date: 4 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-69084-1_1

zbMATH Keywords

verification complexitycongested cliqueCONGEST modelproof-labeling schemes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items (7)

A hierarchy of local decision ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Redundancy in distributed proofs ⋮ The Impact of Locality in the Broadcast Congested Clique Model ⋮ Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE ⋮ Introduction to local certification

This page was built for publication: Proof-Labeling Schemes: Broadcast, Unicast and in Between