The following pages link to Distributed Computing (Q5395154):
Displayed 26 items.
- Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds (Q342718) (← links)
- Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647) (← links)
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- Distributed approximation of capacitated dominating sets (Q613113) (← links)
- An optimal bit complexity randomized distributed MIS algorithm (Q658666) (← links)
- The abstract MAC layer (Q661062) (← links)
- Distributed independent sets in interval and segment intersection graphs (Q831804) (← links)
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- An optimal maximal independent set algorithm for bounded-independence graphs (Q992507) (← links)
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition (Q992509) (← links)
- Empire of colonies: Self-stabilizing and self-organizing distributed algorithm (Q1004316) (← links)
- The coverage-control optimization in sensor network subject to sensing area (Q1029837) (← links)
- Design patterns in beeping algorithms: examples, emulation, and analysis (Q1633808) (← links)
- Deterministic distributed construction of \(T\)-dominating sets in time \(T\) (Q1786883) (← links)
- Sublinear search spaces for shortest path planning in grid and road networks (Q2230730) (← links)
- Low-congestion shortcut and graph parameters (Q2241301) (← links)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- A weakly robust PTAS for minimum clique partition in unit disk graphs (Q2428685) (← links)
- Beeping a maximal independent set (Q2441534) (← links)
- On the computation of fixed points in Boolean networks (Q2511059) (← links)
- An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) (Q3408183) (← links)
- Fast Distributed Approximations in Planar Graphs (Q3540222) (← links)
- Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs (Q3602842) (← links)
- Simple Neural-Like P Systems for Maximal Independent Set Selection (Q5378208) (← links)
- (Q5743464) (← links)