scientific article; zbMATH DE number 1559574
From MaRDI portal
Publication:4527026
zbMath0963.68013MaRDI QIDQ4527026
Sergio Rajsbaum, Maurice P. Herlihy
Publication date: 28 February 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An algorithmic approach to the asynchronous computability theorem ⋮ Unnamed Item ⋮ From wait-free to arbitrary concurrent solo executions in colorless distributed computing ⋮ The topology of distributed adversaries ⋮ Power and limits of distributed computing shared memory models ⋮ Communication Complexity of Wait-Free Computability in Dynamic Networks ⋮ Unnamed Item ⋮ Locality and checkability in wait-free computing ⋮ The BG distributed simulation algorithm ⋮ Hundreds of impossibility results for distributed computing ⋮ Condition-based consensus solvability: a hierarchy of conditions and efficient protocols ⋮ The disagreement power of an adversary ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ New combinatorial topology bounds for renaming: the lower bound ⋮ A simplicial complex model for dynamic epistemic logic to study distributed task computability ⋮ Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects ⋮ Untangling Partial Agreement: Iterated x-consensus Simulations ⋮ Wait-free solvability of colorless tasks in anonymous shared-memory model ⋮ A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks ⋮ Wait-free approximate agreement on graphs ⋮ Classifying rendezvous tasks of arbitrary dimension ⋮ Locality and Checkability in Wait-Free Computing ⋮ The evolution of non-degenerate and degenerate rendezvous tasks ⋮ A classification of wait-free loop agreement tasks
