Agreeing within a few writes

DOI10.1016/j.tcs.2022.04.030OpenAlexW4224928728MaRDI QIDQ2672593

Corentin Travers, Pierre Sutra, Zohir Bouzid

Publication date: 13 June 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.04.030

zbMATH Keywords

consensusagreementanonymityasynchronous shared memoryadopt-commitconflict detectorhomonym processessolo fast algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• From binary consensus to multivalued consensus in asynchronous message-passing systems
• Tight bounds for adopt-commit objects
• Anonymity-preserving failure detectors
• Lower bound on the step complexity of anonymous binary consensus
• On the uncontended complexity of anonymous agreement
• Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
• Computing in totally anonymous asynchronous shared memory systems
• Anonymous and fault-tolerant shared-memory computing
• Round-by-round fault detectors (extended abstract)
• Structured derivations of consensus algorithms for failure detectors
• The topological structure of asynchronous computability
• The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity
• Impossibility of distributed consensus with one faulty process
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Unifying Concurrent Objects and Distributed Tasks
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• A modular approach to shared-memory consensus, with applications to the probabilistic-write model
• Generalized FLP impossibility result for t-resilient asynchronous computations
• On the space complexity of randomized synchronization
• Distributed Computing
• Distributed Computing
• Computation in networks of passively mobile finite-state sensors
• From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems
• Byzantine agreement with homonyms
• Distributed Computing
• Designing privacy enhancing technologies. International workshop on design issues in anonymity and unobservability. Berkeley, CA, USA, July 25--26, 2000. Proceedings

This page was built for publication: Agreeing within a few writes