scientific article
From MaRDI portal
Publication:3549610
zbMath1232.68171MaRDI QIDQ3549610
Keren Censor-Hillel, Hagit Attiya
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
lower boundsasynchronous shared memory systemdistributed consensus algorithmrandomized consensus algorithms
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Distributed algorithms (68W15)
Related Items
A modular approach to shared-memory consensus, with applications to the probabilistic-write model ⋮ The correctness proof of Ben-Or's randomized consensus algorithm ⋮ Layered reasoning for randomized distributed algorithms ⋮ Combining shared-coin algorithms ⋮ Classifying rendezvous tasks of arbitrary dimension
