The following pages link to (Q4398822):
Displaying 43 items.
- Distributed universality (Q329296) (← links)
- The topology of distributed adversaries (Q360277) (← links)
- Anonymous asynchronous systems: the case of failure detectors (Q360279) (← links)
- Verification of distributed systems with local-global predicates (Q432134) (← links)
- Using asynchrony and zero degradation to speed up indulgent consensus protocols (Q436832) (← links)
- Linear space bootstrap communication schemes (Q477099) (← links)
- Randomized mutual exclusion on a multiple access channel (Q518923) (← links)
- Distributed agreement in tile self-assembly (Q537848) (← links)
- Threshold protocols in survivor set systems (Q661005) (← links)
- The complexity of updating snapshot objects (Q663413) (← links)
- Help when needed, but no more: efficient read/write partial snapshot (Q663424) (← links)
- Strong order-preserving renaming in the synchronous message passing model (Q708233) (← links)
- Multidimensional agreement in Byzantine systems (Q901876) (← links)
- New combinatorial topology bounds for renaming: the lower bound (Q992504) (← links)
- Labeling schemes for tree representation (Q1017912) (← links)
- Collapsibility of read/write models using discrete Morse theory (Q1616395) (← links)
- Terminating distributed construction of shapes and patterns in a fair solution of automata (Q1656881) (← links)
- Structure theory of flip graphs with applications to weak symmetry breaking (Q1659336) (← links)
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- Distributed probabilistic polling and applications to proportionate agreement (Q1854483) (← links)
- A distributed approximation algorithm for the bottleneck connected dominating set problem (Q1926605) (← links)
- Renaming and the weakest family of failure detectors (Q1938384) (← links)
- Relationships between broadcast and shared memory in reliable anonymous distributed systems (Q1953650) (← links)
- A family of optimal termination detection algorithms (Q1954237) (← links)
- Failure detectors as type boosters (Q1954255) (← links)
- Renaming in synchronous message passing systems with Byzantine failures (Q1954260) (← links)
- The weakest failure detectors to boost obstruction-freedom (Q1954262) (← links)
- The topology of look-compute-move robot wait-free algorithms with hard termination (Q2002056) (← links)
- A survey of challenges for runtime verification from advanced application domains (beyond software) (Q2008293) (← links)
- A simple Byzantine generals protocol (Q2015794) (← links)
- Making Asynchronous Distributed Computations Robust to Channel Noise (Q4993319) (← links)
- (Q5090894) (← links)
- (Q5090934) (← links)
- (Q5091079) (← links)
- Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)
- Long lived adaptive splitter and applications (Q5138373) (← links)
- Adaptive and efficient mutual exclusion (Q5138379) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Randomized protocols for asynchronous consensus (Q5138489) (← links)
- Condition-based consensus solvability: a hierarchy of conditions and efficient protocols (Q5138500) (← links)
- A case study on parametric verification of failure detectors (Q5883746) (← links)
- The solvability of consensus in iterated models extended with safe-consensus (Q6056624) (← links)
- Transmitting once to elect a leader on wireless networks (Q6077889) (← links)
