Fast deterministic algorithms for highly-dynamic networks
From MaRDI portal
Cites work
- A lower bound for the distributed Lovász local lemma
- A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
- A time hierarchy theorem for the LOCAL model
- Adapting local sequential algorithms to the distributed setting
- An exponential separation between randomized and deterministic complexity in the LOCAL model
- Distributed computation in dynamic networks
- Distributed detection of cliques in dynamic networks
- Distributed error confinement
- Distributed Graph Coloring: Fundamentals and Recent Developments
- Fault-Local Distributed Mending
- Fully dynamic maximal independent set with polylogarithmic update time
- Fully Dynamic Maximal Independent Set with Sublinear in n Update Time
- Fully dynamic maximal independent set with sublinear update time
- scientific article; zbMATH DE number 6850309 (Why is no real title available?)
- Local-on-average distributed tasks
- Locally-iterative distributed \((\Delta+1)\)-coloring below Szegedy-Vishwanathan barrier, and applications to self-stabilization and to restricted-bandwidth models
- New classes of distributed time complexity
- On the complexity of local distributed graph problems
- Optimal dynamic distributed MIS
- Self-stabilization
- Survey of local algorithms
- Tight Fault Locality
- What Can be Computed Locally?
This page was built for publication: Fast deterministic algorithms for highly-dynamic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6834017)
