Redundancy in distributed proofs

Distributed proofs are mechanisms that enable the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the structure of the network (e.g., having a specific diameter), or on objects distributed over the nodes (e.g., a spanning tree). We consider well know...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Distributed computing Ročník 34; číslo 2; s. 113 - 132
Hlavní autoři:	Feuilloley, Laurent, Fraigniaud, Pierre, Hirvonen, Juho, Paz, Ami, Perry, Mor
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2021 Springer Nature B.V Springer Verlag
Témata:	Algorithms Boolean algebra Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Data Structures and Algorithms Distributed, Parallel, and Cluster Computing Graph theory Nodes Redundancy Software Engineering/Programming and Operating Systems Theory of Computation Distributed graph algorithms Proof-labeling schemes Space-time tradeoffs Distributed verification Nondeterminism
ISSN:	0178-2770, 1432-0452
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!