scientific article; zbMATH DE number 857072
From MaRDI portal
Publication:4870160
Recommendations
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- A survey of gossiping and broadcasting in communication networks
- scientific article; zbMATH DE number 3693173
- Broadcasting and Gossiping in de Bruijn Networks
- Gossiping and broadcasting versus computing functions in networks
- Information dissemination in dynamic hypernetwork
- Gossiping and broadcasting versus computing functions in networks.
- Dynamics of gossip-like information dissemination in complex computer networks
- Publication:3359735
- Optimal algorithms for dissemination of information in some interconnection networks
Cited in
(87)- Symmetric flows and broadcasting in hypercubes
- Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
- scientific article; zbMATH DE number 2146643 (Why is no real title available?)
- Robust gossiping with an application to consensus
- Minimum time broadcast in faulty star networks
- Faster gossiping on butterfly networks
- The complexity of systolic dissemination of information in interconnection networks
- A survey of gossiping and broadcasting in communication networks
- Optimal sequential gossiping by short messages
- Broadcasting and Gossiping in de Bruijn Networks
- Periodic gossiping in back-to-back trees
- Lower bounds on systolic gossip
- Approximation algorithms in graphs with known broadcast time of the base graph
- Dynamic faults have small effect on broadcasting in hypercubes.
- On broadcasting in unicyclic graphs
- Deterministic broadcasting time with partial knowledge of the network.
- A note on the lower bound of centralized radio broadcasting for planar reachability graphs
- A note on line broadcast in digraphs under the edge-disjoint paths mode
- On linear-time data dissemination in dynamic rooted trees
- Effective systolic algorithms for gossiping in cycles and two-dimensional grids
- Upper bounds on the broadcast function using minimum dominating sets
- Efficient collective communciation in optical networks
- All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
- On the communication complexity of polling
- Gossiping and broadcasting versus computing functions in networks.
- Broadcasting from multiple originators
- Broadcasting multiple messages in the 1-in port model in optimal time
- Gossiping in vertex-disjoint paths mode in interconnection networks
- Rooted level-disjoint partitions of Cartesian products
- On the complexity of the shortest-path broadcast problem
- On generalized gossiping and broadcasting
- Colouring paths in directed symmetric trees with applications to WDM routing
- The logic of gossiping
- Optimal gossiping in square 2D meshes
- Broadcasting in hypercubes and star graphs with dynamic faults.
- Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
- Optimal broadcast on parallel locality models
- Fast gossiping by short messages
- Optimal gossiping in paths and cycles
- Parsimonious flooding in dynamic graphs
- Spreading of messages in random graphs
- On the number of broadcast schemes in networks
- Hierarchical broadcast and gossip networks
- Minimum multiple originator broadcast graphs
- Odd gossiping
- Verifiable broadcasting and gossiping in communication networks
- A survey on Knödel graphs.
- Sparse hypercube -- a minimal \(k\)-line broadcast graph.
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem
- Compound constructions of broadcast networks
- Reliable broadcasting in double loop networks
- Hierarchical broadcast networks
- Optimal odd gossiping
- Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
- Communication complexity of fault-tolerant information diffusion
- Diametral broadcast graphs
- The worst case behavior of randomized gossip protocols
- Messy broadcasting - decentralized broadcast schemes with limited knowledge
- Broadcasting in weighted trees under the postal model
- On the radius of nonsplit graphs and information dissemination in dynamic networks
- Strong bounds and exact solutions to the minimum broadcast time problem
- Search on a Line by Byzantine Robots
- Gossiping With Multiple Messages
- Graphs and algorithms in communication networks on seven league boots
- Group search of the plane with faulty robots
- Gossiping and broadcasting versus computing functions in networks
- On broadcast schemes of Knödel graphs
- Some properties of the Knödel graph \(W(k,2^k)\), \(k\geq 4\)
- A distributed algorithm for directed minimum-weight spanning tree
- Finding broadcast 2-centers of a tree under the postal model
- Diameter of General Knödel Graphs
- Deterministic Models of Communication Faults
- The complexity of finding a broadcast center
- scientific article; zbMATH DE number 1985614 (Why is no real title available?)
- Aggregation tree construction using hierarchical structures
- Communication in the two-way listen-in vertex-disjoint paths mode
- Gossiping and set-to-set broadcasting in weighted graphs
- Broadcasting in split graphs
- Broadcast time and connectivity
- Communication complexity of gossiping by packets
- Search on a line with faulty robots
- Spreading Messages
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
- Concurrent multicast in weighted networks
- Concurrent multicast in weighted networks
- Gathering in the plane of location-aware robots in the presence of spies
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4870160)
