Exploring Gafni’s Reduction Land: From Ω k to Wait-Free Adaptive $(2p-\lceil\frac{p}{k}\rceil)$ -Renaming Via k-Set Agreement

DOI10.1007/11864219_1zbMath1155.68337OpenAlexW2558224250MaRDI QIDQ3524290

Achour Mostefaoui, Corentin Travers, Michel Raynal

Publication date: 9 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11864219_1

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14)

Related Items (4)

On the weakest failure detector ever ⋮ The renaming problem in shared memory systems: an introduction ⋮ Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects ⋮ From adaptive renaming to set agreement

This page was built for publication: Exploring Gafni’s Reduction Land: From Ω k to Wait-Free Adaptive $(2p-\lceil\frac{p}{k}\rceil)$ -Renaming Via k-Set Agreement