Pages that link to "Item:Q5689809"

The following pages link to Fault-tolerant broadcasting and gossiping in communication networks (Q5689809):

Displaying 46 items.

• Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
• Stochastic and deterministic fault detection for randomized gossip algorithms (Q518288) (← links)
• Meeting the deadline: on the complexity of fault-tolerant continuous gossip (Q661066) (← links)
• \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
• A new parameter for a broadcast algorithm with locally bounded Byzantine faults (Q763544) (← links)
• Invited talk: Resilient distributed algorithms (Q831782) (← links)
• Broadcasting with locally bounded byzantine faults (Q835004) (← links)
• Fault-tolerant sequential scan (Q841615) (← links)
• Robust gossiping with an application to consensus (Q856404) (← links)
• Feasibility and complexity of broadcasting with random transmission failures (Q868959) (← links)
• Computing input multiplicity in anonymous synchronous networks with dynamic faults (Q876726) (← links)
• Rapid almost-complete broadcasting in faulty networks (Q1008737) (← links)
• A probabilistic characterization of a fault-tolerant gossiping algorithm (Q1044771) (← links)
• Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
• Efficient broadcasting with linearly bounded faults (Q1281388) (← links)
• Compound constructions of broadcast networks (Q1296577) (← links)
• Reliable broadcasting in product networks (Q1392523) (← links)
• Dynamic faults have small effect on broadcasting in hypercubes. (Q1427194) (← links)
• Efficient collective communciation in optical networks (Q1575944) (← links)
• Verifiable broadcasting and gossiping in communication networks (Q1602698) (← links)
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance. (Q1773296) (← links)
• Confidential gossip (Q2204776) (← links)
• The parameterized complexity of the minimum shared edges problem (Q2323342) (← links)
• Efficient gossip and robust distributed computation (Q2576871) (← links)
• Broadcasting in hypercubes and star graphs with dynamic faults. (Q2583571) (← links)
• Efficient communication in unknown networks (Q2747804) (← links)
• Asynchronous Broadcasting with Bivalent Beeps (Q2835032) (← links)
• A survey on undirected circulant graphs (Q2905302) (← links)
• The diameter and connectivity of networks with random dependent faults (Q3057173) (← links)
• Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults (Q3088334) (← links)
• Improved Bounds for Minimum Fault-Tolerant Gossip Graphs (Q3104777) (← links)
• Time-Efficient Broadcast in Radio Networks (Q3404475) (← links)
• FAST BROADCASTING WITH BYZANTINE FAULTS (Q3421854) (← links)
• A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS (Q3503008) (← links)
• Deterministic Models of Communication Faults (Q3599115) (← links)
• Tighter time bounds on fault-tolerant broadcasting and gossiping (Q4014613) (← links)
• Message-optimal protocols for fault-tolerant broadcasts/multicasts in distributed systems with crash failures (Q4419654) (← links)
• A fault-tolerant broadcast scheme in the star graph under the single-port, half-duplex communication model (Q4571428) (← links)
• Colouring paths in directed symmetric trees with applications to WDM routing (Q4571981) (← links)
• (Q4796195) (← links)
• A note on broadcasting with linearly bounded transmission faults in constant degree networks (Q5055930) (← links)
• (Q5150427) (← links)
• Feasibility and complexity of broadcasting with random transmission failures (Q5177256) (← links)
• New bounds on the minimum number of calls in failure‐tolerant gossiping (Q5191126) (← links)
• Algorithms - ESA 2003 (Q5897261) (← links)
• Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)