Pages that link to "Item:Q2875179"
From MaRDI portal
The following pages link to Distributed computation in dynamic networks (Q2875179):
Displaying 50 items.
- Traveling salesman problems in temporal graphs (Q284573) (← links)
- Upper and lower bounds for deterministic broadcast in powerline communication networks (Q324622) (← links)
- The computational power of simple protocols for self-awareness on graphs (Q392008) (← links)
- Efficient routing in carrier-based mobile networks (Q392206) (← links)
- A simple characterization of asynchronous computations (Q477089) (← links)
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- Connectivity preserving network transformers (Q529024) (← links)
- Meeting the deadline: on the complexity of fault-tolerant continuous gossip (Q661066) (← links)
- Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring (Q722206) (← links)
- On the treewidth of dynamic graphs (Q744102) (← links)
- Bounded-contention coding for the additive network model (Q748114) (← links)
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks (Q897391) (← links)
- Compact routing messages in self-healing trees (Q1686108) (← links)
- On linear-time data dissemination in dynamic rooted trees (Q1727754) (← links)
- Temporal network optimization subject to connectivity constraints (Q1739101) (← links)
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks (Q1743719) (← links)
- A faster exact-counting protocol for anonymous dynamic networks (Q1755728) (← links)
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony (Q1938370) (← links)
- Computing parameters of sequence-based dynamic graphs (Q1999994) (← links)
- Consensus in rooted dynamic networks with short-lived stability (Q2010603) (← links)
- Search on a line with faulty robots (Q2010608) (← links)
- Exploration of dynamic cactuses with sub-logarithmic overhead (Q2035475) (← links)
- How many cooks spoil the soup? (Q2075625) (← links)
- Synthesis in presence of dynamic links (Q2105465) (← links)
- Synchronization modulo \(P\) in dynamic networks (Q2110375) (← links)
- Distributed computation and reconfiguration in actively dynamic networks (Q2121068) (← links)
- Simple and fast approximate counting and leader election in populations (Q2139094) (← links)
- Some lower bounds in dynamic networks with oblivious adversaries (Q2174250) (← links)
- Distributed exploration of dynamic rings (Q2174251) (← links)
- On the radius of nonsplit graphs and information dissemination in dynamic networks (Q2185751) (← links)
- Exploration of carrier-based time-varying networks: the power of waiting (Q2202018) (← links)
- Exploration of dynamic networks: tight bounds on the number of agents (Q2229946) (← links)
- Polynomial anonymous dynamic distributed computing without a unique leader (Q2237890) (← links)
- The cost of global broadcast in dynamic radio networks (Q2285142) (← links)
- Group search of the plane with faulty robots (Q2326387) (← links)
- The firing squad problem revisited (Q2326403) (← links)
- Distributed computation in dynamic networks via random walks (Q2345448) (← links)
- A characterization of oblivious message adversaries for which consensus is solvable (Q2345460) (← links)
- On the expressivity of time-varying graphs (Q2348032) (← links)
- Distributed agreement in dynamic peer-to-peer networks (Q2353391) (← links)
- The complexity of optimal design of temporally connected graphs (Q2408566) (← links)
- Counting in one-hop beeping networks (Q2420611) (← links)
- How Many Cooks Spoil the Soup? (Q2835012) (← links)
- Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring (Q2868628) (← links)
- A Characterization of Dynamic Networks Where Consensus Is Solvable (Q2868629) (← links)
- Coordinated consensus in dynamic networks (Q2943377) (← links)
- Error-free multi-valued consensus with byzantine failures (Q2943378) (← links)
- Distributed graph coloring in a few rounds (Q2943379) (← links)
- MIS on trees (Q2943380) (← links)
- Toward more localized local algorithms (Q2943381) (← links)
