The following pages link to Stone age distributed computing (Q5176089):
Displaying 18 items.
- Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds (Q342718) (← links)
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- How many ants does it take to find the food? (Q896147) (← links)
- Design patterns in beeping algorithms: examples, emulation, and analysis (Q1633808) (← links)
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication (Q1689748) (← links)
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits (Q2002052) (← links)
- Dynamic networks of finite state machines (Q2292917) (← links)
- The ANTS problem (Q2401118) (← links)
- Searching without communicating: tradeoffs between performance and selection complexity (Q2401119) (← links)
- Counting in one-hop beeping networks (Q2420611) (← links)
- Constant space and non-constant time in distributed computing (Q3300833) (← links)
- Distributed Dominating Set Approximations beyond Planar Graphs (Q4972685) (← links)
- (Q5089274) (← links)
- (Q5090892) (← links)
- The Synergy of Finite State Machines (Q5091099) (← links)
- Weak models of distributed computing, with connections to modal logic (Q5918244) (← links)
- Communication complexity meets cellular automata: necessary conditions for intrinsic universality (Q6095497) (← links)
- The hardness of local certification of finite-state dynamics (Q6547916) (← links)
