Pages that link to "Item:Q5138357"

The following pages link to The BG distributed simulation algorithm (Q5138357):

Displaying 21 items.

• Power and limits of distributed computing shared memory models (Q392187) (← links)
• Collapsibility of read/write models using discrete Morse theory (Q1616395) (← links)
• Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers (Q1741965) (← links)
• The topology of look-compute-move robot wait-free algorithms with hard termination (Q2002056) (← links)
• From wait-free to arbitrary concurrent solo executions in colorless distributed computing (Q2397607) (← links)
• Locality and checkability in wait-free computing (Q2441537) (← links)
• Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement (Q2672233) (← links)
• Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects (Q2802146) (← links)
• (Q3305190) (← links)
• Hundreds of impossibility results for distributed computing (Q5138488) (← links)
• Condition-based consensus solvability: a hierarchy of conditions and efficient protocols (Q5138500) (← links)
• Untangling Partial Agreement: Iterated x-consensus Simulations (Q5207909) (← links)
• A closer look at fault tolerance (Q5895044) (← links)
• Wait-freedom with advice (Q5918242) (← links)
• Wait-free approximate agreement on graphs (Q5918635) (← links)
• Wait-free approximate agreement on graphs (Q5925616) (← links)
• Tasks in modular proofs of concurrent algorithms (Q6044466) (← links)
• The solvability of consensus in iterated models extended with safe-consensus (Q6056624) (← links)
• Tasks in modular proofs of concurrent algorithms (Q6536328) (← links)
• Revisionist simulations: a new approach to proving space lower bounds (Q6583675) (← links)
• The topology of local computing in networks (Q6645920) (← links)