Local certification of graphs with bounded genus

Naor, Parter, and Yogev [SODA 2020] recently designed a compiler for automatically translating standard centralized interactive protocols to distributed interactive protocols, as introduced by Kol, Oshman, and Saxena [PODC 2018]. In particular, by using this compiler, every linear-time algorithm for...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 325; s. 9 - 36
Hlavní autori:	Feuilloley, Laurent, Fraigniaud, Pierre, Montealegre, Pedro, Rapaport, Ivan, Rémila, Éric, Todinca, Ioan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 30.01.2023 Elsevier
Predmet:	Computer Science Distributed graph algorithms Distributed, Parallel, and Cluster Computing Local certification Locally checkable proofs Proof-labeling scheme Distributed graph algorithms Proof-labeling scheme Locally checkable proofs Local certification 2012 ACM Subject Classification D.1.3 Concurrent Programming (Distributed programming) proof-labeling scheme locally checkable proofs
ISSN:	0166-218X, 1872-6771
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!