Distributed CONGEST Algorithms against Mobile Adversaries (Q6202259): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q130816785, #quickstatements; #temporary_batch_1733738269825 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: On the round complexity of randomized Byzantine agreement / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Small cuts and connectivity certificates: a fault tolerant approach / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q130816785 / rank | |||
Normal rank | |||
Latest revision as of 11:01, 9 December 2024
scientific article; zbMATH DE number 7824333
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Distributed CONGEST Algorithms against Mobile Adversaries |
scientific article; zbMATH DE number 7824333 |
Statements
Distributed CONGEST Algorithms against Mobile Adversaries (English)
0 references
26 March 2024
0 references
CONGEST
0 references
fault tolerance
0 references
interactive coding
0 references
0 references
0 references
0 references
