Simulations and reductions for colorless tasks
From MaRDI portal
Publication:2933802
Recommendations
- The BG distributed simulation algorithm
- The multiplicative power of consensus numbers
- The extended BG-simulation and the characterization of t-resiliency
- Distributed computing through combinatorial topology
- From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Cited in
(11)- Power and limits of distributed computing shared memory models
- A simplicial complex model for dynamic epistemic logic to study distributed task computability
- The topology of local computing in networks
- A simplicial complex model for dynamic epistemic logic to study distributed task computability
- Wait-free solvability of colorless tasks in anonymous shared-memory model
- The topology of distributed adversaries
- Untangling partial agreement: iterated \(x\)-consensus simulations
- Collapsibility of read/write models using discrete Morse theory
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing
- The BG distributed simulation algorithm
- The multiplicative power of consensus numbers
This page was built for publication: Simulations and reductions for colorless tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933802)