Generalized symmetry breaking tasks and nondeterminism in concurrent objects

agreement coordination nondeterminism symmetry breaking crash failure distributed computability wait-freedom set agreement concurrent object renaming asynchronous read/write model decision task problem hierarchy

Mathematics Subject Classification ID

Distributed systems (68M14)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Renaming in an asynchronous environment
Bit complexity of breaking and achieving symmetry in chains and rings
Unreliable failure detectors for reliable distributed systems
Impossibility of distributed consensus with one faulty process
Atomic snapshots of shared memory
More $choices$ allow more $faults$: Set consensus problems in totally asynchronous systems
The $k$-simultaneous consensus problem
The topological structure of asynchronous computability
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
Generalized FLP impossibility result for t-resilient asynchronous computations
Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
The topology of shared-memory adversaries
Set consensus using arbitrary objects (preliminary version)
Computing in totally anonymous asynchronous shared memory systems
A classification of wait-free loop agreement tasks
Wait-free algorithms for fast, long-lived renaming
The Combinatorial Structure of Wait-Free Solvable Tasks
Reaching approximate agreement in the presence of faults
Sharing memory robustly in message-passing systems
The renaming problem in shared memory systems: an introduction
Counting-Based Impossibility Proofs for Renaming and Set Agreement
The BG distributed simulation algorithm
From adaptive renaming to set agreement
Exploring Gafni’s Reduction Land: From Ω k to Wait-Free Adaptive $(2p-\lceil\frac{p}{k}\rceil)$ -Renaming Via k-Set Agreement
New combinatorial topology bounds for renaming: the lower bound
New combinatorial topology bounds for renaming
On set consensus numbers
The Committee Decision Problem
Distributed Computing
Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks
Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus
Sporadic Solutions to Zero-One Exclusion Tasks

Cited In (2)

A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
From wait-free to arbitrary concurrent solo executions in colorless distributed computing

This page was built for publication: Generalized symmetry breaking tasks and nondeterminism in concurrent objects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802146)