Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
From MaRDI portal
(Redirected from Publication:1773296)
Recommendations
Cited in
(52)- Minimum broadcast tree decompositions
- Spreading messages
- Optimal gathering protocols on paths under interference constraints
- Broadcasting multiple messages in the 1-in port model in optimal time
- Optimal odd gossiping
- Gossiping by energy-constrained mobile agents in tree networks
- The shortest path problem in the Knödel graph
- Propositional gossip protocols
- Confidential gossip
- The logic of gossiping
- Modelling simultaneous broadcasting by level-disjoint partitions
- Optimal gossiping in square 2D meshes
- Minimum bisection is NP-hard on unit disk graphs
- Dynamic gossip
- Binary linear programming models for robust broadcasting in communication networks
- Minimal number of calls in propositional protocols
- Time-optimal broadcasting of multiple messages in 1-in port model
- Nonadaptive broadcasting in trees
- All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
- Information Dispersal and Parallel Computation
- Gossiping and routing in second-kind Frobenius graphs
- Upper bounds on the broadcast function using minimum dominating sets
- Theory and practice of discrete interacting agents models
- scientific article; zbMATH DE number 857072 (Why is no real title available?)
- Common knowledge in a logic of gossips
- Open problems in a logic of gossips
- Odd gossiping
- Efficient broadcast trees for weighted vertices
- A linear algorithm for finding the k‐broadcast center of a tree
- On Mixing and Edge Expansion Properties in Randomized Broadcasting
- Rumor spreading in social networks
- Broadcasting in weighted trees under the postal model
- Approximation algorithms in graphs with known broadcast time of the base graph
- Messy broadcasting - decentralized broadcast schemes with limited knowledge
- Parameterized Complexity of Broadcasting in Graphs
- Meeting the deadline: on the complexity of fault-tolerant continuous gossip
- Source-oblivious broadcast
- On broadcast schemes of Knödel graphs
- Rooted level-disjoint partitions of Cartesian products
- Maximizing the number of requests in oriented trees with a grooming factor
- A control-theoretic approach to disseminating values and overcoming malicious links in wireless networks
- Broadcast schemes of hypercubes
- All sequential dimensional broadcast schemes in Knödel graphs
- Broadcasting under structural restrictions
- Rotational circulant graphs
- Leader nodes in communities for information spreading
- On the runtime and robustness of randomized broadcasting
- Robust gossiping with an application to consensus
- On the complexity of the shortest-path broadcast problem
- On the complexity of bandwidth allocation in radio networks
- Broadcasting from multiple originators
- Gossiping by processors prone to omission failures
This page was built for publication: Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1773296)
