Constant-degree, polylog-work, constant-fault-tolerant routing networks are constructed via a new graph-product composition technique, resolving the main open problem of DPPU86.
Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Constant Degree Networks for Almost-Everywhere Reliable Transmission
Constant-degree, polylog-work, constant-fault-tolerant routing networks are constructed via a new graph-product composition technique, resolving the main open problem of DPPU86.