A topological perspective on distributed network algorithms
From MaRDI portal
Recommendations
Cites work
- k-set agreement in communication networks with omission faults
- A characterization of oblivious message adversaries for which consensus is solvable
- A lower bound for the distributed Lovász local lemma
- A topological perspective on distributed network algorithms
- Algebraic spans
- An axiomatic approach to computing the connectivity of synchronous and asynchronous systems
- An Improved Distributed Algorithm for Maximal Independent Set
- An optimal distributed (+1)-coloring algorithm?
- Approximate consensus in highly dynamic networks: the role of averaging algorithms
- Bounds on the step and namespace complexity of renaming
- Coordinated consensus in dynamic networks
- Defining liveness
- Distributed \((\Delta+1)\)-coloring in sublogarithmic rounds
- Distributed computability in Byzantine asynchronous systems
- Distributed computation in dynamic networks
- Distributed computing through combinatorial topology
- Distributed Computing: A Locality-Sensitive Approach
- Fast, robust, quantizable approximate consensus
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- Impossibility of distributed consensus with one faulty process
- Linear-in- lower bounds in the LOCAL model
- Local computation: lower and upper bounds
- Locality in Distributed Graph Algorithms
- Locally-iterative distributed \((\Delta+1)\)-coloring below Szegedy-Vishwanathan barrier, and applications to self-stabilization and to restricted-bandwidth models
- Network topology and fault-tolerant consensus
- New combinatorial topology bounds for renaming: the lower bound
- New combinatorial topology bounds for renaming: the upper bound
- On the complexity of local distributed graph problems
- On the expressivity of time-varying graphs
- Set consensus using arbitrary objects (preliminary version)
- Survey of local algorithms
- The asynchronous computability theorem for t-resilient tasks
- The complexity of data aggregation in directed networks
- The Heard-Of model: computing in distributed systems with benign faults
- The Iterated Restricted Immediate Snapshot Model
- The topological structure of asynchronous computability
- The topology of look-compute-move robot wait-free algorithms with hard termination
- Tight bounds for k-set agreement
- Tight bounds for asymptotic and approximate consensus
- Topological Characterization of Consensus under General Message Adversaries
- Wait-free k-set agreement is impossible
- Why extension-based proofs fail
Cited in
(16)- An overview of synchronous message-passing and topology
- The complexity of early deciding set agreement: how can topology help?
- Using the topological characterization of synchronous models
- Characterizing topological assumptions of distributed algorithms in dynamic networks
- scientific article; zbMATH DE number 4058842 (Why is no real title available?)
- The topology aware file distribution problem
- Network topology and fault-tolerant consensus
- Back to the coordinated attack problem
- An Introduction to the Topological Theory of Distributed Computing with Safe-consensus
- A topological perspective on distributed network algorithms
- Defining logical obstruction with fixpoints in epistemic logic
- Pseudospheres: combinatorics, topology and distributed systems
- The topology of local computing in networks
- A speedup theorem for asynchronous computation with applications to consensus and approximate agreement
- Keynote: Time is not a healer: before and after
- Agreement tasks in fault-prone synchronous networks of arbitrary structure
This page was built for publication: A topological perspective on distributed network algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919043)
