Asynchronous approximate agreement
From MaRDI portal
Publication:1341756
DOI10.1006/inco.1994.1094zbMath0938.68944OpenAlexW1985434631MaRDI QIDQ1341756
Publication date: 21 June 2000
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9c2242462c2663baf07448932829a83eabc1c185
Related Items (6)
Hundreds of impossibility results for distributed computing ⋮ Tight bounds on the round complexity of distributed 1-solvable tasks ⋮ Approximate agreement under mobile Byzantine faults ⋮ Strong order-preserving renaming in the synchronous message passing model ⋮ Wait-free approximate agreement on graphs ⋮ Wait-free approximate agreement on graphs
This page was built for publication: Asynchronous approximate agreement
